| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isella (0) - 1 freq iell (2) - 2 freq bella (2) - 96 freq yella (2) - 130 freq iseult (2) - 1 freq sell (2) - 168 freq sellan (2) - 1 freq srella (2) - 1 freq idsell (2) - 11 freq shella (2) - 3 freq sellar (2) - 15 freq 'sell (2) - 1 freq nigella (2) - 1 freq isla (2) - 26 freq hisell (2) - 2 freq selly (2) - 1 freq 'stella (2) - 3 freq itsell (2) - 16 freq paella (2) - 7 freq sellt (2) - 31 freq sell' (2) - 1 freq ella (2) - 26 freq sells (2) - 15 freq stella (2) - 68 freq fella (2) - 101 freq |
isella (0) - 1 freq selly (2) - 1 freq sell (2) - 168 freq stella (3) - 68 freq fella (3) - 101 freq sells (3) - 15 freq ella (3) - 26 freq sully (3) - 2 freq sellt (3) - 31 freq sell' (3) - 1 freq sill (3) - 19 freq sellie (3) - 2 freq silly (3) - 63 freq sally (3) - 145 freq sull (3) - 4 freq paella (3) - 7 freq sall (3) - 97 freq eesell (3) - 1 freq sibella (3) - 2 freq yella (3) - 130 freq idsell (3) - 11 freq sellan (3) - 1 freq iseult (3) - 1 freq bella (3) - 96 freq itsell (3) - 16 freq |
SoundEx code - I240 isle - 85 freq islay - 4 freq isella - 1 freq isla - 26 freq 'isla - 2 freq issel - 1 freq iegil - 1 freq ischial - 1 freq izal - 1 freq i'caul - 3 freq i'jile - 1 freq i'isle - 1 freq igloo - 1 freq isley - 1 freq |
MetaPhone code - ISL isle - 85 freq islay - 4 freq isella - 1 freq isla - 26 freq 'isla - 2 freq issel - 1 freq izal - 1 freq i'isle - 1 freq isley - 1 freq |
ISELLA |
| Time to execute Levenshtein function - 0.251517 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.443278 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.067100 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.039948 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.001017 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. |