| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roslin (0) - 1 freq rowlin (1) - 4 freq rostin (1) - 2 freq rollin (1) - 58 freq roilin (1) - 1 freq roslyn (1) - 2 freq roulin (1) - 2 freq restin (2) - 31 freq rollie (2) - 4 freq tossin (2) - 18 freq dolin (2) - 1 freq rowin (2) - 30 freq holin (2) - 2 freq growlin (2) - 15 freq rousin (2) - 5 freq howlin (2) - 57 freq toolin (2) - 1 freq rosslyn (2) - 2 freq crowlin (2) - 3 freq tostin (2) - 1 freq droolin (2) - 3 freq boolin (2) - 16 freq roabin (2) - 1 freq ootlin (2) - 12 freq rivlin (2) - 5 freq |
roslin (0) - 1 freq roslyn (1) - 2 freq roilin (2) - 1 freq roulin (2) - 2 freq rowlin (2) - 4 freq rostin (2) - 2 freq rollin (2) - 58 freq roostin (3) - 5 freq risin (3) - 137 freq rawlin (3) - 1 freq roisin (3) - 2 freq railin (3) - 12 freq rasin (3) - 1 freq roilan (3) - 1 freq rollen (3) - 2 freq roastin (3) - 23 freq rumlin (3) - 1 freq rushin (3) - 17 freq respin (3) - 1 freq riskin (3) - 5 freq rustin (3) - 5 freq rustlin (3) - 10 freq resin (3) - 6 freq reelin (3) - 16 freq ristin (3) - 3 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 - RSLN wrasslin - 7 freq rosslyn - 2 freq roslin - 1 freq roslyn - 2 freq resellin - 1 freq |
ROSLIN |
| Time to execute Levenshtein function - 0.227085 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.416442 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.030107 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.040430 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.001235 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. |