Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
A stochastic parts program and noun phrase parser for unrestricted text
ANLC '88 Proceedings of the second conference on Applied natural language processing
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Dynamics, dependency grammar and incremental interpretation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Prediction of lexicalized tree fragments in text
HLT '93 Proceedings of the workshop on Human Language Technology
User-oriented smart-cache for the Web: what you seek is what you get!
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Towards a Natural Language Driven Automated Help Desk
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Rapid Prototyping of Domain-Specific Machine Translation Systems
AMTA '98 Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup
Supertagging: an approach to almost parsing
Computational Linguistics
A lightweight dependency analyzer for partial parsing
Natural Language Engineering
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Parsing with an extended domain of locality
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
How verb subcategorization frequencies are affected by corpus choice
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Some novel applications of Explanation-Based Learning to parsing Lexicalized Tree-Adjoining Grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
XTAG system: a wide coverage grammar for English
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Motivations and methods for text simplification
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Evaluating high accuracy retrieval techniques
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Data & Knowledge Engineering - Special jubilee issue: DKE 50
A SNoW based supertagger with application to NP chunking
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Head-Driven Statistical Models for Natural Language Parsing
Computational Linguistics
WCC '00 Proceedings of the workshop on Comparing corpora - Volume 9
A uniform method of grammar extraction and its applications
EMNLP '00 Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 13
A model of syntactic disambiguation based on lexicalized grammars
CONLL '03 Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - Volume 4
A finite-state model of human sentence processing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Old Linguists Never Die, They Only Get Obligatorily Deleted
Computational Linguistics
A psychologically plausible and computationally effective approach to learning syntax
ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7
CompareCorpora '00 Proceedings of the Workshop on Comparing Corpora
Robust parsing using a hidden Markov model
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
| Hi-index | 0.00 |
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 a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambiguating supertags using local information such as lexical preference and local lexical dependencies. The similarity between LTAG and Dependency grammars is exploited in the dependency model of supertag disambiguation. The performance results for various models of supertag disambiguation such as unigram, trigram and dependency-based models are presented.