| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iodine (0) - 4 freq bodine (1) - 1 freq indie (2) - 1 freq dorine (2) - 2 freq oodie (2) - 1 freq indiane (2) - 1 freq jodie (2) - 1 freq odin (2) - 43 freq domine (2) - 2 freq indite (2) - 1 freq odige (2) - 1 freq dine (2) - 26 freq coding (2) - 1 freq ovine (2) - 1 freq bodice (2) - 1 freq i'kine (2) - 1 freq opine (2) - 1 freq injine (2) - 7 freq ingine (2) - 33 freq bovine (2) - 2 freq 'odin (2) - 1 freq irvine (2) - 21 freq bodie (2) - 443 freq iolite (2) - 1 freq codeine (2) - 1 freq |
iodine (0) - 4 freq odin (2) - 43 freq dine (2) - 26 freq bodine (2) - 1 freq dooin (3) - 2 freq dini (3) - 9 freq din (3) - 75 freq diine (3) - 2 freq edin (3) - 4 freq dodie (3) - 18 freq bodin (3) - 1 freq ioniae (3) - 1 freq dune (3) - 103 freq iden (3) - 2 freq dione (3) - 1 freq dyne (3) - 2 freq diane (3) - 9 freq dene (3) - 3 freq dina (3) - 43 freq doune (3) - 3 freq doein (3) - 1 freq codeine (3) - 1 freq done (3) - 821 freq dinae (3) - 40 freq doin (3) - 75 freq |
SoundEx code - I350 iodine - 4 freq itn - 2 freq 'ithin - 2 freq item - 17 freq itan - 1 freq idiom - 9 freq ithin - 124 freq i'time - 22 freq i'toon - 8 freq i'don - 1 freq i'ythan - 1 freq idunn - 1 freq €˜ithin - 3 freq iden - 2 freq Èideann - 1 freq |
MetaPhone code - ITN iodine - 4 freq itn - 2 freq itan - 1 freq i'toon - 8 freq i'don - 1 freq idunn - 1 freq iden - 2 freq Èideann - 1 freq |
IODINE |
| Time to execute Levenshtein function - 0.236027 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.380869 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.027926 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.037564 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.000943 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. |