| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edwin (0) - 29 freq edin (1) - 4 freq edgin (1) - 3 freq ewin (1) - 1 freq erwin (1) - 1 freq edwina (1) - 1 freq 'edwin (1) - 4 freq edwun (1) - 1 freq yawin (2) - 1 freq eoin (2) - 9 freq edina (2) - 2 freq addin (2) - 39 freq €˜win (2) - 1 freq dwiny (2) - 1 freq eenin (2) - 5 freq eddi (2) - 1 freq eein (2) - 7 freq edi (2) - 1 freq eekin (2) - 1 freq pawin (2) - 3 freq elfin (2) - 5 freq ectin (2) - 1 freq enin (2) - 4 freq en'in (2) - 5 freq jawin (2) - 2 freq |
edwin (0) - 29 freq edwina (1) - 1 freq edwun (1) - 1 freq ewin (2) - 1 freq edin (2) - 4 freq dwiny (2) - 1 freq dwine (2) - 19 freq dawin (2) - 32 freq erwin (2) - 1 freq edgin (2) - 3 freq 'edwin (2) - 4 freq edunn (3) - 2 freq awin (3) - 5 freq towin (3) - 1 freq dsin (3) - 1 freq ddin (3) - 5 freq twin (3) - 44 freq sewin (3) - 14 freq fawin (3) - 88 freq rowin (3) - 30 freq lowin (3) - 31 freq odin (3) - 43 freq ewan (3) - 17 freq dmin (3) - 1 freq lawin (3) - 2 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 - ETWN edwin - 29 freq 'edwin - 4 freq edwun - 1 freq 'edwun - 1 freq edwina - 1 freq |
EDWIN |
| Time to execute Levenshtein function - 0.187386 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.361273 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.028569 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.037295 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.000972 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. |