An Alternative LR Algorithm for TAGs

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

• Type: Conference
• Year: 1998
• Where: ACL
• Authors: Mark-Jan Nederhof
• Keywords: ACL 1998, ACL 2007, Context-free Grammars, LR Parsing