| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roucher (0) - 2 freq rouchir (1) - 1 freq rocher (1) - 5 freq rougher (1) - 1 freq voucher (1) - 8 freq rouch (2) - 6 freq brougher (2) - 3 freq rocker (2) - 3 freq gouched (2) - 2 freq tocher (2) - 25 freq poocher (2) - 2 freq couches (2) - 2 freq voocher (2) - 1 freq rounder (2) - 1 freq souched (2) - 6 freq touches (2) - 21 freq pouther (2) - 7 freq vouchers (2) - 1 freq rougier (2) - 2 freq tougher (2) - 3 freq ruther (2) - 3 freq souther (2) - 1 freq bucher (2) - 1 freq poacher (2) - 10 freq teucher (2) - 4 freq |
roucher (0) - 2 freq rocher (1) - 5 freq rouchir (1) - 1 freq voucher (2) - 8 freq richer (2) - 15 freq rougher (2) - 1 freq vouchir (3) - 5 freq poacher (3) - 10 freq bucher (3) - 1 freq brocher (3) - 2 freq moocher (3) - 2 freq aircher (3) - 1 freq rouch (3) - 6 freq ruther (3) - 3 freq rauchen (3) - 1 freq teucher (3) - 4 freq archer (3) - 9 freq tocher (3) - 25 freq poocher (3) - 2 freq rocker (3) - 3 freq voocher (3) - 1 freq cher (4) - 6 freq teecher (4) - 1 freq reaches (4) - 24 freq pyocher (4) - 3 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 |
ROUCHER |
| Time to execute Levenshtein function - 0.214261 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.360753 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.028291 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.038898 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.001002 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. |