We propose a new dependency parsing scheme which jointly parses a sentence and repairs grammatical errors by extending the non-directional transition-based formalism of Goldberg and Elhadad (2010) with three additional actions: SUBSTITUTE, DELETE, INSERT. Because these actions may cause an infinite loop in derivation, we also introduce simple constraints that ensure the parser termination. We evaluate our model with respect to dependency accuracy and grammaticality improvements for ungrammatical sentences, demonstrating the robustness and applicability of our scheme.
CITATION STYLE
Sakaguchi, K., Post, M., & Van Durme, B. (2017). Error-repair dependency parsing for ungrammatical texts. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers) (Vol. 2, pp. 189–195). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/P17-2030
Mendeley helps you to discover research relevant for your work.