Fast approximate matching of words against a dictionary

DOI10.1007/BF02238238zbMath0837.68038OpenAlexW1564409855MaRDI QIDQ1895867

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

finite state automatonstring edit distancedictionary words

Mathematics Subject Classification ID

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

Related Items (1)

Breadth-first search strategies for trie-based syntactic pattern recognition

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(ND)\) difference algorithm and its variations
• Data structures and algorithms for approximate string matching
• A faster algorithm computing string edit distances
• An Improved Algorithm For Approximate String Matching
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• An Extension of the String-to-String Correction Problem
• A fast algorithm for computing longest common subsequences
• Fast parallel and serial approximate string matching
• The String-to-String Correction Problem

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