«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»
S. Riezler, J. Kuhn, D. Prescher, и M. Johnson. ACL '00: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, стр. 480--487. Morristown, NJ, USA, Association for Computational Linguistics, (2000)