Improved Fast Similarity Search in Dictionaries

Details Improved Fast Similarity Search in Dictionaries Improved Fast Similarity Search in Dictionaries

2010-08-06

arxiv.org/abs/1008.1191v2

Computer Science

Information Retrieval

Full version of a short paper accepted for Spire 2010, 13 pages

Scientific paper

We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from $\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit operations. We present data structures that support fault tolerant queries by generating an index. On top of that, we present a generalization of the method that eases memory consumption and preprocessing time significantly. At the same time, running times of queries are virtually unaffected. We are able to match in lists of hundreds of thousands of words and beyond within microseconds for reasonable distances.

Affiliated with

Also associated with

No associations

Rating

Improved Fast Similarity Search in Dictionaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Fast Similarity Search in Dictionaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Fast Similarity Search in Dictionaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231008