| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ibiza (0) - 5 freq bita (2) - 1 freq itida (2) - 1 freq bza (2) - 1 freq bizz (2) - 22 freq bizm (2) - 1 freq giza (2) - 1 freq bia (2) - 5 freq ilia (2) - 1 freq ibis (2) - 1 freq biz (2) - 8 freq iika (2) - 1 freq ibgz (2) - 1 freq bizy (2) - 1 freq ibid (2) - 2 freq abiz (2) - 1 freq iuta (3) - 1 freq bizzo (3) - 4 freq lila (3) - 1 freq boba (3) - 2 freq bba (3) - 1 freq bi (3) - 3248 freq honza (3) - 1 freq ibsen (3) - 2 freq i'wa (3) - 1 freq |
ibiza (0) - 5 freq abiz (2) - 1 freq biz (2) - 8 freq bza (2) - 1 freq bizy (2) - 1 freq ibid (3) - 2 freq bz (3) - 2 freq bozo (3) - 1 freq boiz (3) - 6 freq boz (3) - 2 freq baize (3) - 2 freq bozy (3) - 2 freq ibgz (3) - 1 freq abz (3) - 17 freq bizz (3) - 22 freq obz (3) - 1 freq bita (3) - 1 freq giza (3) - 1 freq bizm (3) - 1 freq bez (3) - 1 freq ibis (3) - 1 freq bia (3) - 5 freq tiz (4) - 3 freq abidy (4) - 36 freq liz (4) - 67 freq |
SoundEx code - I120 ibiza - 5 freq 'ipso - 1 freq ipso - 2 freq i'books - 1 freq i'fowk - 2 freq i'back - 2 freq i'beach - 1 freq i'bookie - 1 freq i'bus - 2 freq i'bogie - 1 freq i'backie - 2 freq i'waves - 1 freq ifs - 1 freq iphis - 2 freq ibs - 3 freq iufc - 1 freq ipzcia - 1 freq ips - 2 freq ibis - 1 freq ibgz - 1 freq |
MetaPhone code - IBS ibiza - 5 freq i'bus - 2 freq ibs - 3 freq ibis - 1 freq |
IBIZA |
| Time to execute Levenshtein function - 0.206548 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.349266 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.027257 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.038342 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.000819 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. |