| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ure (0) - 5 freq ore (1) - 1 freq uce (1) - 1 freq sre (1) - 2 freq url (1) - 1 freq ture (1) - 2 freq ire (1) - 9 freq use (1) - 466 freq re (1) - 48 freq une (1) - 4 freq pure (1) - 676 freq oure (1) - 7 freq urn (1) - 6 freq are (1) - 5138 freq cure (1) - 54 freq ury (1) - 2 freq ere (1) - 288 freq urr (1) - 40 freq sure (1) - 1001 freq fure (1) - 1 freq urie (1) - 1 freq ur (1) - 604 freq kre (1) - 1 freq wure (1) - 5 freq fre (1) - 2 freq |
ure (0) - 5 freq are (1) - 5138 freq oure (1) - 7 freq ury (1) - 2 freq urie (1) - 1 freq ur (1) - 604 freq re (1) - 48 freq ere (1) - 288 freq uri (1) - 7 freq ire (1) - 9 freq ore (1) - 1 freq ru (2) - 1 freq iri (2) - 1 freq yur (2) - 221 freq ar (2) - 208 freq area (2) - 166 freq ora (2) - 1 freq ir (2) - 1541 freq yore (2) - 4 freq reu (2) - 3 freq erie (2) - 1 freq er (2) - 630 freq ira (2) - 7 freq eur (2) - 1 freq yuri (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 |
URE |
| Time to execute Levenshtein function - 0.183535 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.356200 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.028501 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.038158 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.000937 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. |