| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reeshlin (0) - 6 freq reishlin (1) - 1 freq breeshlin (1) - 3 freq breeshlit (2) - 1 freq keechlin (2) - 2 freq reeshle (2) - 10 freq reeshlet (2) - 1 freq weeshin (2) - 1 freq reelin (2) - 16 freq reeshled (2) - 1 freq reesin (2) - 1 freq reestin (2) - 1 freq reeshie (2) - 1 freq reestled (3) - 1 freq keechin (3) - 5 freq reevin (3) - 3 freq sweeshin (3) - 4 freq eastlin (3) - 2 freq weedlin (3) - 1 freq weeglin (3) - 2 freq rellin (3) - 1 freq reishle (3) - 2 freq sneeshin (3) - 8 freq treetlin (3) - 5 freq veesitin (3) - 31 freq |
reeshlin (0) - 6 freq reishlin (1) - 1 freq breeshlin (2) - 3 freq reeshle (3) - 10 freq reeshlet (3) - 1 freq reeshled (3) - 1 freq rustlin (4) - 9 freq hushlin (4) - 1 freq rochlin (4) - 1 freq reishle (4) - 2 freq resellin (4) - 1 freq rushin (4) - 16 freq reishil (4) - 6 freq reshapin (4) - 1 freq reeshelt (4) - 2 freq roslin (4) - 1 freq reestin (4) - 1 freq reelin (4) - 16 freq reesin (4) - 1 freq weeshin (4) - 1 freq keechlin (4) - 2 freq breeshlit (4) - 1 freq reeshie (4) - 1 freq reachin (5) - 32 freq resultin (5) - 7 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 - RXLN reeshlin - 6 freq reishlin - 1 freq rochlin - 1 freq |
REESHLIN |
| Time to execute Levenshtein function - 0.197740 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.336849 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.028030 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.036883 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.000852 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. |