| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eerf (0) - 1 freq eert (1) - 1 freq eer (1) - 192 freq erf (1) - 2 freq eery (1) - 2 freq eers (1) - 9 freq derf (1) - 2 freq ee'n (2) - 1 freq jeff (2) - 32 freq reif (2) - 2 freq werk (2) - 8 freq yerl (2) - 1 freq ger (2) - 2 freq eir (2) - 18 freq edra (2) - 5 freq ferm (2) - 340 freq eece (2) - 8 freq eek (2) - 1 freq leern (2) - 1 freq etr (2) - 1 freq peer (2) - 196 freq pero (2) - 1 freq eela (2) - 3 freq nerp (2) - 1 freq terk (2) - 1 freq |
eerf (0) - 1 freq erf (1) - 2 freq orf (2) - 20 freq ref (2) - 36 freq reuf (2) - 2 freq reif (2) - 2 freq reef (2) - 58 freq eer (2) - 192 freq eert (2) - 1 freq derf (2) - 2 freq eers (2) - 9 freq eery (2) - 2 freq erm (3) - 66 freq ears (3) - 111 freq hef (3) - 1 freq eif (3) - 46 freq reefu (3) - 1 freq roof (3) - 104 freq aere (3) - 1 freq sef (3) - 1 freq seef (3) - 5 freq eerie (3) - 34 freq egf (3) - 1 freq era (3) - 30 freq eari (3) - 1 freq |
SoundEx code - E610 europe - 168 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 |
EERF |
| Time to execute Levenshtein function - 0.227968 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.392263 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.026924 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.036648 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.000994 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. |