A model and a fast algorithm for multiple errors spelling correction

DOI10.1007/BF01185682zbMATH Open0732.68044MaRDI QIDQ808697FDOQ808697

N. E. Zubov

Publication date: 1992

Published in: Acta Informatica (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1949661
• Fast string correction with Levenshtein automata
• Fast approximate search in large dictionaries
• Fast approximate matching of words against a dictionary
• scientific article; zbMATH DE number 975393

zbMATH Keywords

error distance between two character stringserrors spelling correction

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bit-parallel approximate string matching algorithms with transposition
• Title not available (Why is that?)
• Combining trigram and automatic weight distribution in Chinese spelling error correction
• Title not available (Why is that?)
• Title not available (Why is that?)

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)