475
Comment: Stemming definition
|
852
Analyzers
|
Deletions are marked like this. | Additions are marked like this. |
Line 3: | Line 3: |
'''A''' * '''Analyzers''': Analyzers are components that preprocess input text at index time and/or at search time. It's important to use the same or similar analyzers that process text in a compatible manner at index and query time. For example, if an indexing analyzer lowercases words, then the query analyzer should do the same to enable finding the indexed words. |
|
Line 4: | Line 8: |
* '''Full text search''': | |
Line 6: | Line 12: |
* '''Full text search''': | |
Line 15: | Line 19: |
* '''Stemming''': A transforming algorithm that reduces any of the forms of a word such as "runs, running, ran" to its elemental root ("run") or that does the inverse, that is, it takes a root word and expands it to all of its various form. |
|
Line 16: | Line 22: |
* '''Stemming''': A transforming algorithm that reduces any of the forms of a word such as "runs, running, ran" to its elemental root ("run") or that does the inverse, that is, it takes a root word and expands it to all of its various form. |
This page gives a glossary of the most important terms in the search engine nomenclature.
A
Analyzers: Analyzers are components that preprocess input text at index time and/or at search time. It's important to use the same or similar analyzers that process text in a compatible manner at index and query time. For example, if an indexing analyzer lowercases words, then the query analyzer should do the same to enable finding the indexed words.
F
Full text search:
Free text:
P
Protected word:
S
Stemming: A transforming algorithm that reduces any of the forms of a word such as "runs, running, ran" to its elemental root ("run") or that does the inverse, that is, it takes a root word and expands it to all of its various form.
Stop word: