| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jubilee (0) - 4 freq puilee (2) - 1 freq jubiter (2) - 29 freq habile (3) - 6 freq junipere (3) - 15 freq mobile (3) - 57 freq jungle (3) - 38 freq juliet (3) - 7 freq jummled (3) - 1 freq biler (3) - 8 freq jungles (3) - 1 freq bileev (3) - 5 freq galilee (3) - 58 freq musielee (3) - 1 freq bubbled (3) - 10 freq jumbles (3) - 1 freq biles (3) - 14 freq mobiles (3) - 5 freq quile (3) - 1 freq bubblen (3) - 1 freq bileq (3) - 1 freq quhiles (3) - 3 freq bubbles (3) - 23 freq jubes (3) - 3 freq filee (3) - 1 freq |
jubilee (0) - 4 freq julie (4) - 29 freq jobie (4) - 1 freq blee (4) - 2 freq jubes (4) - 3 freq jile (4) - 42 freq 'bile (4) - 2 freq bile (4) - 56 freq jabblie (4) - 1 freq anbile (4) - 1 freq habile (4) - 6 freq jubiter (4) - 29 freq puilee (4) - 1 freq mobile (4) - 57 freq buile (4) - 1 freq jibble (4) - 4 freq jabble (4) - 2 freq belie (5) - 2 freq july (5) - 71 freq jellie (5) - 2 freq doubil (5) - 3 freq fable (5) - 8 freq bylie (5) - 1 freq ebble (5) - 1 freq jookle (5) - 2 freq |
SoundEx code - J140 jabblie - 1 freq jibble - 4 freq joyfully - 1 freq jubilee - 4 freq jabble - 2 freq joyful - 2 freq javell - 1 freq jpl - 2 freq €˜joyfull - 1 freq jovial - 1 freq jpla - 1 freq |
MetaPhone code - JBL jabblie - 1 freq jibble - 4 freq jubilee - 4 freq jabble - 2 freq gibble - 1 freq |
JUBILEE |
| Time to execute Levenshtein function - 0.491414 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.729916 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.038817 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.081268 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.000837 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. |