Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing

Details Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing

1994-10-26

arxiv.org/abs/cmp-lg/9410029v1

Proceedings of the 15th International Conference on Computational Linguistics (COLING 94), Kyoto, Japan, August 1994

Computer Science

Computation and Language

ps file. 8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314502