Paper: An Alternative LR Algorithm for TAGs

ACL ID P98-2156
Title An Alternative LR Algorithm for TAGs
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1998
  • Mark-Jan Nederhof (German Research Center for Artificial Intelligence, Saarbrucken Germany)

We present a new LR algorithm for tree- adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much sim- pler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.