A comparison of grammatical error detection techniques for an automated english scoring system
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
Detecting grammatical errors from a text is a long-history application. In this paper, we compare the performance of two grammatical error detection techniques, which are implemented as a sub-module of an automated English scoring system. One is to use a full syntactic parser, which has not only grammatical rules but also extra-grammatical rules in order to detect syntactic errors while paring. The other one is to use a finite state machine which can identify an error covering a small range of an input. In order to compare the two approaches, grammatical errors are divided into three parts; the first one is grammatical error that can be handled by both approaches, and the second one is errors that can be handled by only a full parser, and the last one is errors that can be done only in a finite state machine. By doing this, we can figure out the strength and the weakness of each approach. The evaluation results show that a full parsing approach can detect more errors than a finite state machine can, while the accuracy of the former is lower than that of the latter. We can conclude that a full parser is suitable for detecting grammatical errors with a long distance dependency,whereas a finite state machine works well on sentences with multiple grammatical errors.
Abstract
Detecting grammatical errors from a text is a long-history application. In this paper, we compare the performance of two grammatical error detection techniques, which are implemented as a sub-module of an automated English scoring system. One is to use a full syntactic parser, which has not only grammatical rules but also extra-grammatical rules in order to detect syntactic errors while paring. The other one is to use a finite state machine which can identify an error covering a small range of an input. In order to compare the two approaches, grammatical errors are divided into three parts; the first one is grammatical error that can be handled by both approaches, and the second one is errors that can be handled by only a full parser, and the last one is errors that can be done only in a finite state machine. By doing this, we can figure out the strength and the weakness of each approach. The evaluation results show that a full parsing approach can detect more errors than a finite state machine can, while the accuracy of the former is lower than that of the latter. We can conclude that a full parser is suitable for detecting grammatical errors with a long distance dependency,whereas a finite state machine works well on sentences with multiple grammatical errors.
참고문헌 (13)
- Yongmei Shi, "Error detection using linguistic features", Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, pp.41~48 (2005)
- George E. Heidorn, "Intelligent Writing Assistance, In Handbook of Natural Language Processing" (2000), CRC Press
- Lisa N. Michaud, "An intelligent tutoring system for deaf learners of written english", Proceedings of the Fourth International ACM Conference on Assistive Technologies, pp.92~100 (2000)
- Emily M. Bender, "Arboretum : Using a precision grammar for grammar checking in call", Proceedings of InSTIL, 2004, 83~86
- Wael H. Gomaa, "Short answer grading using string similarity and corpus-based similarity", International Journal of Advanced Computer Science and Application, 3(11), pp.115~121 (2012)
- Sylvana Sofkova Hashemi, "Positive grammar checking : A finite state approach", Computational Linguistics and Intelligent Text Processing Lecture Notes in Computer Science, 2588, pp.635~646 (2003)
- 이공주, "Compositional rules of Korean auxiliary predicates for sentiment analysis", 한국마린엔지니어링학회지, 37(3), pp.291~299 (2013), 한국마린엔지니어링학회[DOI]
- 이공주, "MOSES를 이용한 한", 일 양방향 통계기반 자동 번역 시스템, 2012, pp.36(5), 683~693[DOI]
- Emmanuel Roche, "Finite-State Language Processing" (1997), The MIT Press
- Kong Joo Lee, "Building an automated English sentence evaluation system for students learning English as a second language", Computer Speech & Language, 25(2), pp.246~260 (2011)
- Guihua Sun, "Detecting erroneous sentences using automatically mined sequential patterns", Processings of the 45th Annual Meeting of the Association of Computational Linguistics, pp.81~88 (2007)
- Jian Pei, "Prefixspan : Mining sequential patterns efficiently by prefix-projected pattern growth", Proceedings of Proceedings of International Conference on Data Engineering, pp.215~224 (2001)
- Michael Gamon, "Using statistical techniques and web search to correct ESL errors", Journal of The Computer Assisted Language Instruction Consortium, 26(3), pp.491~511 (2009)