| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spayver (0) - 2 freq spaver (1) - 3 freq spacer (2) - 2 freq spayce (2) - 2 freq sayven (2) - 1 freq spanner (2) - 11 freq syver (2) - 4 freq slaver (2) - 6 freq spalter (2) - 2 freq spaffer (2) - 1 freq spanker (2) - 1 freq slaiver (2) - 1 freq swaver (2) - 1 freq shaver (2) - 2 freq splyter (2) - 2 freq spaker (2) - 3 freq payer (2) - 1 freq spaeker (2) - 20 freq server (3) - 2 freq palaver (3) - 10 freq soajer (3) - 1 freq claiver (3) - 4 freq paerer (3) - 1 freq salve (3) - 5 freq smawer (3) - 9 freq |
spayver (0) - 2 freq spaver (1) - 3 freq spaker (3) - 3 freq slaiver (3) - 1 freq swaver (3) - 1 freq shaver (3) - 2 freq spaeker (3) - 20 freq syver (3) - 4 freq slaver (3) - 6 freq spacer (3) - 2 freq spiker (4) - 1 freq silver (4) - 121 freq peever (4) - 1 freq speaker (4) - 65 freq speeder (4) - 16 freq siever (4) - 2 freq spare (4) - 100 freq sover (4) - 1 freq steiver (4) - 1 freq slavery (4) - 12 freq sliver (4) - 8 freq spar (4) - 14 freq siver (4) - 2 freq spooner (4) - 1 freq sper (4) - 1 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.335378 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.608902 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.059914 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.089668 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.001107 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. |