| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uerk (0) - 1 freq werk (1) - 8 freq herk (1) - 3 freq merk (1) - 63 freq perk (1) - 28 freq erk (1) - 5 freq yerk (1) - 3 freq terk (1) - 1 freq berk (1) - 3 freq derk (1) - 106 freq jerk (1) - 8 freq uork (1) - 1 freq serk (1) - 3 freq verk (1) - 2 freq per (2) - 70 freq virk (2) - 1 freq hero (2) - 83 freq vork (2) - 1 freq bark (2) - 34 freq ury (2) - 2 freq gork (2) - 1 freq fern (2) - 5 freq vyrk (2) - 1 freq perv (2) - 3 freq kerr (2) - 31 freq |
uerk (0) - 1 freq yerk (1) - 3 freq uork (1) - 1 freq erk (1) - 5 freq rk (2) - 2 freq reek (2) - 167 freq reak (2) - 1 freq rek (2) - 2 freq erik (2) - 2 freq ark (2) - 12 freq airk (2) - 3 freq yark (2) - 8 freq erek (2) - 1 freq irk (2) - 2 freq york (2) - 25 freq reik (2) - 15 freq ork (2) - 2 freq uarke (2) - 1 freq perk (2) - 28 freq terk (2) - 1 freq merk (2) - 63 freq herk (2) - 3 freq werk (2) - 8 freq derk (2) - 106 freq berk (2) - 3 freq |
SoundEx code - U620 urge - 27 freq uruguy - 1 freq urrh's - 1 freq urss - 1 freq uarke - 1 freq uerk - 1 freq uork - 1 freq urgh - 2 freq urrs - 1 freq urwise - 1 freq €˜urgh - 2 freq €˜urs - 1 freq ur's - 1 freq €˜ur's - 3 freq 'ur's - 1 freq urx - 1 freq uorhxya - 1 freq |
MetaPhone code - URK uruguy - 1 freq uarke - 1 freq uerk - 1 freq uork - 1 freq |
UERK |
| Time to execute Levenshtein function - 0.252470 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.369011 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.030458 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.036762 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.000881 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. |