| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| euripe (0) - 1 freq europe (1) - 170 freq ourie (2) - 3 freq lurie (2) - 1 freq durie (2) - 1 freq curie (2) - 1 freq furie (2) - 13 freq murine (2) - 1 freq eurig (2) - 1 freq stripe (2) - 3 freq urie (2) - 1 freq ripe (2) - 28 freq gripe (2) - 5 freq eerie (2) - 34 freq burie (2) - 4 freq tripe (2) - 17 freq 'europe (2) - 1 freq eyrie (2) - 6 freq europa (2) - 7 freq eunice (2) - 1 freq erie (2) - 1 freq euraip (2) - 27 freq europ (2) - 2 freq urine (2) - 2 freq europe' (2) - 3 freq |
euripe (0) - 1 freq europe (1) - 170 freq europa (2) - 7 freq euraip (2) - 27 freq ripe (2) - 28 freq europ (2) - 2 freq erie (3) - 1 freq rope (3) - 118 freq 'europe (3) - 1 freq urine (3) - 2 freq rape (3) - 19 freq rip (3) - 57 freq irip (3) - 1 freq europe' (3) - 3 freq tripe (3) - 17 freq eyrie (3) - 6 freq eurig (3) - 1 freq rype (3) - 5 freq ourie (3) - 3 freq urie (3) - 1 freq eerie (3) - 34 freq gripe (3) - 5 freq erupt (4) - 3 freq drape (4) - 1 freq rise (4) - 245 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 - ERP europe - 170 freq europe' - 3 freq europa - 7 freq euraip - 27 freq 'europe - 1 freq europ - 2 freq euripe - 1 freq erpoo - 1 freq |
EURIPE |
| Time to execute Levenshtein function - 0.702427 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 - 1.102929 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.088156 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.104466 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.001205 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. |