| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uarke (0) - 1 freq barke (1) - 1 freq warke (1) - 1 freq parke (1) - 2 freq dare (2) - 61 freq hake (2) - 3 freq warkie (2) - 1 freq yarked (2) - 9 freq yark (2) - 8 freq parken (2) - 1 freq yare (2) - 1 freq barge (2) - 15 freq dake (2) - 4 freq markd (2) - 1 freq sarne (2) - 1 freq urie (2) - 1 freq make (2) - 649 freq darken (2) - 3 freq kare (2) - 1 freq marks (2) - 45 freq rare (2) - 301 freq sarky (2) - 10 freq bake (2) - 42 freq larks (2) - 4 freq harse (2) - 1 freq |
uarke (0) - 1 freq erke (2) - 1 freq yark (2) - 8 freq arky (2) - 1 freq uork (2) - 1 freq ark (2) - 12 freq barke (2) - 1 freq raike (2) - 1 freq warke (2) - 1 freq parke (2) - 2 freq uerk (2) - 1 freq rake (2) - 31 freq parkie (3) - 2 freq raik (3) - 25 freq dark (3) - 394 freq barkie (3) - 1 freq airk (3) - 3 freq fake (3) - 58 freq eake (3) - 1 freq burke (3) - 13 freq quake (3) - 7 freq yerk (3) - 3 freq sark (3) - 124 freq marky (3) - 1 freq wark (3) - 903 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 |
UARKE |
| Time to execute Levenshtein function - 0.269299 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.529312 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.037621 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.048284 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.000900 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. |