Subject | Re: [firebird-support] Fuzzy match on business name |
---|---|
Author | Hannes Streicher |
Post date | 2013-05-21T05:35:13Z |
Hello All,
be precomputet and stored in the DB and the disadvantage that the FIRST Letter is
fixed
another option , which however needs on the fly calculation during the database search would be
levenstein which gives a numeric value how close two words are
--
Mit freundlichen GrĂ¼ssen
Hannes Streicher mailto:HStreicher@...
>> Here's one I hope others have encountered (and possibly found an elegantSoundex has the advantage over other algorithms that the value to be compared can
>> solution).
>> ... SNIP ...
>> constituent's last name (in uppercase). It works well for individuals,
>> but fails to catch my 'Corlis Estates' example above. Yes, I could break
>> the incoming business name string into individual words, eliminate the
>> common "The, A, An, The, Inc,..." and submit individual words in a chain
>> of "or"s. Has anybody got a better way?
>>
>> Lane C.
>> NW Software
> I would be thinking of a SOUNDEX function for this. I need one myself to
> ensure that the "fat fingered" user - me - of my Music collection can
> type in a name that's roughly spelt correctly.
> The Soundex for Jon, John, Johanne etc all boil down to J500, so I would
> go in to the soundex table looking for the J500 and from that, pull out
> the artist PK id (1) and joing on that to the Atrist table to get my
> match/matches.
be precomputet and stored in the DB and the disadvantage that the FIRST Letter is
fixed
another option , which however needs on the fly calculation during the database search would be
levenstein which gives a numeric value how close two words are
--
Mit freundlichen GrĂ¼ssen
Hannes Streicher mailto:HStreicher@...