user- «Traditionally, unification grammars are hand-coded. This is extremely time consuming, expensive and very difficult to scale. [...] we have developed a new...«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»
- Parallel corpora, freely available
- Very Google Suggest-like
- by: Michel Simard Pierre Plamondon
- Evaluating multiple word/sentence alignment and WSD systems
- Documentation for LFG resources at UiB, by Paul Meurer
- Treebanks and Linguistic Theories, conference
- Universitetet i Bergen, Bergen, Norway, (2010)
- Proceedings of the Workshop on Human Judgements in Computational Linguistics, page 51--57. Manchester, Association for Computational Linguistics, Association for Computational Linguistics, (2008)
- International Journal of Communications Law and Policy (2009)
- Computational Linguistics 29(1):19-51 (2003)
- Proceedings of LFG09, page 317--337. Trinity College, Cambridge, CSLI Publications, (2009)
- NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, page 48--54. Morristown, NJ, Association for Computational Linguistics, Association for Computational Linguistics, (2003)
- COLING-GEE '02 Proceedings of the 2002 Workshop on Grammar Engineering and Evaluation, 15, page 1--7. Morristown, NJ, Association for Computational Linguistics, Association for Computational Linguistics, (2002)
- Proceedings of the Eighth International Workshop on Treebanks and Linguistic Theories, page 71--82. Milano, EDUCatt, (2009)
- Proceedings of the 31st Annual Conference of the Association for Computational Linguistics, page 9--16. Columbus, Ohio, Association for Computational Linguistics, Association for Computational Linguistics, (1993)
- Computational Linguistics 19(2):263--311 (1993)
- COLING-GEE '02 Proceedings of the 2002 Workshop on Grammar Engineering and Evaluation, 15, page 1--7. Morristown, NJ, Association for Computational Linguistics, Association for Computational Linguistics, (2002)
- Proceedings of Treebanks and Linguistic Theories TLT '07, Bergen, Norway, NEALT, (2007)
- Proceedings of the Workshop on Natural Language Processing Methods and Corpora in Translation, Lexicography, and Language Learning, page 33--39. Borovets, Bulgaria, Association for Computational Linguistics, Association for Computational Linguistics, (2009)
- Proceedings of the Workshop on Linguistic Coreference, page 74--78. Granada, LREC, (1998)
- (2009)
- (2010)accepted .
- Proceedings of the 22nd International Conference on Computational Linguistics, 1, page 1105--1112. Manchester, Association for Computational Linguistics, Association for Computational Linguistics, (2008)
- Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 1, page 8--15. Sapporo, Japan, Association for Computational Linguistics, Association for Computational Linguistics, (2003)
- Proceedings of Treebanks and Linguistic Theories TLT '07, Bergen, Norway, NEALT, (2007)
- Proceedings of Treebanks and Linguistic Theories TLT '06, Prague, ÚFAL, (2006)
