javuchi wrote:
> I'm searching for a library which makes aproximative string matching,
> for example, searching in a dictionary the word "motorcycle", but
> returns similar strings like "motorcicle".
>
> Is there such a library?
>
Perhaps the get_clo
On Mon, 21 Nov 2005 19:47:45 +0100, Diez B. Roggisch wrote:
> The idea is that otherwise e.g. "cat" and "hippopothamus" have a
> l-distance of only 3, which one would consider good at the first look.
???
I make it that the L-distance between cat and hippopothamus is twelve, not
three. With len(
Steven D'Aprano wrote:
> [EMAIL PROTECTED] wrote:
>
>> This algorithm is called soundex. Here is one implementation example.
>>
>> http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52213
>>
>> here is another:
>> http://effbot.org/librarybook/soundex.htm
>
>
> Soundex is *one* particular a
"javuchi" <[EMAIL PROTECTED]> writes:
> I'm searching for a library which makes aproximative string matching,
> for example, searching in a dictionary the word "motorcycle", but
> returns similar strings like "motorcicle".
>
> Is t
Tim Roberts wrote:
> >I'm searching for a library which makes aproximative string matching,
> >for example, searching in a dictionary the word "motorcycle", but
> >returns similar strings like "motorcicle".
> >
> >Is there such a library?
javuchi wrote:
> I'm searching for a library which makes aproximative string matching,
> for example, searching in a dictionary the word "motorcycle", but
> returns similar strings like "motorcicle".
>
> Is there such a library?
>
agrep (aproximate
"javuchi" <[EMAIL PROTECTED]> wrote:
>
>I'm searching for a library which makes aproximative string matching,
>for example, searching in a dictionary the word "motorcycle", but
>returns similar strings like "motorcicle".
>
>Is there
[EMAIL PROTECTED] wrote:
> This algorithm is called soundex. Here is one implementation example.
>
> http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52213
>
> here is another:
> http://effbot.org/librarybook/soundex.htm
Soundex is *one* particular algorithm for approximate
string match
This algorithm is called soundex. Here is one implementation example.
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52213
here is another:
http://effbot.org/librarybook/soundex.htm
--
http://mail.python.org/mailman/listinfo/python-list
I'm searching for a library which makes aproximative string matching,
for example, searching in a dictionary the word "motorcycle", but
returns similar strings like "motorcicle".
Is there such a library?
--
http://mail.python.org/mailman/listinfo/python-list
10 matches
Mail list logo
