• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.45-56
• /
• 2015

In this paper, we present a method that can detect context-sensitive word errors and generate correction candidates. Spelling error detection is one of the most widespread research topics, however, the approach proposed in this paper is adjusted for an automated English scoring system. A common strategy in context-sensitive word error detection is using a pre-defined confusion set to generate correction candidates. We automatically generate a confusion set in order to consider the characteristics of sentences written by second-language learners. We define a word error that cannot be detected by a conventional grammar checker because of part-of-speech ambiguity, and propose how to detect the error and generate correction candidates for this kind of error. An experiment is performed on the English writings composed by junior-high school students whose mother tongue is Korean. The f1 value of the proposed method is 70.48%, which shows that our method is promising comparing to the current-state-of-the art.

• English Language & Literature Teaching
• /
• v.13 no.1
• /
• pp.235-259
• /
• 2007

The purpose of the present study is to develop a prototype automated scoring system for English writing. The system was developed for scoring writings of Korean middle school students. In order to develop the automated scoring system, following procedures have been applied. First, review and analysis of established automated essay scoring systems in other countries have been accomplished. By doing so, we could get the guidance for development of a new sentence-level automated scoring system for Korean EFL students. Second, knowledge base such as lexicon, grammar and WordNet for natural language processing and error corpus of English writing of Korean middle school students were established. Error corpus was established through the paper and pencil test with 589 third year middle school students. This study provided suggestions for the successful introduction of an automated scoring system in Korea. The automated scoring system developed in this study should be continuously upgraded to improve the accuracy of the scoring system. Also, it is suggested to develop an automated scoring system being able to carry out evaluation of English essay, not only sentence-level evaluation. The system needs to be upgraded for the improved precision, but, it was a successful introduction of an sentence-level automated scoring system for English writing in Korea.

• Proceedings of the KSPS conference
• /
• 2003.05a
• /
• pp.219-222
• /
• 2003

In this paper, we study the usage of phoneme duration information for rejection garbage sentence. First, we build a phoneme duration modeling in a speech recognition system based on dicicion tree state tying, We assume that phone duration has a Gamma distribution. Next, we build a verification module in which word-level confidence measure is used. Finally, we make a comparative study on phoneme duration with speech DB obtained from the live system. This DB consistes of OOT(out-of-task) and ING(in-grammar) utterences. the usage of phone duration information yields that OOT recognition rate is improved by 46％ and that another 8.4％ error rate is reduced when combined with utterence verification module.

• Korean Journal of Cognitive Science
• /
• v.4 no.1
• /
• pp.177-212
• /
• 1993

My research is based on the parser for ill-formed input by Mellish in a paper in ACL 27th meeting Proceedings. 1989. My system is composed of two parsers:WFCP and IFCP. When WFCP fails to give the parse tree for the input sentence, the sentence is identified as ill-formed and is parsed by IFCP for error detection and recovery at the syntactic level. My system is indendent of grammatical rules. It does not take into account semantic ill-formedness. My system uses a grammar composed of 25 context-free rules. My system consistes of two major parsing strategies:top-down expection and bottem-up satisfaction. With top-down expectation. rules are retrieved under the inference condition and expaned by inactive arcs. When doing bottom-up parsing. my parser used two modes:Left-Right parsing and Right-to-Left parsing. My system repairs errors sucessfully when the input contains an omitted word or an unknown word substitued for a valid word. Left- corner and right-corner errors are more easily detected and repaired than ill-formed senteces where the error is in teh middle. The deviance note. with repair details, is kept in new inactive arcs which are generated by the error correction procedure. The implementation of my system is quite different from Mellish's. When rules are invoked. my system invokes all rules with minimal inference. My bottom up parsing strategy uses Left-to-Right mode and Right-to-Left mode. My system is bottom-up-parsing-oriented like the chart parser. Errors are repaired in two ways:using top-down hypothesis, and using Need-Chart which keeps the information of expectation and complection of expanded goals by rules. To reduce the number of top-down cycles. all rules are invoked simultaneously and this invocation information is kept in Need-Chart. This idea will be extended for the implementation of multiple error recovery system.