«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»
K. Hagen, J. Johannessen, and A. Nøklestad. 17th Scandinavian Conference of Linguistics, volume 19 of Odense Working Papers in Language and Communication, Syddansk Universitet, Odense, (2000)
A. B, E. CR, F. T, G. FA, K. T, B. G, K. N, and M. S. Cochrane Database of Systematic Reviews, (2009)Art. No.: CD 007954. DOI: 10. 1002 / 14651858. CD 007954.
H. Dyvik. Proceedings of the Second Baltic Conference on Human Language Technologies, page 27--38. Tallinn, Institute of Cybernetics, Tallinn University of Technology & Institute of the Estonian Language, (2005)
V. Rosén, P. Meurer, and K. de Smedt. Proceedings of the 7th International Workshop on Treebanks and Linguistic Theories (TLT7), page 127--133. Utrecht, LOT, (2009)
P. Homola, and V. Kubon. 9th EAMT Workshop. ``Broadening horizons of machine translation and its applications'', page 90--97. Malta, EAMT, Foundation for International Studies, (2004)
P. Fung, Z. Wu, Y. Yang, and D. Wu. TMI-2007: Proceedings of the 11 th International Conference on Theoretical and Methodological Issues in Machine Translation, page 75--84. Skövde, Sweden, (2007)