0 indicates a perfect match, while a score of 1 indicates 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.
2)
true, the algorithm will search individual words and the full string, computing the final score as a function of both. In this case, the threshold, distance, and location are inconsequential for individual tokens, and are thus ignored.
true, the result set will only include records that match all tokens. Will only work if tokenize is also true.
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.
0.0 requires a perfect match (of both letters and location), a threshold of 1.0 would match anything.
location). An exact letter match which is distance characters away from the fuzzy location would score as a complete mismatch. A distance of 0 requires the match be at the exact location specified, a distance of 1000 would require a perfect match to be within 800 characters of the location to be found using a threshold of 0.8.
maxPatternLength, an error will be thrown. Why is this important? Read this.