Application of the Constrained Edit Distance Algorithm to Search Procedures
Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 97
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Searching the sequential file to detect a given substring is a common
problem appearing, among others, in text processors and database search systems. One
possible approach is OOmmen's constrained edit distance algorithm. The paper
contains a brief description of this algorithm and some results of a simulation
experiment regarding accuracy and execution speed of the algorithm depending on the
probability of the insertion, deletion and substitution errors. The paper also presents
one possible practical application of the algorithm to search procedures. Application is
based on reduction of the dictionary size according to the probability of editing errors
and organization of the contents of the dictionary in a way to so as speed up the search
process . Some comparative simulation results are presented illustrating direct and
suggested practical applications of the constrained edit distance algorithm to search
procedures.
Classification :
68T10 68U15 68P10
Keywords: Noisy subsequence, constrained edit distance algorithm, search procedures
Keywords: Noisy subsequence, constrained edit distance algorithm, search procedures
@article{YJOR_1997_7_1_a7,
author = {Vladimir Jovi\v{c}i\'c and Zora Konjovi\'c},
title = {Application of the {Constrained} {Edit} {Distance} {Algorithm} to {Search} {Procedures}},
journal = {Yugoslav journal of operations research},
pages = {97 },
year = {1997},
volume = {7},
number = {1},
zbl = {0942.68114},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a7/}
}
Vladimir Jovičić; Zora Konjović. Application of the Constrained Edit Distance Algorithm to Search Procedures. Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 97 . http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a7/