| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rosslyn (0) - 2 freq roslyn (1) - 2 freq grossly (2) - 1 freq roslin (2) - 1 freq rochly (3) - 3 freq roullin (3) - 3 freq roly (3) - 8 freq easslin (3) - 1 freq fisslin (3) - 1 freq clossly (3) - 2 freq wrasslin (3) - 7 freq mosely (3) - 2 freq rossies (3) - 1 freq dossin (3) - 3 freq rowlin (3) - 4 freq croasly (3) - 1 freq rollan (3) - 2 freq robson (3) - 14 freq wossy (3) - 1 freq roostin (3) - 5 freq cossye (3) - 1 freq fusslen (3) - 1 freq rochlin (3) - 1 freq ross (3) - 102 freq rousay (3) - 4 freq |
rosslyn (0) - 2 freq roslyn (2) - 2 freq roslin (3) - 1 freq rassling (4) - 2 freq fusslen (4) - 1 freq hasslin (4) - 1 freq rustlan (4) - 1 freq fusslin (4) - 8 freq rustlin (4) - 10 freq russian (4) - 37 freq roussian (4) - 1 freq basslin (4) - 1 freq risslins (4) - 1 freq easslin (4) - 1 freq fisslin (4) - 1 freq grossly (4) - 1 freq wrasslin (4) - 7 freq rustly (5) - 1 freq rollen (5) - 2 freq crossin (5) - 30 freq lossen (5) - 1 freq lossin (5) - 32 freq tossin (5) - 18 freq crosseen (5) - 1 freq rowstin (5) - 4 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 |
ROSSLYN |
| Time to execute Levenshtein function - 0.261145 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 - 1.021812 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.160190 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.117698 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.000850 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. |