| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spilers (0) - 1 freq spiders (1) - 6 freq spiers (1) - 15 freq spoilers (1) - 2 freq splers (1) - 1 freq spikers (1) - 3 freq spiles (1) - 1 freq eilers (2) - 1 freq spine's (2) - 1 freq shilters (2) - 1 freq spellers (2) - 1 freq jailers (2) - 1 freq spices (2) - 16 freq spieler (2) - 1 freq piers (2) - 7 freq spikes (2) - 15 freq spider (2) - 30 freq spider's (2) - 1 freq spills (2) - 9 freq siles (2) - 1 freq slivers (2) - 5 freq smiler (2) - 1 freq speikers (2) - 46 freq spile (2) - 11 freq spiker (2) - 1 freq |
spilers (0) - 1 freq splers (1) - 1 freq spoilers (1) - 2 freq spiles (2) - 1 freq spikers (2) - 3 freq spiders (2) - 6 freq spiers (2) - 15 freq spacers (3) - 2 freq spiels (3) - 2 freq speikers (3) - 46 freq speers (3) - 7 freq sailors (3) - 17 freq sellers (3) - 2 freq spills (3) - 9 freq spires (3) - 2 freq splores (3) - 12 freq spakers (3) - 4 freq saulers (3) - 1 freq spieler (3) - 1 freq spellers (3) - 1 freq speils (4) - 1 freq spares (4) - 1 freq splits (4) - 9 freq spheres (4) - 17 freq sillars (4) - 2 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 - SPLRS splores - 12 freq suppliers - 6 freq splers - 1 freq supplearis - 1 freq spellers - 1 freq spilers - 1 freq spoilers - 2 freq |
SPILERS |
| Time to execute Levenshtein function - 0.228472 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.358979 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.027379 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.037233 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.000954 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. |