T
T
tutnet2014-09-10 11:55:27
MySQL
tutnet, 2014-09-10 11:55:27

How to implement non-trivial dictionary lookup?

There is the following introductory:
There are a number of entries.
For each entry, there is a dictionary of concepts of hundreds of lexemes, 2-5 words each. It is
necessary to match the search query with the dictionary of lexemes in such a way that the entry is found when all the words of the dictionary token are included in the search query, taking into account morphology.
Example for clarification:
Record 1
Dictionary:
1. every hunter
2. wants to know
3. where the pheasant sits
Record 1
Dictionary:
1. every pheasant
2. wants to sit
3. away from the
hunter , "pheasant", etc.) should not find anything
The query "hunter wants to know where the pheasants are sitting" should find Record1 The
query "does this pheasant want to sit" should find Record2
I would like to understand if it is possible to implement this using the Sphinx, and if so, where to dig?
Or should these things be handled differently?

Answer the question

In order to leave comments, you need to log in

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question