| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| europe (0) - 170 freq europe' (1) - 3 freq europa (1) - 7 freq 'europe (1) - 1 freq europ (1) - 2 freq euripe (1) - 1 freq euros (2) - 7 freq europaen (2) - 2 freq europan (2) - 1 freq €œrope (2) - 1 freq european (2) - 173 freq europe's (2) - 9 freq erode (2) - 1 freq rope (2) - 118 freq trope (2) - 2 freq euro (2) - 21 freq erse (3) - 270 freq errour (3) - 1 freq hurlie (3) - 1 freq ernie (3) - 50 freq dryope (3) - 1 freq 'rose (3) - 1 freq lope (3) - 1 freq zoetrope (3) - 2 freq tyrone (3) - 6 freq |
europe (0) - 170 freq euripe (1) - 1 freq europ (1) - 2 freq europa (1) - 7 freq europe' (2) - 3 freq rope (2) - 118 freq 'europe (2) - 1 freq ripe (3) - 28 freq rape (3) - 19 freq rop (3) - 6 freq trope (3) - 2 freq ropey (3) - 1 freq euraip (3) - 27 freq rype (3) - 5 freq euro (3) - 21 freq europaen (3) - 2 freq europan (3) - 1 freq euros (3) - 7 freq european (3) - 173 freq erode (3) - 1 freq roe (4) - 15 freq hope (4) - 769 freq erie (4) - 1 freq dope (4) - 11 freq drop (4) - 39 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 |
EUROPE |
| Time to execute Levenshtein function - 0.205678 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.312465 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.027036 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.036832 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.000933 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. |