Abstract
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 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.
Cite
CITATION STYLE
APA
Nederhof, M. J. (1998). An alternative LR algorithm for TAGs. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2, pp. 946–952). Association for Computational Linguistics (ACL). https://doi.org/10.3115/980691.980725
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free