I am using the Freetext predicate to search a column to search for phrases
and variations on phrases.
So say I just use a single phrase to search on e.g. 'enquiry' it will return
variations such as 'enquire', 'enquiry', 'enquires' etc. This works fine.
What I would like, is when I display the results to highlight the variation
a little like Google groups.
If you can imagine I have enquiry it a returned block of text it will be
highlighted. This would be pretty straight forward if the only returned word
was enquiry as I could find that. But what about the variations. Is there
any way of finding what variations have been searched for?
No, you need to implement your own version of Porter stemming algorithm and
then mark up your results for hits.
Hilary Cotter
Director of Text Mining and Database Strategy
RelevantNOISE.Com - Dedicated to mining blogs for business intelligence.
This posting is my own and doesn't necessarily represent RelevantNoise's
positions, strategies or opinions.
Looking for a SQL Server replication book?
http://www.nwsu.com/0974973602.html
Looking for a FAQ on Indexing Services/SQL FTS
http://www.indexserverfaq.com
"Chris" <123@.123.com> wrote in message
news:eW4zscLPGHA.3924@.TK2MSFTNGP14.phx.gbl...
>I am using the Freetext predicate to search a column to search for phrases
>and variations on phrases.
> So say I just use a single phrase to search on e.g. 'enquiry' it will
> return variations such as 'enquire', 'enquiry', 'enquires' etc. This works
> fine. What I would like, is when I display the results to highlight the
> variation a little like Google groups.
> If you can imagine I have enquiry it a returned block of text it will be
> highlighted. This would be pretty straight forward if the only returned
> word was enquiry as I could find that. But what about the variations. Is
> there any way of finding what variations have been searched for?
>
|||Are there any tutorials or guides. I have no idea how to do this.
"Hilary Cotter" <hilary.cotter@.gmail.com> wrote in message
news:%23mQ7UJNPGHA.1192@.TK2MSFTNGP11.phx.gbl...
> No, you need to implement your own version of Porter stemming algorithm
> and then mark up your results for hits.
> --
> Hilary Cotter
> Director of Text Mining and Database Strategy
> RelevantNOISE.Com - Dedicated to mining blogs for business intelligence.
> This posting is my own and doesn't necessarily represent RelevantNoise's
> positions, strategies or opinions.
> Looking for a SQL Server replication book?
> http://www.nwsu.com/0974973602.html
> Looking for a FAQ on Indexing Services/SQL FTS
> http://www.indexserverfaq.com
>
> "Chris" <123@.123.com> wrote in message
> news:eW4zscLPGHA.3924@.TK2MSFTNGP14.phx.gbl...
>
|||You might want to look at some of the Lucene ports to the .Net platform to
see how they do this.
Hilary Cotter
Director of Text Mining and Database Strategy
RelevantNOISE.Com - Dedicated to mining blogs for business intelligence.
This posting is my own and doesn't necessarily represent RelevantNoise's
positions, strategies or opinions.
Looking for a SQL Server replication book?
http://www.nwsu.com/0974973602.html
Looking for a FAQ on Indexing Services/SQL FTS
http://www.indexserverfaq.com
"Chris" <123@.123.com> wrote in message
news:uV9BkMQPGHA.812@.TK2MSFTNGP10.phx.gbl...
> Are there any tutorials or guides. I have no idea how to do this.
> "Hilary Cotter" <hilary.cotter@.gmail.com> wrote in message
> news:%23mQ7UJNPGHA.1192@.TK2MSFTNGP11.phx.gbl...
>
No comments:
Post a Comment