A Method for the Correction of Garbled Words Based on the Levenshtein Metric
From MaRDI portal
Publication:4074401
DOI10.1109/TC.1976.5009232zbMath0314.68039OpenAlexW2071663716MaRDI QIDQ4074401
Teruo Okuda, Eiichi Tanaka, Tamotsu Kasai
Publication date: 1976
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1976.5009232
Related Items
A common basis for similarity measures involving two strings† ⋮ Edit Distance for Pushdown Automata ⋮ How hard is to compute the edit distance ⋮ Constrained string editing ⋮ Breadth-first search strategies for trie-based syntactic pattern recognition ⋮ The use of context in pattern recognition ⋮ Some limit results for longest common subsequences ⋮ Optimal matching of deformed patterns with positional influence ⋮ How hard is computing the edit distance?
