| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eurolang (0) - 9 freq europan (2) - 1 freq eurolang's (2) - 1 freq erling (3) - 1 freq curlan (3) - 2 freq curling (3) - 3 freq roland (3) - 2 freq endlang (3) - 4 freq euang (3) - 1 freq europeans (3) - 4 freq curdling (3) - 1 freq hurlan (3) - 4 freq hurling (3) - 2 freq owrelang (3) - 2 freq year-lang (3) - 3 freq europa (3) - 7 freq eroding (3) - 1 freq erowan (3) - 1 freq rorang (3) - 1 freq burdsang (3) - 1 freq enrolling (3) - 1 freq european (3) - 173 freq europaen (3) - 2 freq during (4) - 55 freq surfing (4) - 1 freq |
eurolang (0) - 9 freq erling (3) - 1 freq year-lang (4) - 3 freq hurling (4) - 2 freq eroding (4) - 1 freq rorang (4) - 1 freq ruling (4) - 1 freq rlong (4) - 1 freq owrelang (4) - 2 freq eurolang's (4) - 1 freq curling (4) - 3 freq roland (4) - 2 freq europan (4) - 1 freq pooling (5) - 1 freq loang (5) - 3 freq rolling (5) - 7 freq darling (5) - 111 freq alang (5) - 1171 freq erline (5) - 1 freq yreland (5) - 1 freq rumiling (5) - 1 freq erying (5) - 1 freq duolingo (5) - 7 freq lang (5) - 3250 freq owerlang (5) - 2 freq |
SoundEx code - E645 erlend - 4 freq erling - 1 freq erlend's - 1 freq erlendsbairn - 1 freq eurolang - 9 freq eurolang's - 1 freq errolhenry - 1 freq erline - 1 freq erlines - 2 freq |
MetaPhone code - ERLNK erling - 1 freq eurolang - 9 freq |
EUROLANG |
| Time to execute Levenshtein function - 0.214084 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.393317 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.033356 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.039955 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.000948 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. |