| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finishes (0) - 8 freq finished (1) - 129 freq finisher (1) - 1 freq feinishes (1) - 12 freq feenishes (2) - 7 freq vainishes (2) - 5 freq finishin (2) - 16 freq fishes (2) - 17 freq finisht (2) - 14 freq finshed (2) - 1 freq finishan (2) - 1 freq fetishes (2) - 1 freq finches (2) - 1 freq vanishes (2) - 1 freq feinished (2) - 5 freq finish (2) - 76 freq finishit (2) - 1 freq pishes (3) - 2 freq diminishes (3) - 4 freq fishers (3) - 14 freq pinches (3) - 2 freq feinisht (3) - 32 freq pairishes (3) - 3 freq feshes (3) - 1 freq irises (3) - 1 freq |
finishes (0) - 8 freq feinishes (1) - 12 freq feenishes (2) - 7 freq finisher (2) - 1 freq finished (2) - 129 freq finches (3) - 1 freq vanishes (3) - 1 freq finishit (3) - 1 freq fetishes (3) - 1 freq feinished (3) - 5 freq finish (3) - 76 freq vainishes (3) - 5 freq finishan (3) - 1 freq fishes (3) - 17 freq finishin (3) - 16 freq finisht (3) - 14 freq finshed (3) - 1 freq feinish (4) - 13 freq snashes (4) - 2 freq feinishin (4) - 3 freq feenished (4) - 166 freq finiesh (4) - 1 freq offishes (4) - 1 freq ganshes (4) - 11 freq snushes (4) - 2 freq |
SoundEx code - F522 fences - 22 freq fancy's - 1 freq feenishes - 7 freq fence-stobs - 1 freq feinishes - 12 freq fancies - 27 freq fanciest - 2 freq funcies - 5 freq finishes - 8 freq feeneeshes - 2 freq funsize - 1 freq finces - 1 freq finches - 1 freq fence-separated - 1 freq fingaa's - 1 freq |
MetaPhone code - FNXS feenishes - 7 freq feinishes - 12 freq finishes - 8 freq feeneeshes - 2 freq finches - 1 freq vainishes - 5 freq vanishes - 1 freq |
FINISHES |
| Time to execute Levenshtein function - 0.191644 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.350264 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027955 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037328 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000922 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |