| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jr (0) - 17 freq jer (1) - 1 freq yr (1) - 16 freq jj (1) - 7 freq sr (1) - 3 freq pr (1) - 21 freq ji (1) - 7 freq jv (1) - 2 freq r (1) - 2 freq r (1) - 7 freq jx (1) - 4 freq jf (1) - 1 freq rr (1) - 1 freq jsr (1) - 1 freq jk (1) - 8 freq xr (1) - 3 freq jm (1) - 57 freq pjr (1) - 1 freq ir (1) - 1541 freq dr (1) - 199 freq r (1) - 2 freq r (1) - 1 freq je (1) - 10 freq jn (1) - 11 freq gr (1) - 4 freq |
jr (0) - 17 freq ajr (1) - 1 freq jru (1) - 1 freq jer (1) - 1 freq jar (1) - 41 freq mjr (2) - 23 freq jd (2) - 6 freq r (2) - 1 freq tr (2) - 8 freq er (2) - 630 freq jt (2) - 20 freq jp (2) - 7 freq gjr (2) - 1 freq br (2) - 4 freq fr (2) - 1 freq r (2) - 447 freq jrr (2) - 1 freq jrb (2) - 3 freq hr (2) - 11 freq ar (2) - 208 freq kr (2) - 4 freq mr (2) - 1314 freq jb (2) - 2 freq jaur (2) - 23 freq jure (2) - 1 freq |
SoundEx code - J600 jar - 41 freq jaur - 23 freq jury - 109 freq jerry - 15 freq jr - 17 freq jckrrh - 1 freq jure - 1 freq jour - 2 freq jeer - 7 freq jury- - 2 freq jer - 1 freq jaurie - 1 freq jiyro - 1 freq jura - 3 freq jerrie - 5 freq jieir - 1 freq jirr - 1 freq jrr - 1 freq jerah - 3 freq jru - 1 freq jjrea - 1 freq jxryi - 1 freq jsr - 1 freq |
MetaPhone code - JR gear - 237 freq jar - 41 freq jaur - 23 freq jury - 109 freq gyre - 13 freq jerry - 15 freq jr - 17 freq giro - 12 freq jure - 1 freq geari - 1 freq geer - 16 freq jour - 2 freq jeer - 7 freq gerry - 13 freq jury- - 2 freq giaur - 1 freq gear' - 1 freq jer - 1 freq jaurie - 1 freq geir - 14 freq gier - 2 freq jiyro - 1 freq jura - 3 freq jerrie - 5 freq gearie - 4 freq jieir - 1 freq geerie - 1 freq ger - 2 freq jirr - 1 freq ger- - 1 freq jrr - 1 freq gie-owre - 1 freq jerah - 3 freq jru - 1 freq jjrea - 1 freq wwjr - 1 freq |
JR |
| Time to execute Levenshtein function - 0.175770 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.316621 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.027264 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.037073 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.000919 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. |