| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| richer (0) - 15 freq rocher (1) - 5 freq riche (1) - 4 freq sicher (1) - 1 freq ticher (1) - 3 freq hicher (1) - 1 freq richert (1) - 2 freq ficher (1) - 4 freq nicher (1) - 5 freq richter (1) - 3 freq picher (1) - 4 freq riches (1) - 23 freq rither (1) - 6 freq tocher (2) - 25 freq higher (2) - 79 freq niche (2) - 7 freq richt' (2) - 1 freq vincher (2) - 1 freq rider (2) - 10 freq aircher (2) - 1 freq richtt (2) - 1 freq picter (2) - 89 freq roucher (2) - 2 freq sicker (2) - 8 freq siccer (2) - 3 freq |
richer (0) - 15 freq rocher (1) - 5 freq riches (2) - 23 freq picher (2) - 4 freq aircher (2) - 1 freq roucher (2) - 2 freq richter (2) - 3 freq archer (2) - 9 freq rither (2) - 6 freq nicher (2) - 5 freq sicher (2) - 1 freq riche (2) - 4 freq hicher (2) - 1 freq ticher (2) - 3 freq ficher (2) - 4 freq richert (2) - 2 freq rouchir (3) - 1 freq richly (3) - 4 freq ruther (3) - 3 freq rasher (3) - 1 freq rich (3) - 192 freq richie (3) - 2 freq heicher (3) - 30 freq richt (3) - 4119 freq crichar (3) - 151 freq |
SoundEx code - R260 razer - 1 freq richer - 15 freq reassuir - 2 freq reassure - 12 freq razzor - 2 freq razor - 14 freq rugger - 2 freq rocker - 3 freq rosary - 6 freq rigger - 2 freq rocher - 5 freq require - 10 freq racer - 1 freq racherie - 1 freq rosario - 1 freq rougher - 1 freq roger - 5 freq rockery - 1 freq regiar - 1 freq rigor - 1 freq rasher - 1 freq roeckir - 1 freq rouchir - 1 freq raigiar - 1 freq roucher - 2 freq recur - 1 freq €œroger - 3 freq raiser - 2 freq rougier - 2 freq rosr - 1 freq rsyry - 1 freq rigeur - 1 freq raker - 2 freq reekiewar - 1 freq rzr - 1 freq |
MetaPhone code - RXR richer - 15 freq rocher - 5 freq racherie - 1 freq rasher - 1 freq rouchir - 1 freq roucher - 2 freq |
RICHER |
| Time to execute Levenshtein function - 0.283598 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.442535 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.027482 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.037416 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.000918 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. |