| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saasages (0) - 2 freq sassages (1) - 4 freq sausages (1) - 25 freq saasage (1) - 8 freq sausage (2) - 45 freq massages (2) - 1 freq savages (2) - 8 freq sassage (2) - 5 freq sausage' (2) - 1 freq saasidges (2) - 1 freq passages (2) - 8 freq aaaaages (2) - 1 freq passage (3) - 60 freq savage (3) - 18 freq waadges (3) - 1 freq saaces (3) - 1 freq messages (3) - 148 freq smashes (3) - 1 freq stanage (3) - 2 freq signages (3) - 2 freq packages (3) - 1 freq caases (3) - 3 freq haalage (3) - 1 freq aaaaagees (3) - 1 freq yaisage (3) - 4 freq |
saasages (0) - 2 freq sausages (1) - 25 freq sassages (2) - 4 freq saasage (2) - 8 freq saasidges (3) - 1 freq passages (3) - 8 freq sausage' (3) - 1 freq sausage (3) - 45 freq massages (3) - 1 freq savages (3) - 8 freq sages (4) - 1 freq saasers (4) - 1 freq stages (4) - 16 freq usages (4) - 1 freq messages (4) - 148 freq sasuge (4) - 1 freq sashes (4) - 3 freq aaaaages (4) - 1 freq sassage (4) - 5 freq assumes (5) - 4 freq yaasss (5) - 1 freq assails (5) - 2 freq massage (5) - 17 freq aussies (5) - 1 freq yaaaasss (5) - 2 freq |
SoundEx code - S222 sassages - 4 freq sausages - 25 freq saasages - 2 freq skeich-geeglin - 1 freq successes - 6 freq sook-sooksookin - 1 freq sh-sh-sh-shewin - 2 freq suksesis - 1 freq sgojicegc - 1 freq sykeqhs - 1 freq |
MetaPhone code - SSJS sassages - 4 freq sausages - 25 freq saasages - 2 freq sassidges - 1 freq saasidges - 1 freq |
SAASAGES |
| Time to execute Levenshtein function - 0.192834 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.360052 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.027553 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.038107 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.000875 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. |