Error-repair Dependency Parsing for Ungrammatical Texts

Keisuke Sakaguchi, Matt Post, Benjamin Van Durme


Abstract
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.
Anthology ID:
P17-2030
Volume:
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
Month:
July
Year:
2017
Address:
Vancouver, Canada
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
189–195
Language:
URL:
https://aclanthology.org/P17-2030
DOI:
10.18653/v1/P17-2030
Bibkey:
Copy Citation:
PDF:
https://aclanthology.org/P17-2030.pdf
Video:
 https://vimeo.com/234959088
Code
 keisks/error-repair-parsing
Data
Penn Treebank