| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| europa (0) - 7 freq europan (1) - 1 freq europ (1) - 2 freq europe (1) - 168 freq 'europe (2) - 1 freq european (2) - 171 freq europaen (2) - 2 freq euripe (2) - 1 freq euros (2) - 7 freq eureka (2) - 3 freq aurora (2) - 9 freq europe' (2) - 3 freq euro (2) - 21 freq drop (3) - 37 freq turps (3) - 2 freq rona (3) - 3 freq ebro (3) - 1 freq eross (3) - 1 freq cupola (3) - 1 freq corona (3) - 19 freq buroo (3) - 10 freq props (3) - 2 freq cuppa (3) - 21 freq trope (3) - 2 freq ezra (3) - 3 freq |
europa (0) - 7 freq europe (1) - 168 freq europ (1) - 2 freq euripe (2) - 1 freq europan (2) - 1 freq euro (3) - 21 freq euraip (3) - 27 freq rop (3) - 6 freq rapa (3) - 1 freq rope (3) - 116 freq europe' (3) - 3 freq aurora (3) - 9 freq european (3) - 171 freq 'europe (3) - 1 freq euros (3) - 7 freq europaen (3) - 2 freq eureka (3) - 3 freq irp (4) - 2 freq crop (4) - 23 freq rosa (4) - 12 freq erza (4) - 1 freq roka (4) - 3 freq pupa (4) - 1 freq eurasia (4) - 1 freq era (4) - 30 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 - ERP europe - 168 freq europe' - 3 freq europa - 7 freq euraip - 27 freq 'europe - 1 freq europ - 2 freq euripe - 1 freq erpoo - 1 freq |
EUROPA |
| Time to execute Levenshtein function - 0.216521 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.400997 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.032296 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.046803 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.001608 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. |