Refining Tabular Parsers for TAGs

Éric Villemonte de la ClergerieNAACL 2001 · OpenReview

Abstract

This paper investigates several refinements of a generic tabular parser for Tree Adjoining Grammars. The resulting parser is simpler and more efficient in practice, even though the worst case complexity is not optimal.
BibTeX
@inproceedings{clergerie2001refining,
  author = {Éric Villemonte de la Clergerie},
  title = {{Refining Tabular Parsers for TAGs}},
  booktitle = {Conference of the North American Chapter of the Association for Computational Linguistics},
  year = {2001},
  url = {https://openreview.net/forum?id=H1ZCjf-OZr},
}

Loading related content...

Figure