✦ LIBER ✦

Fast string correction with Levenshtein automata

✍ Scribed by Klaus U. Schulz; Stoyan Mihov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Separating strings with small automata

✍ J.M. Robson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Approximate string matching with suffix

✍ Esko Ukkonen; Derick Wood 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 594 KB

Automata with transition self-correction

✍ M. G. Karpovskii; N. S. Shcherbakov 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 328 KB

Fast String Matching with Mismatches

✍ R.A. Baezayates; G.H. Gonnet 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 427 KB

The string-to-string correction problem

✍ Tichy, Walter F. 📂 Article 📅 1984 🏛 Association for Computing Machinery 🌐 English ⚖ 754 KB

Cosmological solution with string correc

✍ B.V. Ivanov 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 176 KB