| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inane (0) - 2 freq nane (1) - 547 freq inate (1) - 1 freq 'nane (1) - 5 freq insane (1) - 8 freq alane (2) - 273 freq finance (2) - 14 freq lane (2) - 240 freq irate (2) - 1 freq ingine (2) - 33 freq fane (2) - 1 freq ingate (2) - 4 freq €œnane (2) - 3 freq t'ane (2) - 1 freq slane (2) - 1 freq winae (2) - 2 freq inner (2) - 46 freq linne (2) - 1 freq abane (2) - 28 freq nave (2) - 1 freq snape (2) - 1 freq innate (2) - 3 freq 'nance (2) - 1 freq nyne (2) - 4 freq ingle (2) - 29 freq |
inane (0) - 2 freq nane (1) - 547 freq nani (2) - 1 freq inny (2) - 3 freq nyne (2) - 4 freq nana (2) - 11 freq onyane (2) - 13 freq none (2) - 57 freq inna (2) - 19 freq anne (2) - 77 freq nine (2) - 234 freq insane (2) - 8 freq 'nane (2) - 5 freq inate (2) - 1 freq nne (2) - 1 freq inno (2) - 197 freq nan (2) - 14 freq inn (2) - 29 freq 'nae (3) - 94 freq irnae (3) - 23 freq naun (3) - 1 freq tane (3) - 175 freq sane (3) - 6 freq intue (3) - 1 freq 'nine (3) - 2 freq |
SoundEx code - I550 innin - 34 freq immune - 6 freq innimy - 1 freq i'meen - 6 freq i'man - 1 freq i'mannie - 6 freq inane - 2 freq inimy - 1 freq inn-man - 1 freq inemy - 8 freq inimie - 2 freq inion - 1 freq ianhm - 1 freq |
MetaPhone code - INN innin - 34 freq inane - 2 freq inion - 1 freq |
INANE |
| Time to execute Levenshtein function - 0.213331 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.363312 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.029537 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.039338 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.000958 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. |