Summary: Partial Parsing
Steven Abney
University of T¨ubingen
abney@sfs.nphil.uni-tuebingen.de
A tutorial presen
1
Partial Parsing
· Standard parsers
­ Evaluate global parses, not partial
parses
­ Do all-paths search (chart or no)
· Why unrestricted text is difficult
­ Incompleteness of lexicon
­ Incompleteness of grammar
­ Incompleteness of semantics
­ Long sentences
­ Errors in input
· Partial parsing
­ Produce forest
­ Speed

Source: Abney, Steven P. - School of Information, University of Michigan

Collections: Computer Technologies and Information Sciences