| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ruskaleen (0) - 1 freq ruckles (4) - 1 freq rolleen (4) - 1 freq puskan (4) - 1 freq ruckle (4) - 2 freq bruckeen (4) - 1 freq skeen (4) - 8 freq spleen (4) - 1 freq kleen (4) - 1 freq muckeen (4) - 1 freq hulmalees (4) - 1 freq riseen (4) - 2 freq buik-leet (4) - 1 freq rockeen (4) - 1 freq runkled (4) - 17 freq dumpleen (4) - 1 freq gosleen (4) - 1 freq crackleen (4) - 1 freq runklie (4) - 1 freq sateen (4) - 1 freq rustlan (4) - 1 freq skale (4) - 1 freq rustled (4) - 4 freq susteen (4) - 1 freq sayeen (4) - 2 freq |
ruskaleen (0) - 1 freq runklin (5) - 1 freq rustlin (5) - 9 freq skeuleen (5) - 1 freq rustlan (5) - 1 freq resellin (6) - 1 freq fusslen (6) - 1 freq riskin (6) - 4 freq sibleen (6) - 1 freq puskan (6) - 1 freq skailan (6) - 1 freq ruckle (6) - 2 freq skilin (6) - 4 freq rustle (6) - 11 freq roslin (6) - 1 freq recycleen (6) - 1 freq runklet (6) - 1 freq speleen (6) - 3 freq rolleen (6) - 1 freq runkles (6) - 1 freq rustled (6) - 4 freq skale (6) - 1 freq drookleen (6) - 1 freq riseen (6) - 2 freq rinklin (6) - 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 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 reishlin - 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 - RSKLN ruskaleen - 1 freq recycleen - 1 freq recyclin - 1 freq |
RUSKALEEN |
| Time to execute Levenshtein function - 0.282171 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.445797 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.032270 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.049150 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.000853 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. |