Fast approximate matching of words against a dictionary
type: Item
instance of: scholarly article
title: Fast approximate matching of words against a dictionary
zbMATH Open document ID: 0837.68038
DOI: 10.1007/BF02238238
author: Horst Bunke
published in: Computing
publication date: 1995-09-17T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 784452
zbMATH Keywords: string edit distance
zbMATH Keywords: dictionary words
zbMATH Keywords: finite state automaton
MaRDI profile type: Publication
cites work: The String-to-String Correction Problem
cites work: A fast algorithm for computing longest common subsequences
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Algorithms for approximate string matching
cites work: A faster algorithm computing string edit distances
cites work: Q4385510
cites work: Data structures and algorithms for approximate string matching
cites work: Fast parallel and serial approximate string matching
cites work: An Improved Algorithm For Approximate String Matching
cites work: Finding approximate patterns in strings
cites work: Q3862379
cites work: An Extension of the String-to-String Correction Problem
full work available at URL: https://doi.org/10.1007/bf02238238
OpenAlex ID: W1564409855
Recommended article: Fast approximate dictionary matching
Recommended article: Fast Approximate Search in Large Dictionaries
Recommended article: Succinct Dictionary Matching with No Slowdown
Recommended article: Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
Recommended article: Fast index for approximate string matching
Recommended article: Faster compressed dictionary matching
Recommended article: Fast and practical approximate string matching
Recommended article: Fast circular dictionary-matching algorithm
description: scientific article; zbMATH DE number 784452