Fast approximate matching of words against a dictionary

DOI10.1007/BF02238238MaRDI QIDQ1895867zbMATH OpenOpenAlexFDO

Authors Horst Bunke

Publication date 17 September 1995

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02238238

zbMATH Keywords

dictionary wordsfinite state automatonstring edit distance

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Dynamic programming (90C39)

Recommendations

• Fast approximate dictionary matching
• Fast approximate search in large dictionaries
• Succinct Dictionary Matching with No Slowdown
• Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
• Fast index for approximate string matching
• Faster compressed dictionary matching
• Fast and practical approximate string matching
• Fast circular dictionary-matching algorithm

Cites work

• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• Algorithms for approximate string matching
• An \(O(ND)\) difference algorithm and its variations
• An Extension of the String-to-String Correction Problem
• An Improved Algorithm For Approximate String Matching
• Data structures and algorithms for approximate string matching
• Fast parallel and serial approximate string matching
• Finding approximate patterns in strings
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• The String-to-String Correction Problem

Cited in

(15)

• Fast string correction with Levenshtein automata
• Dictionary matching with a few gaps
• Breadth-first search strategies for trie-based syntactic pattern recognition
• Vector representations for efficient comparison and search for similar strings
• On the Levenshtein automaton and the size of the neighbourhood of a word
• Fast approximate search in large dictionaries
• scientific article; zbMATH DE number 3845091 (Why is no real title available?)
• Succinct Dictionary Matching with No Slowdown
• Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
• scientific article; zbMATH DE number 1482232 (Why is no real title available?)
• Alphabet-Independent and Scaled Dictionary Matching
• scientific article; zbMATH DE number 975393 (Why is no real title available?)
• Deciding word neighborhood with universal neighborhood automata
• String Processing and Information Retrieval
• A model and a fast algorithm for multiple errors spelling correction

This page was built for publication: Fast approximate matching of words against a dictionary

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