| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| speller (0) - 2 freq spelled (1) - 13 freq spellers (1) - 1 freq seller (1) - 11 freq pelter (2) - 1 freq bueller (2) - 1 freq snellee (2) - 1 freq smaller (2) - 13 freq spenser (2) - 1 freq speiker (2) - 15 freq spalter (2) - 2 freq sellers (2) - 2 freq smelled (2) - 11 freq feller (2) - 1 freq speer (2) - 21 freq teller (2) - 2 freq spellin (2) - 193 freq puller (2) - 1 freq speldert (2) - 7 freq swelled (2) - 8 freq spilled (2) - 4 freq geller (2) - 1 freq shelled (2) - 2 freq speaker (2) - 65 freq speirer (2) - 2 freq |
speller (0) - 2 freq spellers (2) - 1 freq seller (2) - 11 freq spelled (2) - 13 freq spellin (3) - 193 freq poller (3) - 1 freq puller (3) - 1 freq spieler (3) - 1 freq spilled (3) - 4 freq spelleen (3) - 5 freq spellit (3) - 1 freq spalter (3) - 2 freq spellan (3) - 1 freq sellar (3) - 15 freq spells (3) - 21 freq smaller (3) - 13 freq siller (3) - 763 freq spell (3) - 160 freq spellt (3) - 9 freq pillar (4) - 15 freq pallor (4) - 4 freq speeled (4) - 7 freq shelley (4) - 2 freq spullt (4) - 2 freq spaell (4) - 4 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 |
SPELLER |
| Time to execute Levenshtein function - 0.245333 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.397069 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.031082 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.041126 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.000926 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. |