«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»
Y. Samuelsson, and M. Volk. Treebanking for Discourse and Speech. Proceedings of the NODALIDA 2005 Special Session on Treebanks for Spoken Language and Discourse, volume 32 of Copenhagen Studies in Language, page 147. Forlaget Samfundslitteratur, København, (2005)
T. Lech, and K. Smedt. Proceedings from the first Bergen Workshop on Anaphora Resolution (WAR I), page 26--38. Newcastle upon Tyne, Cambridge Scholars Publishing, (2007)