Thx for providing some insight.
-Original Message-
From: algogeeks@googlegroups.com [mailto:algogeeks@googlegroups.com] On
Behalf Of Gene
Sent: Wednesday, April 18, 2012 5:40 PM
To: Algorithm Geeks
Subject: [algogeeks] Re: String comparison
You can't solve a problem like this with only
You can't solve a problem like this with only examples of . A
complete definition is necessary. For example, what do you do with
a1 ? 2b
Report mismatch?
What do you do with
1 abc ? 2 2
Do you report or mismatch?
Here is one of infinitely many complete definitions consistent with
your
You can't solve a problem like this with only examples of . A
complete definition is necessary. For example, what do you do with
a1 ? 2b
Report mismatch?
What do you do with
1 abc ? 2 2
Do you report or mismatch?
Here is one of infinitely many complete definitions consistent with
your examples:
Thx for in detail description and some insight
On Wed, Apr 18, 2012 at 5:40 PM, Gene gene.ress...@gmail.com wrote:
You can't solve a problem like this with only examples of . A
complete definition is necessary. For example, what do you do with
a1 ? 2b
Report mismatch?
What do you do with
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
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.
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
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
tries
On Fri, Sep 25, 2009 at 11:30 PM, ankur aggarwal
ankur.mast@gmail.comwrote:
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
15 matches
Mail list logo
