Full-Text Search

I would like to use the Full-Text Search in MS SQL 2000, but I'm not
sure whether I can use it in my setup.
In my application the user is able to type some text (about 400
words). In the database I have a list of words that I would like to
match to the text. Is it possible to use stemming etc in this
context? Do I need to first add the text to the database and then
search for the words one by one?
Thanks in advance!
-- -- -- -
Posted with NewsLeecher v3.9 Beta 1
Web @. http://www.newsleecher.com/?usenet
-- -- -- -- -
Hello Savage,
Essentially you want to text mine your content. We do exactly as you want
by storing the text and then using looping through the keywords to search
for and store the results. We do it in a batch though, searching through
a batch of jobs at one time. This is because its not simple to do a full
text search against 1 row in a table. You could split your text into individual
words and then look for matches. There are many routines to split text but
are largely limited to one delimiter rather than a set.
Simon Sabin
SQL Server MVP
http://sqlblogcasts.com/blogs/simons

> I would like to use the Full-Text Search in MS SQL 2000, but I'm not
> sure whether I can use it in my setup.
> In my application the user is able to type some text (about 400
> words). In the database I have a list of words that I would like to
> match to the text. Is it possible to use stemming etc in this context?
> Do I need to first add the text to the database and then search for
> the words one by one?
> Thanks in advance!
> --
> -- -- -- -
> Posted with NewsLeecher v3.9 Beta 1
> Web @. http://www.newsleecher.com/?usenet
> -- -- -- -- -
|||Thanks a lot for your answer. I will try to implement this!
-- -- -- -
Posted with NewsLeecher v3.9 Beta 1
Web @. http://www.newsleecher.com/?usenet
-- -- -- -- -
|||For stemming you would need to do a freetext search. Another option is to
build an inverted file index and only store and query on the root of the
word, keeping in mind handling exceptions, i.e. a search on mouse would also
return hits to mice.
Look at Porter Stemming algorithm implementations to understand how this
would work.
Hilary Cotter
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
"Savage" <my@.email.com> wrote in message
news:45e947d6$0$9908$e4fe514c@.dreader25.news.xs4al l.nl...
>I would like to use the Full-Text Search in MS SQL 2000, but I'm not
> sure whether I can use it in my setup.
> In my application the user is able to type some text (about 400
> words). In the database I have a list of words that I would like to
> match to the text. Is it possible to use stemming etc in this
> context? Do I need to first add the text to the database and then
> search for the words one by one?
> Thanks in advance!
>
> --
> -- -- -- -
> Posted with NewsLeecher v3.9 Beta 1
> Web @. http://www.newsleecher.com/?usenet
> -- -- -- -- -
>
|||Thanks for your help!
-- -- -- -
Posted with NewsLeecher v3.9 Beta 1
Web @. http://www.newsleecher.com/?usenet
-- -- -- -- -