A Parsing Algorithm for Unification Grammar

@article{Haas1989APA,
  title={A Parsing Algorithm for Unification Grammar},
  author={Andrew R. Haas},
  journal={Computational Linguistics},
  year={1989},
  volume={15},
  pages={219-232}
}
We describe a table-driven parser for unification grammar that combines bottom-up construction of phrases with top-down filtering. This algorithm works on a class of grammars called depth-bounded grammars, and it is guaranteed to halt for any input string. Unlike many unification parsers, our algorithm works directly on a unification grammar--it does not require that we divide the grammar into a context-free "backbone" and a set of feature agreement constraints. We give a detailed proof of… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS