A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity

Add to your list(s) Download to your calendar using vCal

• Diarmuid Ó Séaghdha (Computer Laboratory)
• Monday 18 May 2009, 13:00-14:00
• GS15, Computer Laboratory.

If you have a question about this talk, please contact Diarmuid Ó Séaghdha.

At this session of the NLIP Reading Group we’ll be discussing the following paper:

Feiyu Xu,Hans Uszkoreit and Hong Li. 2007. A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity. In Proceedings of ACL -07.

Abstract: A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as “seeds”, in order to automatically learn pattern rules from parsed data, which then can extract new instances of the relation and its projections. We propose a novel rule representation enabling the composition of n-ary relation rules on top of the rules for projections of the relation. The compositional approach to rule construction is supported by a bottom-up pattern extraction method. In comparison to other automatic approaches, our rules cannot only localize relation arguments but also assign their exact target argument roles. The method is evaluated in two tasks: the extraction of Nobel Prize awards and management succession events. Performance for the new Nobel Prize task is strong. For the management succession task the results compare favorably with those of existing pattern acquisition approaches.

This talk is part of the Natural Language Processing Reading Group series.

This talk is included in these lists:

• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• GS15, Computer Laboratory
• Guy Emerson's list
• Natural Language Processing Reading Group

Note that ex-directory lists are not shown.