Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
european (0) - 173 freq europeans (1) - 4 freq europan (1) - 1 freq europe (2) - 170 freq europe's (2) - 9 freq europa (2) - 7 freq europe' (2) - 3 freq europaen (2) - 2 freq euripe (3) - 1 freq erowen (3) - 1 freq europ (3) - 2 freq eurasian (3) - 2 freq usopen (3) - 1 freq eurolang (3) - 9 freq erowan (3) - 1 freq utopian (3) - 4 freq droppan (3) - 3 freq 'europe (3) - 1 freq furein (4) - 1 freq earspoon (4) - 1 freq rippan (4) - 1 freq lurdan (4) - 1 freq rowan (4) - 18 freq curtseyan (4) - 1 freq growan (4) - 24 freq |
european (0) - 173 freq europan (1) - 1 freq europaen (2) - 2 freq europeans (2) - 4 freq europa (3) - 7 freq europe' (3) - 3 freq europe (3) - 170 freq erowan (4) - 1 freq utopian (4) - 4 freq reopen (4) - 1 freq rypan (4) - 1 freq ropin (4) - 1 freq ripen (4) - 8 freq usopen (4) - 1 freq erowen (4) - 1 freq euripe (4) - 1 freq europe's (4) - 9 freq europ (4) - 2 freq eurasian (4) - 2 freq rouman (5) - 2 freq hopan (5) - 6 freq roped (5) - 1 freq roan (5) - 4 freq 'open (5) - 5 freq roaran (5) - 4 freq |
SoundEx code - E615 european - 173 freq eurvin - 1 freq earphones - 2 freq europan - 1 freq europaen - 2 freq europeans - 4 freq europeanelection - 1 freq eerhevinafuckinlafonasunday - 1 freq ervinelinda - 9 freq europeandayoflanguages - 1 freq ervine - 1 freq |
MetaPhone code - ERPN european - 173 freq europan - 1 freq europaen - 2 freq |
EUROPEAN |
Time to execute Levenshtein function - 0.206696 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.401567 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.030283 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.047032 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.001406 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. |