| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spieler (0) - 1 freq spieled (1) - 1 freq spielin (2) - 1 freq speller (2) - 2 freq spiker (2) - 1 freq spier (2) - 42 freq speeled (2) - 7 freq spinner (2) - 1 freq spiles (2) - 1 freq smiler (2) - 1 freq spicker (2) - 4 freq spielt (2) - 1 freq stiever (2) - 1 freq spiered (2) - 182 freq pielet (2) - 2 freq spider (2) - 30 freq spiel (2) - 19 freq spaeker (2) - 20 freq spitter (2) - 1 freq siever (2) - 2 freq spile (2) - 11 freq spilet (2) - 4 freq spilers (2) - 1 freq spilled (2) - 4 freq spikker (2) - 14 freq |
spieler (0) - 1 freq spieled (2) - 1 freq spilers (3) - 1 freq spilet (3) - 4 freq spaeker (3) - 20 freq speeder (3) - 16 freq spile (3) - 11 freq spiled (3) - 7 freq speer (3) - 21 freq peeler (3) - 3 freq siller (3) - 763 freq spiels (3) - 2 freq spider (3) - 30 freq spiel (3) - 19 freq spiker (3) - 1 freq smiler (3) - 1 freq spiles (3) - 1 freq spier (3) - 42 freq speeled (3) - 7 freq speller (3) - 2 freq spielin (3) - 1 freq spielt (3) - 1 freq pler (4) - 1 freq sampler (4) - 3 freq speirer (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 - SPLR splore - 25 freq spieler - 1 freq speller - 2 freq supplier - 3 freq |
SPIELER |
| Time to execute Levenshtein function - 0.287605 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.353011 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.031622 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.037258 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.000908 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. |