Generalized L.R. Parsing
Supertagging: an approach to almost parsing
Computational Linguistics
Ambiguity resolution in a reductionistic parser
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the 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
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Parsing preferences with lexicalized Tree Adjoining Grammars: exploiting the derivation tree
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A language--independent shallow--parser compiler
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generating parallel multilingual LFG-TAG grammars from a MetaGrammar
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A classification of grammar development strategies
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Pruning the search space of a hand-crafted parsing system with a probabilistic parser
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
From metagrammars to factorized TAG/TIG parsers
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The metagrammar goes multilingual: a cross-linguistic look at the V2-phenomenon
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
| Hi-index | 0.00 |
Srinivas (97) enriches traditional morpho-syntactic POS tagging with syntactic information by introducing Supertags. Unfortunately, words are assigned on average a much higher number of Supertags than traditional POS. In this paper, we develop the notion of Hypertag, first introduced in Kinyon (00a) and in Kinyon (00b), which allows to factor the information contained in several Supertags into a single structure and to encode functional information in a systematic manner. We show why other possible solutions based on mathematical properties of trees are unsatisfactory and also discuss the practical usefulness of this approach.