| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etioun (0) - 2 freq ection (2) - 16 freq optioun (2) - 1 freq ecroun (2) - 1 freq tion (2) - 1 freq etin (2) - 10 freq actioun (2) - 15 freq sectioun (2) - 7 freq editioun (2) - 2 freq ioun (2) - 1 freq mentioun (2) - 1 freq toun (2) - 379 freq stoun (2) - 2 freq natioun (2) - 5 freq atoun (2) - 1 freq expoun (2) - 1 freq eton (2) - 7 freq evitin (3) - 4 freq section (3) - 78 freq ettlan (3) - 1 freq stoup (3) - 6 freq action (3) - 138 freq versioun (3) - 1 freq region (3) - 28 freq egrun (3) - 1 freq |
etioun (0) - 2 freq toun (2) - 379 freq atoun (2) - 1 freq etin (2) - 10 freq eton (2) - 7 freq tion (2) - 1 freq tooin (3) - 1 freq taun (3) - 1 freq aetin (3) - 27 freq eaton (3) - 1 freq tin (3) - 184 freq eitan (3) - 1 freq tiein (3) - 1 freq tyoon (3) - 4 freq ection (3) - 16 freq toon (3) - 698 freq toune (3) - 2 freq toin (3) - 1 freq ioun (3) - 1 freq eatin (3) - 154 freq editioun (3) - 2 freq atin (3) - 3 freq actioun (3) - 15 freq ton (3) - 17 freq tien (3) - 3 freq |
SoundEx code - E350 eatin - 154 freq 'eaten - 1 freq eaten - 31 freq edwin - 29 freq 'edwin - 4 freq etten - 35 freq euidnae - 3 freq eden - 36 freq edam - 45 freq edam' - 1 freq 'edam - 3 freq eatin' - 2 freq eidein - 1 freq etna - 2 freq eton - 7 freq ettin - 13 freq edwun - 1 freq 'edwun - 1 freq edwina - 1 freq eetin - 3 freq eediom - 15 freq etin - 10 freq eitan - 1 freq eithne - 1 freq eidiom - 2 freq etioun - 2 freq eiehteen - 1 freq eaton - 1 freq eatan - 1 freq ehodni - 1 freq edm - 1 freq ethno - 1 freq edmo - 1 freq ethan - 1 freq edin - 4 freq edina - 2 freq edunn - 2 freq |
MetaPhone code - EXN echo-in - 3 freq echoin - 14 freq eushion - 1 freq etchin - 1 freq echoan - 2 freq etioun - 2 freq |
ETIOUN |
| Time to execute Levenshtein function - 0.255924 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.421438 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.032206 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.040675 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.001091 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. |