| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isles (0) - 83 freq aisles (1) - 3 freq isle (1) - 81 freq isley (1) - 1 freq iles (1) - 3 freq idles (1) - 1 freq sles (1) - 1 freq biles (2) - 14 freq gales (2) - 12 freq roles (2) - 12 freq iley (2) - 4 freq inlet (2) - 1 freq ile' (2) - 1 freq slep (2) - 10 freq uses (2) - 47 freq wises (2) - 1 freq isa's (2) - 8 freq rises (2) - 41 freq saes (2) - 10 freq aises (2) - 1 freq titles (2) - 13 freq uisses (2) - 2 freq wishes (2) - 36 freq jsmes (2) - 1 freq hales (2) - 1 freq |
isles (0) - 83 freq sles (1) - 1 freq aisles (1) - 3 freq sales (2) - 31 freq easles (2) - 2 freq slaes (2) - 6 freq siles (2) - 1 freq sls (2) - 8 freq soles (2) - 16 freq asls (2) - 25 freq isle (2) - 81 freq isley (2) - 1 freq iles (2) - 3 freq idles (2) - 1 freq pales (3) - 2 freq giles (3) - 9 freq files (3) - 108 freq onles (3) - 2 freq kles (3) - 2 freq shes (3) - 9 freq usless (3) - 1 freq wyles (3) - 2 freq jyles (3) - 1 freq ils (3) - 1 freq boles (3) - 1 freq |
SoundEx code - I242 isles - 83 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 - 83 freq isla's - 5 freq 'isla's - 1 freq islesÂ’ - 1 freq |
ISLES |
| Time to execute Levenshtein function - 0.191317 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.331905 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.032325 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.037281 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.000885 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. |