| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isles (0) - 84 freq isley (1) - 1 freq sles (1) - 1 freq idles (1) - 1 freq isle (1) - 85 freq aisles (1) - 3 freq iles (1) - 3 freq fishes (2) - 17 freq wisses (2) - 4 freq jules (2) - 1 freq doles (2) - 1 freq ales (2) - 1 freq tsl's (2) - 1 freq sled (2) - 7 freq ices (2) - 2 freq pisces (2) - 3 freq wishes (2) - 39 freq tales (2) - 149 freq insees (2) - 1 freq fisses (2) - 1 freq bibles (2) - 6 freq jyles (2) - 1 freq musles (2) - 1 freq sees (2) - 192 freq kyles (2) - 3 freq |
isles (0) - 84 freq aisles (1) - 3 freq sles (1) - 1 freq sales (2) - 32 freq easles (2) - 2 freq sls (2) - 8 freq siles (2) - 1 freq soles (2) - 17 freq asls (2) - 25 freq idles (2) - 1 freq isley (2) - 1 freq isle (2) - 85 freq iles (2) - 3 freq slaes (2) - 6 freq slew (3) - 2 freq tles (3) - 1 freq wales (3) - 39 freq aizles (3) - 1 freq isie's (3) - 8 freq boles (3) - 1 freq biles (3) - 14 freq uises (3) - 36 freq miles (3) - 173 freq poles (3) - 30 freq aigles (3) - 1 freq |
SoundEx code - I242 isles - 84 freq is-'luk - 1 freq isla's - 5 freq 'isla's - 1 freq islastirling - 1 freq i'clock - 1 freq i'class - 1 freq ijalouse - 1 freq €™icksheils - 10 freq iclkudjgsg - 1 freq isleseafoods - 1 freq iclehzzeo - 1 freq islesÂ’ - 1 freq |
MetaPhone code - ISLS isles - 84 freq isla's - 5 freq 'isla's - 1 freq islesÂ’ - 1 freq |
ISLES |
| Time to execute Levenshtein function - 0.197549 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.373866 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.027650 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.037156 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.000882 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. |