| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rochlin (0) - 1 freq pochlin (1) - 1 freq crochlin (1) - 1 freq cochlin (1) - 1 freq drochlin (1) - 2 freq rochian (2) - 1 freq rochles (2) - 1 freq rockin (2) - 18 freq roullin (2) - 3 freq rowlin (2) - 4 freq rochled (2) - 2 freq rollin (2) - 58 freq roslin (2) - 1 freq vrochtin (2) - 2 freq racklin (2) - 3 freq roch-lik (2) - 1 freq snochlin (2) - 1 freq richtin (2) - 3 freq pochlit (2) - 1 freq wrochtin (2) - 1 freq wachlin (2) - 2 freq rochly (2) - 3 freq rocklie (2) - 1 freq roulin (2) - 2 freq roilin (2) - 1 freq |
rochlin (0) - 1 freq pochlin (2) - 1 freq cochlin (2) - 1 freq drochlin (2) - 2 freq crochlin (2) - 1 freq rochled (3) - 2 freq wachlin (3) - 2 freq rochly (3) - 3 freq rochles (3) - 1 freq racklin (3) - 3 freq richtin (3) - 3 freq rochian (3) - 1 freq waachlin (4) - 1 freq schulin (4) - 2 freq ruchly (4) - 3 freq recline (4) - 2 freq michelin (4) - 4 freq archin (4) - 1 freq touchline (4) - 14 freq fauchlin (4) - 1 freq keechlin (4) - 2 freq recallin (4) - 1 freq reeshlin (4) - 6 freq rochlookin (4) - 1 freq bauchlin (4) - 1 freq |
SoundEx code - R245 raskolnikov - 5 freq raskolnikov's - 1 freq recline - 2 freq reclamation - 5 freq reclaimin - 3 freq reclaimed - 3 freq reclaimt - 1 freq resilient - 4 freq ruskaleen - 1 freq reclaim - 7 freq recliner - 2 freq reishlin - 2 freq re-clamsed - 1 freq reeshlin - 6 freq rosslyn - 2 freq resilience - 6 freq reclamaetor - 1 freq racklin - 3 freq resiliant - 1 freq reclehm - 1 freq ruckling - 1 freq recallin - 1 freq regalin - 1 freq rochlin - 1 freq roslin - 1 freq risslins - 1 freq rassling - 2 freq recoilin - 1 freq roslyn - 2 freq recolonization - 1 freq re-claims - 1 freq rachelnuttella - 10 freq rachelmelville - 2 freq rascalmultitude - 2 freq rachelmackie - 1 freq raceland - 1 freq roslynmitchell - 1 freq resellin - 1 freq |
MetaPhone code - RXLN reishlin - 2 freq reeshlin - 6 freq rochlin - 1 freq |
ROCHLIN |
| Time to execute Levenshtein function - 0.542978 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.986616 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.035175 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.071048 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.000910 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. |