| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fancies (0) - 27 freq facies (1) - 1 freq funcies (1) - 5 freq fancied (1) - 31 freq fancier (1) - 3 freq fanciest (1) - 2 freq fancie (1) - 17 freq nancies (1) - 1 freq fannies (1) - 12 freq pansies (2) - 4 freq fasces (2) - 1 freq funcier (2) - 1 freq dances (2) - 43 freq fairies (2) - 39 freq fatties (2) - 1 freq facie (2) - 5 freq fancy's (2) - 1 freq finches (2) - 1 freq hankies (2) - 3 freq fancifu (2) - 1 freq yankies (2) - 1 freq gansies (2) - 3 freq fancit (2) - 1 freq faces (2) - 230 freq finces (2) - 1 freq |
fancies (0) - 27 freq funcies (1) - 5 freq nancies (2) - 1 freq fences (2) - 22 freq finces (2) - 1 freq fancie (2) - 17 freq fannies (2) - 12 freq fanciest (2) - 2 freq fancied (2) - 31 freq facies (2) - 1 freq fancier (2) - 3 freq funcie (3) - 1 freq fancit (3) - 1 freq faces (3) - 230 freq lances (3) - 1 freq fancifu (3) - 1 freq farces (3) - 1 freq funcied (3) - 7 freq frances (3) - 11 freq dances (3) - 43 freq funcier (3) - 1 freq fasces (3) - 1 freq fundies (3) - 13 freq facees (3) - 1 freq dancis (3) - 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 - FNSS fences - 22 freq fancy's - 1 freq fancies - 27 freq funcies - 5 freq funsize - 1 freq vinci's - 2 freq finces - 1 freq |
FANCIES |
| Time to execute Levenshtein function - 0.577064 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.832683 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.077770 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.086409 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.000867 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. |