| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| udhr (0) - 1 freq udr (1) - 1 freq dur (2) - 1 freq uzh (2) - 2 freq mehr (2) - 1 freq dxr (2) - 1 freq ujlr (2) - 1 freq uth (2) - 1 freq dha (2) - 1 freq echr (2) - 1 freq wahr (2) - 1 freq edr (2) - 1 freq pdr (2) - 2 freq uhm (2) - 1 freq uha (2) - 2 freq odhar (2) - 1 freq ud (2) - 4 freq dir (2) - 400 freq jdh (2) - 1 freq ucht (2) - 1 freq ufhx (2) - 1 freq uch (2) - 3 freq gdh (2) - 2 freq ndr (2) - 1 freq qdhg (2) - 1 freq |
udhr (0) - 1 freq odhar (2) - 1 freq udr (2) - 1 freq uthur (3) - 1 freq ahr (3) - 1 freq hr (3) - 11 freq dahri (3) - 1 freq shr (3) - 1 freq dor (3) - 5 freq dh (3) - 1 freq uthir (3) - 1 freq dfr (3) - 2 freq ohr (3) - 1 freq usher (3) - 3 freq dht (3) - 1 freq adhere (3) - 7 freq dr (3) - 199 freq adhd (3) - 5 freq uther (3) - 9 freq nahr (3) - 1 freq dyr (3) - 1 freq dar (3) - 86 freq dha (3) - 1 freq dxr (3) - 1 freq mehr (3) - 1 freq |
SoundEx code - U360 utter - 62 freq udr - 1 freq udhr - 1 freq uther - 9 freq uthur - 1 freq uthir - 1 freq utir - 1 freq udder - 1 freq |
MetaPhone code - UTR utter - 62 freq udr - 1 freq udhr - 1 freq utir - 1 freq udder - 1 freq |
UDHR |
| Time to execute Levenshtein function - 0.202604 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.363073 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.027156 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.036434 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.000835 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. |