An extension of Ukkonen's enhanced dynamic programming ASM algorithm

Authors:
Hal Berghel;David Roach
Affiliations:
Univ. of Arkansas, Fayetteville;Acxiom Corp., Conway, AR
Venue:
ACM Transactions on Information Systems (TOIS)
Year:
1996

Citing 8
Cited 4

A logical framework for the correction of spelling errors in electronic documents

Information Processing and Management: an International Journal
Data structures and algorithms for approximate string matching

Journal of Complexity
An O(NP) sequence comparison algorithm

Information Processing Letters
Fast text searching: allowing errors

Communications of the ACM
The String-to-String Correction Problem

Journal of the ACM (JACM)
A technique for computer detection and correction of spelling errors

Communications of the ACM
An inductive approach to language translation

Communications of the ACM
On Approximate String Matching

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

Dynamic programming: a method for taking advantage of technical terminology in Japanese documents

IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
Lemmatizer for Document Information Retrieval Systems in JAVA

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Dynamic programming matching for large scale information retrieval

AsianIR '03 Proceedings of the sixth international workshop on Information retrieval with Asian languages - Volume 11

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an improvement on Ukkonen's Enhanced Dynamic Programming (EHD) approximate string-matching algorithm for unit-penalty four-edit comparisons. The new algorithm has an asymptotic complexity similar to that of Ukkonen's but is significantly faster due to a decrease in the number of array cell calculations. A 42% speedup was achieved in an application involving name comparisons. Even greater improvements are possible when comparing longer and more dissimilar strings. Although the speed of the algorithm under consideration is comparable to other fast ASM algorithms, it has greater effectiveness in text-processing applications because it supports all four basic Damerau-type editing operations.