The fuzzy query uses similarity based on Levenshtein edit distance.
The fuzzy
query generates matching terms that are within the
maximum edit distance specified in fuzziness
and then checks the term
dictionary to find out which of those generated terms actually exist in the
index. The final query uses up to max_expansions
matching terms.
Here is a simple example:
GET /_search { "query": { "fuzzy" : { "user" : "ki" } } }
Or with more advanced settings:
GET /_search { "query": { "fuzzy" : { "user" : { "value": "ki", "boost": 1.0, "fuzziness": 2, "prefix_length": 0, "max_expansions": 100 } } } }
|
The maximum edit distance. Defaults to |
|
The number of initial characters which will not be “fuzzified”. This
helps to reduce the number of terms which must be examined. Defaults
to |
|
The maximum number of terms that the |
|
Whether fuzzy transpositions ( |
This query can be very heavy if prefix_length
is set to 0
and if
max_expansions
is set to a high number. It could result in every term in the
index being examined!