| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eytalian (0) - 1 freq italian (2) - 62 freq €˜taliani (3) - 1 freq etonian (3) - 1 freq ettlan (3) - 1 freq sectarian (3) - 5 freq italiani (3) - 1 freq italians (3) - 7 freq talikan (3) - 1 freq taliban (3) - 3 freq talikn (3) - 1 freq catalan (3) - 24 freq italiano (3) - 2 freq alian (3) - 1 freq italia (3) - 1 freq ettilin (3) - 1 freq stalin (3) - 3 freq yralban (3) - 1 freq ettlin (3) - 314 freq talkan (3) - 18 freq eurasian (3) - 2 freq albanian (4) - 1 freq bygaein (4) - 1 freq callan (4) - 3 freq strlin (4) - 1 freq |
eytalian (0) - 1 freq italian (2) - 62 freq italiano (3) - 2 freq italiani (3) - 1 freq stalin (4) - 3 freq ettilin (4) - 1 freq yatlin (4) - 1 freq talkan (4) - 18 freq ootlin (4) - 11 freq outlin (4) - 3 freq italia (4) - 1 freq tailin (4) - 1 freq outlan (4) - 2 freq ettlin (4) - 314 freq alian (4) - 1 freq ettlan (4) - 1 freq etonian (4) - 1 freq ootlan (4) - 1 freq talikan (4) - 1 freq italians (4) - 7 freq talikn (4) - 1 freq catalan (4) - 24 freq taliban (4) - 3 freq fitaloon (5) - 1 freq tain (5) - 42 freq |
SoundEx code - E345 ettlin - 314 freq ettling - 2 freq ettlins - 23 freq ettlin-like - 1 freq ettlin's - 1 freq ettlin' - 1 freq ettilin - 1 freq ettlan - 1 freq eytalian - 1 freq ethwilliams - 1 freq |
MetaPhone code - ETLN ettlin - 314 freq ettlin' - 1 freq ettilin - 1 freq ettlan - 1 freq eytalian - 1 freq |
EYTALIAN |
| Time to execute Levenshtein function - 0.193181 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.352554 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.027807 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.038613 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.000834 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. |