Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
splore (0) - 25 freq splores (1) - 12 freq splored (1) - 1 freq sporf (2) - 1 freq explore (2) - 28 freq store (2) - 79 freq salome (2) - 1 freq slope (2) - 29 freq spoors (2) - 1 freq splers (2) - 1 freq shore (2) - 188 freq splorin (2) - 7 freq sloe (2) - 1 freq spare (2) - 98 freq deplore (2) - 1 freq schore (2) - 1 freq snore (2) - 6 freq spoke (2) - 267 freq smore (2) - 7 freq implore (2) - 1 freq sport (2) - 153 freq slorp (2) - 3 freq lore (2) - 12 freq pore (2) - 2 freq spose (2) - 9 freq |
splore (0) - 25 freq splored (2) - 1 freq splores (2) - 12 freq spare (3) - 98 freq deplore (3) - 1 freq implore (3) - 1 freq splorin (3) - 7 freq spire (3) - 5 freq splers (3) - 1 freq explore (3) - 28 freq sphere (3) - 14 freq spoor (3) - 2 freq splat (4) - 9 freq speir (4) - 212 freq spooner (4) - 1 freq splayed (4) - 2 freq aspire (4) - 3 freq sper (4) - 1 freq splaat (4) - 1 freq spulye (4) - 1 freq spulzie (4) - 2 freq spoil (4) - 14 freq spleen (4) - 1 freq spile (4) - 11 freq spieler (4) - 1 freq |
SoundEx code - S146 splerin - 1 freq splore-seekin - 1 freq splore - 25 freq splairgin - 4 freq splores - 12 freq splairge - 4 freq suppliers - 6 freq spieler - 1 freq splored - 1 freq splairged - 5 freq speller - 2 freq scapular - 1 freq splers - 1 freq splorin - 7 freq splurtit - 1 freq splairges - 1 freq supplearis - 1 freq supplier - 3 freq splyerin - 1 freq splirtin - 1 freq spellers - 1 freq spilers - 1 freq spoilers - 2 freq spilleroftea - 2 freq |
MetaPhone code - SPLR splore - 25 freq spieler - 1 freq speller - 2 freq supplier - 3 freq |
SPLORE |
Time to execute Levenshtein function - 0.229934 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.410852 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.028028 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.044625 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.000918 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. |