Disambiguation of super parts of speech (or supertags)

作者: Aravind K. Joshi , B. Srinivas

DOI: 10.3115/991886.991912

关键词:

摘要: In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus parser for must search large set of supertags to choose the right ones combine parse sentence. We present techniques disambiguating using local information preference The similarity between LTAG Dependency grammars exploited in dependency model supertag disambiguation. performance results various models disambiguation unigram, trigram dependency-based are presented.

参考文章(6)
Aravind K. Joshi, Yves Schabes, Mathematical and computational aspects of lexicalized grammars University of Pennsylvania. ,(1990)
David Milward, Dynamics, dependency grammar and incremental interpretation international conference on computational linguistics. pp. 1095- 1099 ,(1992) , 10.3115/992424.992430
Donald Hindle, Prediction of lexicalized tree fragments in text Proceedings of the workshop on Human Language Technology - HLT '93. pp. 243- 247 ,(1993) , 10.3115/1075671.1075727
Kenneth Ward Church, A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text conference on applied natural language processing. pp. 136- 143 ,(1988) , 10.3115/974235.974260
Yves Schabes, Anne Abeille, Aravind K. Joshi, Parsing strategies with 'lexicalized' grammars Proceedings of the 12th conference on Computational linguistics -. pp. 578- 583 ,(1988) , 10.3115/991719.991757
Daniel Dominic Sleator, David Temperley, Parsing English with a Link Grammar Proceedings of the Third International Workshop on Parsing Technologies. pp. 277- 292 ,(1995)