«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»
T. Kamal, S. Hassan, S. Naqvi, and Imranullah. Emerging Trends in Electrical, Electronics & Instrumentation Engineering: An international Journal (EEIEJ), 1 (3):
17 to 28(August 2014)