| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erf (0) - 2 freq eff (1) - 13 freq elf (1) - 10 freq ere (1) - 288 freq egf (1) - 1 freq erk (1) - 5 freq ery (1) - 15 freq drf (1) - 1 freq derf (1) - 2 freq erd (1) - 11 freq erm (1) - 70 freq ert (1) - 18 freq orf (1) - 20 freq err (1) - 40 freq eif (1) - 46 freq etf (1) - 1 freq erz (1) - 3 freq hrf (1) - 1 freq ers (1) - 25 freq eri (1) - 1 freq era (1) - 30 freq er (1) - 630 freq ern (1) - 14 freq ef (1) - 14 freq eerf (1) - 1 freq |
erf (0) - 2 freq eerf (1) - 1 freq orf (1) - 20 freq arfu (2) - 1 freq ef (2) - 14 freq ern (2) - 14 freq eri (2) - 1 freq er (2) - 630 freq eff (2) - 13 freq reuf (2) - 2 freq rof (2) - 3 freq rfo (2) - 1 freq reef (2) - 59 freq raf (2) - 7 freq ref (2) - 36 freq reaf (2) - 1 freq reif (2) - 2 freq ers (2) - 25 freq era (2) - 30 freq hrf (2) - 1 freq ere (2) - 288 freq egf (2) - 1 freq erk (2) - 5 freq derf (2) - 2 freq erd (2) - 11 freq |
SoundEx code - E610 europe - 170 freq europe' - 3 freq europa - 7 freq euraip - 27 freq ervo - 2 freq 'europe - 1 freq eerf - 1 freq europ - 2 freq euripe - 1 freq erf - 2 freq erpoo - 1 freq |
MetaPhone code - ERF ervo - 2 freq eerf - 1 freq erf - 2 freq |
ERF |
| Time to execute Levenshtein function - 0.255441 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.588749 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.081977 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.090242 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.001028 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. |