Fast LR parsing Using Rich (Tree Adjoining) Grammars

Abstract

We describe an LR parser of parts-ofspeech (and punctuation labels) for Tree Adjoining Grammars (TAGs), that solves table conflicts in a greedy way, with limited amount of backtracking. We evaluate the parser using the Penn Treebank showing that the method yield very fast parsers with at least reasonable accuracy, confirming the intuition that LR parsing… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics