Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
A model and a fast algorithm for multiple errors spelling correction
Acta Informatica
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Automatic spelling correction in scientific and scholarly text
Communications of the ACM
Computer programs for detecting and correcting spelling errors
Communications of the ACM
A fast algorithm for computing longest common subsequences
Communications of the ACM
A study of errors, error-proneness, and error diagnosis in Cobol
Communications of the ACM
Spelling correction in systems programs
Communications of the ACM
A technique for computer detection and correction of spelling errors
Communications of the ACM
Retrieval of misspelled names in an airlines passenger record system
Communications of the ACM
Computer Programs for Spelling Correction
Computer Programs for Spelling Correction
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
IEEE Transactions on Knowledge and Data Engineering
Indexing and retrieval of a Greek corpus
Proceedings of the 2nd ACM workshop on Improving non english web searching
Enhancing trie-based syntactic pattern recognition using AI heuristic search strategies
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Efficient fuzzy search in large text collections
ACM Transactions on Information Systems (TOIS)
Framework for surveillance of instant messages
International Journal of Internet Technology and Secured Transactions
| Hi-index | 0.00 |
An approach to designing very fast algorithms for approximate string matching in a dictionary is proposed. Multiple spelling errors corresponding to insert, delete, change, and transpose operations on character strings are considered in the fault model. The design of very fast approximate string matching algorithms through a four-step reduction procedure is described. The final and most effective step uses hashing techniques to avoid comparing the given word with words at large distances. The technique has been applied to a library book catalog textbase. The experiments show that performing approximate string matching for a large dictionary in real-time on an ordinary sequential computer under our multiple fault model is feasible.