tries
On Fri, Sep 25, 2009 at 11:30 PM, ankur aggarwal
wrote:
> edit distance..
>
>
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroup
edit distance..
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubsc
Thanks for your solutions guys, I will go into the details. Somewhere
else I have found Levenshtein distance algorithm which also seems to
be a good idea.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Ge
one of the possible implementation used by google is TRIES
as a word with 99% match can be displayed easily by using this data
structure
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
I think the way google deals with spell error is quite complex.
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you may store several version of the
word in the database.
Here is one possible implementation:
For "world", we first add a spec
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char
(miss, add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of
the world, and get "$world
But if you just wanna find candidates for spell errors with one char(miss,
add or misspell one char), you
may store several version of the word in the database.
Here is one possible implementation:
For "world", we first add a special char, say '$' to the beginning of the
world, and get "$world".
Hey. I wonder what method would you use to find value in the large
database assuming that if the word in the database differs from our
pattern only in one character we treat that as a match.
Lets say that someone wants to find word "independent" in the database
but he put "independext" instead. We
17 matches
Mail list logo
