| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urx (0) - 1 freq ury (1) - 2 freq ure (1) - 5 freq urr (1) - 43 freq rx (1) - 6 freq ux (1) - 3 freq uri (1) - 7 freq ur (1) - 541 freq urn (1) - 6 freq qrx (1) - 1 freq upx (1) - 1 freq ur' (1) - 1 freq url (1) - 1 freq unk (2) - 1 freq vix (2) - 1 freq curt (2) - 1 freq max (2) - 31 freq ars (2) - 2 freq ubg (2) - 4 freq wurc (2) - 1 freq burt (2) - 2 freq mrp (2) - 1 freq ore (2) - 1 freq ufhx (2) - 1 freq uis (2) - 17 freq |
urx (0) - 1 freq rx (1) - 6 freq ury (2) - 2 freq url (2) - 1 freq rex (2) - 3 freq rxe (2) - 1 freq rux (2) - 1 freq ur' (2) - 1 freq rax (2) - 79 freq upx (2) - 1 freq ux (2) - 3 freq urr (2) - 43 freq ure (2) - 5 freq ur (2) - 541 freq uri (2) - 7 freq urn (2) - 6 freq qrx (2) - 1 freq aura (3) - 11 freq ird (3) - 1 freq art (3) - 88 freq are (3) - 5053 freq jix (3) - 1 freq iry (3) - 1 freq urny (3) - 4 freq sarx (3) - 1 freq |
SoundEx code - U620 urge - 25 freq uruguy - 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 - URKS urx - 1 freq |
URX |
| Time to execute Levenshtein function - 0.213805 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.384881 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.027435 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.037732 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.000946 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. |