| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ranch (0) - 3 freq rauch (1) - 7 freq rach (1) - 5 freq branch (1) - 44 freq runch (1) - 1 freq franch (1) - 1 freq raech (1) - 2 freq anh (2) - 1 freq laach (2) - 36 freq hainch (2) - 2 freq lauch (2) - 160 freq each (2) - 622 freq nancy (2) - 37 freq latch (2) - 11 freq bunch (2) - 105 freq rouch (2) - 6 freq manc (2) - 1 freq taech (2) - 1 freq hauch (2) - 12 freq match (2) - 174 freq march (2) - 138 freq 'ach (2) - 27 freq kach (2) - 1 freq grunch (2) - 1 freq warch (2) - 1 freq |
ranch (0) - 3 freq runch (1) - 1 freq raech (2) - 2 freq rauch (2) - 7 freq reench (2) - 1 freq franch (2) - 1 freq branch (2) - 44 freq rach (2) - 5 freq cinch (3) - 4 freq reuch (3) - 17 freq lunch (3) - 68 freq frainch (3) - 8 freq ruch (3) - 18 freq grinch (3) - 1 freq brunch (3) - 3 freq lench (3) - 4 freq frinch (3) - 1 freq binch (3) - 6 freq kynch (3) - 1 freq reach (3) - 143 freq winch (3) - 6 freq hinch (3) - 2 freq riach (3) - 5 freq brainch (3) - 38 freq rancid (3) - 6 freq |
SoundEx code - R520 rins - 101 freq rones - 3 freq ruins - 26 freq rowans - 12 freq rang - 82 freq rooms - 59 freq ramsay - 48 freq range - 93 freq ring - 213 freq rains - 27 freq rung - 25 freq rank - 42 freq rings - 103 freq runs - 72 freq rhymes - 40 freq raens - 2 freq reeng - 3 freq ramage - 2 freq reinge - 26 freq rynes - 3 freq 'rhymes - 1 freq reins - 21 freq raing - 1 freq rungs - 3 freq rink - 14 freq ramsh - 2 freq rinks - 3 freq rammies - 4 freq ranks - 27 freq rhyme's - 1 freq romish - 1 freq renwick - 18 freq ramsey - 8 freq ruims - 9 freq ruinous - 1 freq reenge - 60 freq reengs - 1 freq room's - 5 freq roon's - 2 freq ranch - 3 freq rank's - 1 freq rannoch - 9 freq rhonis - 1 freq remake - 3 freq rinse - 8 freq runch - 1 freq range' - 1 freq ronnie's - 21 freq rouns - 4 freq runes - 6 freq rahness - 1 freq rims - 3 freq rïng - 1 freq rummies - 1 freq 'rins - 1 freq roons - 7 freq romeos - 1 freq rhinns - 3 freq rome's - 1 freq reams - 5 freq rowan's - 1 freq ramasse - 2 freq reings - 2 freq rimms - 1 freq reing - 2 freq ramse - 2 freq reums - 1 freq remak - 1 freq rain's - 5 freq 'rings - 1 freq rams - 6 freq ram's - 1 freq rønis - 1 freq runge - 2 freq renga - 2 freq rawns - 1 freq rehns - 1 freq run's - 1 freq reemsh - 1 freq ranke - 1 freq rowmes - 1 freq rønnies - 3 freq röenis - 1 freq rumse - 2 freq raans - 2 freq reemish - 1 freq ruinage - 4 freq rummage - 1 freq römische - 1 freq rehung - 1 freq rönnies - 1 freq ryan's - 2 freq rhones - 1 freq rummys - 1 freq rmhoose - 1 freq reyns - 2 freq rymes - 1 freq rangs - 2 freq rammish - 2 freq rewynes - 1 freq rancie - 1 freq raings - 1 freq rammys - 1 freq raenge - 1 freq rammage - 1 freq €œring - 1 freq ronas - 3 freq €œrongye - 3 freq rongye - 70 freq re-make - 1 freq re-mak - 1 freq rans - 1 freq rïngs - 3 freq reench - 1 freq ronis - 1 freq ronnies - 1 freq rnj - 1 freq remix - 1 freq ramos - 2 freq rrrrnessa - 1 freq riems - 1 freq runcie - 1 freq ree-mogg - 1 freq rynge - 1 freq ronague - 2 freq romeo's - 1 freq rnez - 1 freq rnyex - 1 freq rns - 5 freq rhmk - 1 freq rrinis - 1 freq rennies - 4 freq |
MetaPhone code - RNX ranch - 3 freq rannoch - 9 freq runch - 1 freq wrench - 5 freq reench - 1 freq |
RANCH |
| Time to execute Levenshtein function - 0.183965 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.332348 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.028024 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.037199 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.000854 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. |