;>> name "John
>>>> Smith". If the external source has something like "Smith John",
>>>> "Smith,
>>>> John", "J. Smith", etc., I would like to rate this matching based
>>>> on some %
>>>> of
m sure
Lucene
uses under the hood. So I trying to guage if Lucene is useful for
doing
something specific as this, or are there better algorithms and/or
software
out there that does name matching. Thanks in advance!
-los
--
View this message in context: http://www.nabble.com/Lucene-for-name
e
>> Lucene
>> uses under the hood. So I trying to guage if Lucene is useful for
>> doing
>> something specific as this, or are there better algorithms and/or
>> software
>> out there that does name matching
On 4/5/07, moraleslos <[EMAIL PROTECTED]> wrote:
something specific as this, or are there better algorithms and/or software
out there that does name matching. Thanks in advance!
Approximate string matching is an active research field. There are
many systems that implement different algorithms t
earched around a bit for
>> algorithms
>> and I kept seeing the Levenshtein distance algorithm which I'm sure
>> Lucene
>> uses under the hood. So I trying to guage if Lucene is useful for
>> doing
>> something specific as this, or are there better algori
ms
and I kept seeing the Levenshtein distance algorithm which I'm sure
Lucene
uses under the hood. So I trying to guage if Lucene is useful for
doing
something specific as this, or are there better algorithms and/or
software
out there that does name matching. Thanks in advance!
-los
--
Vi
ood. So I trying to guage if Lucene is useful for doing
something specific as this, or are there better algorithms and/or software
out there that does name matching. Thanks in advance!
-los
--
View this message in context:
http://www.nabble.com/Lucene-for-name-matching-tf3533454.html#a9862342
Sent
