Paper: Disambiguation Of Super Parts Of Speech (Or Supertags): Almost Parsing

ACL ID C94-1024
Title Disambiguation Of Super Parts Of Speech (Or Supertags): Almost Parsing
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
Authors

In a lexicalized grammar Ibrnlal- isni such as LexicMized Tree-Adjoining (h'~unmar (I3'AG), each lexicM item is associated with at least one elementary structure (supertag) that localizes syntactic a.nd 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 I'or dlsambiguating supertags using local inlorlnlttion s~Lch as lexicM preference and local lexicN dependencies. Tim similarity between LTAG and l)ependency grammars is ex- ploited in the dependency niodel of snpertag dis- a.mbiguation. The performance results for vari- otis models of supert;tg disambigu~ttk)n such as unigram; trigram and dependency-based models are presented.