| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uri (0) - 7 freq bri (1) - 2 freq ury (1) - 2 freq urx (1) - 1 freq urn (1) - 6 freq ur (1) - 604 freq urie (1) - 1 freq mri (1) - 1 freq ure (1) - 5 freq gri (1) - 1 freq sri (1) - 11 freq usri (1) - 3 freq eri (1) - 1 freq uni (1) - 53 freq iri (1) - 1 freq url (1) - 1 freq fri (1) - 6 freq ur' (1) - 1 freq ari (1) - 3 freq ri (1) - 117 freq ™ri (1) - 1 freq urr (1) - 40 freq wri (1) - 1 freq uki (1) - 2 freq ui (1) - 6 freq |
uri (0) - 7 freq eri (1) - 1 freq iri (1) - 1 freq yuri (1) - 1 freq ure (1) - 5 freq ari (1) - 3 freq ri (1) - 117 freq ur (1) - 604 freq ury (1) - 2 freq urie (1) - 1 freq rie (2) - 1 freq r (2) - 447 freq yur (2) - 221 freq or (2) - 9305 freq are (2) - 5138 freq ria (2) - 1 freq ar (2) - 208 freq yr (2) - 16 freq ourie (2) - 3 freq ry (2) - 7 freq euro (2) - 21 freq ir (2) - 1541 freq re (2) - 48 freq rio (2) - 5 freq eur (2) - 1 freq |
SoundEx code - U600 ur - 604 freq urr - 40 freq ure - 5 freq 'ur - 7 freq urrr - 1 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq €œur - 3 freq ur' - 1 freq €˜ur - 12 freq urie - 1 freq |
MetaPhone code - UR ur - 604 freq urr - 40 freq ure - 5 freq 'ur - 7 freq urrr - 1 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq €œur - 3 freq ur' - 1 freq €˜ur - 12 freq urie - 1 freq |
URI |
| Time to execute Levenshtein function - 0.300759 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.367333 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.028214 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.038245 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.000872 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. |