| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urr (0) - 43 freq burr (1) - 2 freq grr (1) - 2 freq urn (1) - 6 freq turr (1) - 1 freq gurr (1) - 15 freq irr (1) - 2 freq ur (1) - 541 freq ury (1) - 2 freq murr (1) - 1 freq furr (1) - 12 freq brr (1) - 5 freq orr (1) - 16 freq hurr (1) - 1 freq rr (1) - 1 freq urrs (1) - 1 freq jrr (1) - 1 freq wurr (1) - 27 freq ure (1) - 5 freq err (1) - 40 freq udr (1) - 1 freq urx (1) - 1 freq purr (1) - 2 freq upr (1) - 2 freq url (1) - 1 freq |
urr (0) - 43 freq irr (1) - 2 freq rr (1) - 1 freq orr (1) - 16 freq err (1) - 40 freq ur' (2) - 1 freq zrr (2) - 1 freq url (2) - 1 freq urx (2) - 1 freq purr (2) - 2 freq uri (2) - 7 freq rur (2) - 3 freq erra (2) - 3 freq rar (2) - 1 freq rre (2) - 1 freq orra (2) - 172 freq rer (2) - 3 freq udr (2) - 1 freq arra (2) - 31 freq arry (2) - 1 freq upr (2) - 2 freq ure (2) - 5 freq grr (2) - 2 freq burr (2) - 2 freq ury (2) - 2 freq |
SoundEx code - U600 ur - 541 freq urr - 43 freq ure - 5 freq 'ur - 7 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq ur' - 1 freq €˜ur - 12 freq €œur - 1 freq urie - 1 freq |
MetaPhone code - UR ur - 541 freq urr - 43 freq ure - 5 freq 'ur - 7 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq ur' - 1 freq €˜ur - 12 freq €œur - 1 freq urie - 1 freq |
URR |
| Time to execute Levenshtein function - 0.171806 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.325558 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.027037 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.037194 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.000889 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. |