A model and a fast algorithm for multiple errors spelling correction

DOI10.1007/BF01185682MaRDI QIDQ808697zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1992

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

error distance between two character stringserrors spelling correction

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Publication:4412588
• Fast string correction with Levenshtein automata
• Fast approximate search in large dictionaries
• Fast approximate matching of words against a dictionary
• Publication:5284068

Cites work

• A fast algorithm for the longest-common-subsequence problem
• A program for correcting spelling errors
• An Extension of the String-to-String Correction Problem
• Data structures and algorithms for approximate string matching
• Spelling correction in systems programs
• The String-to-String Correction Problem

Cited in

(7)

• Bit-parallel approximate string matching algorithms with transposition
• Combining trigram and automatic weight distribution in Chinese spelling error correction
• scientific article; zbMATH DE number 1904866 (Why is no real title available?)
• scientific article; zbMATH DE number 1754118 (Why is no real title available?)
• scientific article; zbMATH DE number 1949661 (Why is no real title available?)
• scientific article; zbMATH DE number 1958176 (Why is no real title available?)
• scientific article; zbMATH DE number 1843150 (Why is no real title available?)

This page was built for publication: A model and a fast algorithm for multiple errors spelling correction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808697)