Automatic error correction in flexion languages
From MaRDI portal
Publication:805262
DOI10.1007/BF01099203zbMath0728.68094MaRDI QIDQ805262
Publication date: 1991
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a longest common subsequence for a set of strings
- New algorithms for the LCS problem
- Associative retrieval trie hash-coding
- An algorithm for the distance between two finite sequences
- A program for correcting spelling errors
- Hierarchical file organization and its application to similar-string matching
- A comparison of three string matching algorithms
- A common basis for similarity measures involving two strings†
- An Extension of the String-to-String Correction Problem
- A linear space algorithm for computing maximal common subsequences
- Practical syntactic error recovery
- Bounds for the String Editing Problem
- A Shortest Path Algorithm for Edge-Sparse Graphs
- A fast algorithm for computing longest common subsequences
- Partial match retrieval
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- TOLERATING FUZZINESS IN KEYWORDS BY SIMILARITY SEARCHES
- A Simplified Heuristic Version of a Recursive Bayes Algorithm for Using Context in Text Recognition
- Representation of a word function as the sum of two functions
- A bottom-up and top-down approach to using context in text recognition
- Algorithms for the Longest Common Subsequence Problem
- Spelling correction in systems programs
- Space/time trade-offs in hash coding with allowable errors
