Class-based n-gram models of natural language
Computational Linguistics
Tree-bank Grammars
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Coping with ambiguity and unknown words through probabilistic models
Computational Linguistics - Special issue on using large corpora: II
A structure-sharing parser for lexicalized grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Improving data driven wordclass tagging by system combination
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Statistical decision-tree models for parsing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
SRI International FASTUS system: MUC-6 test results and analysis
MUC6 '95 Proceedings of the 6th conference on Message understanding
A variable-length category-based n-gram language model
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Improving accuracy in word class tagging through the combination of machine learning systems
Computational Linguistics
A lightweight dependency analyzer for partial parsing
Natural Language Engineering
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A SNoW based supertagger with application to NP chunking
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
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
Language independent NER using a maximum entropy tagger
CONLL '03 Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - Volume 4
Automated extraction of tags from the penn treebank
New developments in parsing technology
Automated extraction of Tree-Adjoining Grammars from treebanks
Natural Language Engineering
The importance of supertagging for wide-coverage CCG parsing
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Faster parsing by supertagger adaptation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
An unsupervised approach for linking automatically extracted and manually crafted LTAGs
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Some experiments on indicators of parsing complexity for lexicalized grammars
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
| Hi-index | 0.00 |
In previous work, supertag disambiguation has been presented as a robust partial parsing technique. In this paper we present two approaches: contextual models, which exploit a variety of features in order to improve supertag performance, and class-based models, which assign sets of supertags to words in order to substantially improve accuracy with only a slight increase in ambiguity.