Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eftinoon (0) - 1 freq eftirnoon (1) - 5 freq efternoon (2) - 58 freq finoot (3) - 1 freq eftirnön (3) - 1 freq efternoons (3) - 9 freq afternoon (3) - 103 freq eftirneun (3) - 1 freq eftirnün (3) - 1 freq eftrneen (3) - 1 freq afturnoon (3) - 1 freq eftirnuin (3) - 2 freq ection (3) - 16 freq etioun (3) - 2 freq eftimin (3) - 1 freq elation (4) - 3 freq inoo (4) - 10 freq erinnin (4) - 1 freq eftirlins (4) - 3 freq section (4) - 78 freq martinocon (4) - 2 freq findin (4) - 71 freq finnen (4) - 1 freq finlan (4) - 1 freq pitdoon (4) - 1 freq |
eftinoon (0) - 1 freq eftirnoon (2) - 5 freq efternoon (3) - 58 freq eftirnuin (4) - 2 freq afturnoon (4) - 1 freq eftimin (4) - 1 freq eftrneen (4) - 1 freq eftirneun (4) - 1 freq afternoon (4) - 103 freq eftirnune (5) - 6 freq fitaloon (5) - 1 freq forenoon (5) - 6 freq fionn (5) - 1 freq oftin (5) - 1 freq aifternoon (5) - 3 freq tenon (5) - 1 freq efternin (5) - 12 freq efterneen (5) - 69 freq eftemeen (5) - 1 freq efternuin (5) - 60 freq etonian (5) - 1 freq eferneen (5) - 1 freq finin (5) - 3 freq afton (5) - 3 freq finn (5) - 47 freq |
SoundEx code - E135 evidence - 151 freq evident - 13 freq evitin - 4 freq eevidence - 1 freq evidently - 25 freq epitome - 7 freq evidents - 1 freq epidemic - 8 freq eftemeen - 1 freq eveidence - 1 freq evytance - 1 freq eftimin - 1 freq eftinoon - 1 freq epidemics - 1 freq eppptwhn - 1 freq eoftn - 1 freq evidenced - 1 freq epidemiology - 1 freq |
MetaPhone code - EFTNN eftinoon - 1 freq |
EFTINOON |
Time to execute Levenshtein function - 0.229706 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.387599 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.033884 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.037257 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.000913 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. |