Hi,
Is it possible to incorporate levenshtein edit distance and double-metaphone
matching into Sql Server 2005's Full-Text Search queries using FREETEXTTABLE
or CONTAINSTABLE?
I'm working on a web-site that allows user to search multiple tables, and i
want the ability to pull back rows where the spelling is slightly out, or
contains words that sound like those provided in the query, a bit like
Google.
Also, I'd like to rank the results so that exact matches are returned at the
top of the result-set, and nearest-match or phonetic matches lower down the
list.
I've come across UDF's that provide these features but they don't appear to
be compatible with the FTS engine. I've also heard of alternative to the FTS
engine that integrate with Sql Server but I can't remember what they're
called.
Any suggestions?
Ben
Hilary Cotter - 24 Apr 2007 11:47 GMT
You can use the thesaurus option for some of this functionality, but you
have to know in advance the spelling differences and add them to the
substitute node of your thesaurus file.
I think the two alternatives you were thinking about were sql turbo and
lucene.
> Hi,
>
[quoted text clipped - 19 lines]
>
> Ben
Ben Fidge - 24 Apr 2007 12:15 GMT
Hi Hillary
Will look into your suggestion, thank you.
Sql Turbo was indeed the one I was thinking about. Does Lucene integrate
into Sql Server, or is it just a stand-alone FT engine?
Thanks
Ben
> You can use the thesaurus option for some of this functionality, but you
> have to know in advance the spelling differences and add them to the
[quoted text clipped - 26 lines]
>>
>> Ben
Hilary Cotter - 24 Apr 2007 12:48 GMT
Its a standalone, however you can purchase one which is integrated into
SQL - dbsight - http://www.dbsight.net/
> Hi Hillary
>
[quoted text clipped - 37 lines]
>>>
>>> Ben