| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spaffer (0) - 1 freq spaffed (1) - 1 freq scaffer (1) - 1 freq affer (2) - 2 freq spacer (2) - 2 freq spanner (2) - 11 freq spanker (2) - 1 freq sclaffer (2) - 1 freq suiffer (2) - 1 freq safter (2) - 10 freq spayver (2) - 2 freq scaffed (2) - 1 freq gaffer (2) - 35 freq spaffer's (2) - 2 freq staffed (2) - 1 freq spaeker (2) - 20 freq safer (2) - 18 freq suffer (2) - 58 freq spraffed (2) - 2 freq snaffler (2) - 1 freq sniffer (2) - 3 freq spalter (2) - 2 freq siffer (2) - 3 freq seffer (2) - 1 freq puffer (2) - 1 freq |
spaffer (0) - 1 freq spaffed (2) - 1 freq scaffer (2) - 1 freq suiffer (3) - 1 freq seffer (3) - 1 freq siffer (3) - 3 freq puffer (3) - 1 freq suffer (3) - 58 freq sniffer (3) - 3 freq saifer (4) - 3 freq spalter (4) - 2 freq spaver (4) - 3 freq spaker (4) - 3 freq spoff (4) - 4 freq waffer (4) - 1 freq saufer (4) - 2 freq oaffer (4) - 2 freq snaffler (4) - 1 freq flaffer (4) - 3 freq saffen (4) - 1 freq sclaffer (4) - 1 freq safter (4) - 10 freq spanker (4) - 1 freq spraffed (4) - 2 freq affer (4) - 2 freq |
SoundEx code - S116 spaver - 3 freq savwver - 1 freq ss-beefers - 1 freq spayver - 2 freq saveafortune - 1 freq spaffer's - 2 freq spaffer - 1 freq |
MetaPhone code - SPFR spaver - 3 freq spayver - 2 freq spaffer - 1 freq |
SPAFFER |
| Time to execute Levenshtein function - 0.234791 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.427889 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.032337 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.048993 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.000924 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. |