«Traditionally, unification grammars are hand-coded. This is extremely time consuming, expensive and very difficult to scale. [...] we have developed a new method for automatically extracting wide-coverage probabilistic unification (LFG) grammars from treebank resources. To achieve this, we first automatically annotate the treebank (such as Penn-II) with feature-structure information (LFG f-structures, approximating to basic predicate-argument structure). From the f-structure annotated treebank, we then automatically extract wide-coverage, probabilistic LFG approximations to parse new text»
«takes as input a sequence of phrase-structure trees and modifies their labels according to a set of rules. ... Its rule notation is flexible enough to emulate head/argument-finding rules»
C. Callison-Burch, M. Osborne, und P. Koehn. Proceedings the Eleventh Conference of the European Chapter of the Association for Computational Linguistics, Seite 249--256. Trento, Italia, (2006)
J. DeNero, und D. Klein. Proceedings of ACL-08: HLT, Short Papers, Seite 25--28. Columbus, Ohio, Association for Computational Linguistics, (Juni 2008)
S. Riezler, J. Kuhn, D. Prescher, und M. Johnson. ACL '00: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, Seite 480--487. Morristown, NJ, USA, Association for Computational Linguistics, (2000)
A. Abeille, D. Godard, und I. Sag. Complex Predicates in Nonderivational Syntax, Volume 30 von Syntax and Semantics, Kapitel 1, Academic Press, New York, (1998)