| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feinishes (0) - 12 freq feenishes (1) - 7 freq feinished (1) - 5 freq finishes (1) - 8 freq feinish (2) - 13 freq vainishes (2) - 5 freq feinish't (2) - 1 freq feenished (2) - 166 freq finished (2) - 129 freq feinishin (2) - 3 freq feinisht (2) - 32 freq fetishes (2) - 1 freq finisher (2) - 1 freq feminised (3) - 1 freq finishit (3) - 1 freq finches (3) - 1 freq flinches (3) - 1 freq finish (3) - 76 freq feeneeshes (3) - 2 freq weishes (3) - 3 freq feenish (3) - 106 freq feenisht (3) - 43 freq reimishis (3) - 1 freq vanishes (3) - 1 freq hernishis (3) - 1 freq |
feinishes (0) - 12 freq finishes (1) - 8 freq feenishes (1) - 7 freq feinished (2) - 5 freq feinisht (3) - 32 freq finisher (3) - 1 freq feeneeshes (3) - 2 freq feinishin (3) - 3 freq fetishes (3) - 1 freq feinish (3) - 13 freq finished (3) - 129 freq vainishes (3) - 5 freq feenished (3) - 166 freq finishan (4) - 1 freq feshes (4) - 1 freq fishes (4) - 17 freq feenishit (4) - 2 freq finisht (4) - 14 freq feenishin (4) - 22 freq feenishd (4) - 3 freq finishin (4) - 16 freq feeneshed (4) - 2 freq finshed (4) - 1 freq vanishes (4) - 1 freq finish (4) - 76 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 |
FEINISHES |
| Time to execute Levenshtein function - 0.214836 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.382348 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.029630 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.041233 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.001324 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. |