| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ury (0) - 2 freq uy (1) - 4 freq urny (1) - 4 freq urr (1) - 43 freq cry (1) - 368 freq ry (1) - 7 freq dry (1) - 471 freq wry (1) - 12 freq jury (1) - 109 freq fury (1) - 31 freq fry (1) - 37 freq bury (1) - 24 freq urx (1) - 1 freq url (1) - 1 freq usy (1) - 1 freq try (1) - 786 freq yry (1) - 1 freq ur' (1) - 1 freq ure (1) - 5 freq pry (1) - 1 freq ur (1) - 541 freq ery (1) - 15 freq urn (1) - 6 freq dury (1) - 1 freq u-y (1) - 1 freq |
ury (0) - 2 freq ery (1) - 15 freq ur (1) - 541 freq ry (1) - 7 freq yry (1) - 1 freq uri (1) - 7 freq ure (1) - 5 freq iry (1) - 1 freq ere (2) - 287 freq iri (2) - 1 freq airy (2) - 4 freq yr (2) - 16 freq erey (2) - 1 freq ara (2) - 1 freq yur (2) - 221 freq or (2) - 9206 freq ora (2) - 1 freq ir (2) - 1540 freq yuri (2) - 1 freq ryo (2) - 1 freq aro (2) - 1 freq aura (2) - 11 freq our (2) - 486 freq ro (2) - 5 freq ire (2) - 9 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 |
URY |
| Time to execute Levenshtein function - 0.261290 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.412611 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.028071 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.038738 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.000774 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. |