Spelling correction in systems programs
Communications of the ACM
CORC—the Cornell computing language
Communications of the ACM
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Error detection and recovery for syntax directed compiler systems
Error detection and recovery for syntax directed compiler systems
Automatic correction of syntax errors in programming languages
Automatic correction of syntax errors in programming languages
Syntax-directed error recovery for compilers
Syntax-directed error recovery for compilers
Optimal Correspondence of String Subsequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Creating abstract superclasses by refactoring
CSC '93 Proceedings of the 1993 ACM conference on Computer science
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Technical correspondence: on price/performance in U.S. computer systems
Communications of the ACM
Technical correspondence: measuring the level of computerization in a country
Communications of the ACM
Technical corrections: Onspelling correction and beyond
Communications of the ACM
Computing the edit distance of a regular language
Information and Computation
Recognition of Spoken Words and Phrases in Multitalker Environment Using Syntactic Methods
IEEE Transactions on Computers
Error Detection and Correction Based on Chinese Phonemic Alphabet in Chinese Text
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Decomposability of translation metrics for improved evaluation and efficient algorithms
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
The cost of traveling between languages
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Computing the edit-distance between a regular language and a context-free language
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Bounded repairability of word languages
Journal of Computer and System Sciences
| Hi-index | 48.27 |
A method is presented for calculating a string B, belonging to a given regular language L, which is “nearest” (in number of edit operations) to a given input string &agr;. B is viewed as a reasonable “correction” for the possibly erroneous string &agr;, where &agr; was originally intended to be a string of L. The calculation of B by the method presented requires time proportional to |&agr;|, the number of characters in &agr;. The method should find applications in information retrieval, artificial intelligence, and spelling correction systems.