Re: Indexed algorithms for approximate structure matching



Note that i didn't mean approximate algorithms for exact string
matching (e.g. Bloom filter which determines if a query string exists
in a set), but algorithms that find in a set the most similar string to
a query string (similarity is defined as edit distance or a
user-defined function). And it must run faster than online algorithms
who compare the query string against each element in the set once at a
time.

.