Taggers for parsers

✍ Scribed by Eugene Charniak; Glenn Carroll; John Adcock; Anthony Cassandra; Yoshihiko Gotoh; Jeremy Katz; Michael Littman; John McCann

• Publisher: Elsevier Science
• Year: 1996
• Tongue: English
• Weight: 913 KB
• Volume: 85
• Category: Article
• ISSN: 0004-3702
• DOI: 10.1016/0004-3702(95)00108-5

✦ Synopsis

We consider what tagging models are most appropriate as front ends for probabilistic contextfree grammar parsers. In particular, we ask if using a "multiple tagger", a tagger that returns more than one tag, improves parsing performance. Our conclusion is somewhat surprising: single-tag Markov-model taggers are quite adequate for the task. First of all, parsing accuracy, as measured by the correct assignment of parts of speech to words, does not increase significantly when parsers select the tags themselves. In addition, the work required to parse a sentence goes up with increasing tag ambiguity, though not as much as one might expect. Thus, for the moment, single taggers are the best taggers.