# Live Demo
Step 1: Insert your items
Step 2: Set the options
0indicates a perfect match, while a score of
1indicates a complete mismatch.
true, each record in the result set will include the indices of the matched characters:
indices: [start, end]. These can consequently be used for highlighting purposes.
true, the algorithm will search individual words and the full string, computing the final score as a function of both. In this case, the
locationare inconsequential for individual tokens, and are thus ignored.
true, the result set will only include records that match all tokens. Will only work if
true, the matching function will continue to the end of a search pattern even if a perfect match has already been located in the string.
List of properties that will be searched. This supports nested properties, weighted search, searching in arrays
0.0requires a perfect match (of both letters and location), a threshold of
1.0would match anything.
location). An exact letter match which is
distancecharacters away from the fuzzy location would score as a complete mismatch. A
0requires the match be at the exact
1000would require a perfect match to be within
800characters of the
locationto be found using a
maxPatternLength, an error will be thrown. Why is this important? Read this.