| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spayver (0) - 2 freq spaver (1) - 3 freq spayce (2) - 2 freq splyter (2) - 2 freq spalter (2) - 2 freq syver (2) - 4 freq payer (2) - 1 freq slaver (2) - 6 freq spanker (2) - 1 freq spaker (2) - 3 freq slaiver (2) - 1 freq spaffer (2) - 1 freq spanner (2) - 11 freq sayven (2) - 1 freq shaver (2) - 2 freq swaver (2) - 1 freq spaeker (2) - 20 freq spacer (2) - 2 freq shaker (3) - 1 freq paerer (3) - 1 freq 'prayer (3) - 1 freq speeder (3) - 16 freq sharper (3) - 1 freq fayter (3) - 1 freq aver (3) - 4 freq |
spayver (0) - 2 freq spaver (1) - 3 freq slaiver (3) - 1 freq shaver (3) - 2 freq spacer (3) - 2 freq spaker (3) - 3 freq spaeker (3) - 20 freq swaver (3) - 1 freq slaver (3) - 6 freq syver (3) - 4 freq slavery (4) - 12 freq peever (4) - 1 freq sever (4) - 3 freq solver (4) - 1 freq spair (4) - 1 freq sliver (4) - 8 freq spare (4) - 98 freq spieler (4) - 1 freq speider (4) - 1 freq steiver (4) - 1 freq sper (4) - 1 freq speer (4) - 21 freq spier (4) - 42 freq siever (4) - 2 freq spar (4) - 14 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 |
SPAYVER |
| Time to execute Levenshtein function - 0.297067 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.431920 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.027584 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.037646 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.000818 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. |