| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alfie (1) - 28 freq allyie (2) - 1 freq alfdi (2) - 1 freq aleive (2) - 1 freq alikie (2) - 1 freq affie (2) - 6 freq alkie (2) - 3 freq alice (2) - 1584 freq alaine (2) - 1 freq calflie (2) - 1 freq alie (2) - 1 freq awffie (2) - 1 freq awfie (2) - 392 freq alpine (2) - 2 freq alive (2) - 160 freq alfiie's (2) - 1 freq allie (2) - 9 freq alike (2) - 26 freq calfie (2) - 8 freq slipe (3) - 1 freq aerlie (3) - 10 freq elaine (3) - 12 freq alain (3) - 8 freq awie (3) - 1 freq alice' (3) - 1 freq |
alfie (1) - 28 freq lifie (3) - 5 freq awfie (3) - 392 freq allyie (3) - 1 freq alive (3) - 160 freq life (3) - 1976 freq calfie (3) - 8 freq alike (3) - 26 freq allie (3) - 9 freq alie (3) - 1 freq alf (3) - 7 freq alikie (3) - 1 freq aleive (3) - 1 freq alfdi (3) - 1 freq affie (3) - 6 freq alkie (3) - 3 freq alaine (3) - 1 freq alice (3) - 1584 freq lacie (4) - 4 freq allye (4) - 1 freq ailie (4) - 1 freq alyve (4) - 1 freq lefe (4) - 1 freq lyrie (4) - 1 freq alsae (4) - 9 freq |
SoundEx code - A410 alive - 160 freq alba - 75 freq aleive - 1 freq aleeve - 1 freq aloof - 2 freq alfie - 28 freq alive' - 1 freq alibi - 2 freq alf - 7 freq aleppo - 1 freq alph - 1 freq alpha - 5 freq a'luv - 1 freq alewife - 1 freq alva - 2 freq alba' - 1 freq alp - 1 freq €™alba - 1 freq alab - 1 freq ayelf - 1 freq aalf - 1 freq alyve - 1 freq allyboy - 1 freq |
MetaPhone code - ALF alive - 160 freq aleive - 1 freq aleeve - 1 freq aloof - 2 freq alfie - 28 freq alive' - 1 freq alf - 7 freq alph - 1 freq alpha - 5 freq a'luv - 1 freq alva - 2 freq aalf - 1 freq alyve - 1 freq |
ALFIIE |
| Time to execute Levenshtein function - 0.210451 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.389182 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.031099 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.039151 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.000846 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. |