Abstract
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. This paper further proposes a restricted version of the adjoining operation, which preserves lexical dependencies of partial parse trees. Our experimental results showed that the restriction enhances the accuracy of the incremental parsing. © 2009 ACL and AFNLP.
Cite
CITATION STYLE
Kato, Y., & Matsubara, S. (2009). Incremental parsing with monotonic adjoining operation. In ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf. (pp. 41–44). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1667583.1667598
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
