B
B
Bartez2011-04-06 15:07:09
Search engines
Bartez, 2011-04-06 15:07:09

Recommend Search Engine for MS SQL, considering semantics

Those. so that the search would be possible, taking into account the permutation of words and the changed forms of words, for example: delete, deleted, etc. With relevance support, i.e. algorithm for determining the significance of the result.
Paid solutions are available.

Answer the question

In order to leave comments, you need to log in

3 answer(s)
I
Ivan, 2011-04-06
@iSage

Hm, Sphinx ?

L
lashtal, 2011-04-06
@lashtal

I don’t understand something… MS SQL has its own, working full text , support for a bunch of languages , ranking . Why a bicycle?

B
Baileys, 2011-04-06
@Baileys

This can be implemented as follows:
1. The search query is divided into words
2. The stemming method determines the basis of each word and creates an array of words
3. After that, a query is created to the database of the following form select * from Table where name like '%word1%' and name like ' %word2%' and…
4. Relevance can be determined by the number of occurrences of each word as a result of issuing
this is more correct

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question