| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saucepin (0) - 1 freq saucepins (1) - 1 freq saucepan (1) - 4 freq saucepans (2) - 2 freq accepin (2) - 1 freq sauchin (2) - 1 freq santerin (3) - 1 freq gaupin (3) - 8 freq mauchhin (3) - 1 freq steepin (3) - 7 freq squeelin (3) - 2 freq mauchlin (3) - 13 freq shuchin (3) - 1 freq bauchlin (3) - 1 freq fauchlin (3) - 1 freq laupin (3) - 2 freq saunpit (3) - 3 freq saulin (3) - 2 freq slurpin (3) - 6 freq saemin (3) - 1 freq waukenin (3) - 7 freq scancein (3) - 1 freq accepit (3) - 2 freq saufin (3) - 1 freq laepin (3) - 1 freq |
saucepin (0) - 1 freq saucepan (1) - 4 freq saucepins (2) - 1 freq sauchin (3) - 1 freq accepin (3) - 1 freq saucepans (3) - 2 freq siumpin (4) - 1 freq escapin (4) - 13 freq suckin (4) - 6 freq slepin (4) - 1 freq scoopin (4) - 7 freq suppin (4) - 9 freq sweepin (4) - 15 freq sieepin (4) - 1 freq siepin (4) - 1 freq steepin (4) - 7 freq sleepin (4) - 160 freq seepin (4) - 15 freq sackin (4) - 4 freq souchin (4) - 16 freq scraepin (4) - 1 freq spein (5) - 2 freq swypin (5) - 2 freq scraipin (5) - 1 freq sacan (5) - 1 freq |
SoundEx code - S215 saucepans - 2 freq saucepan - 4 freq sixpence - 7 freq suspended - 14 freq suspension - 9 freq saxophone - 2 freq saxpence - 10 freq sezven - 1 freq saxophin - 1 freq suspinsien - 1 freq suspend - 3 freq saucepins - 1 freq saucepin - 1 freq suspendet - 3 freq suspende - 1 freq saxpenny - 3 freq suspense - 3 freq suspendit - 7 freq suspenders - 3 freq sage-femme - 1 freq €œsaxpence - 1 freq sousafonn - 1 freq sousafon - 1 freq suspentit - 1 freq sycophantic - 1 freq sisyphean - 1 freq sycophancy - 1 freq sexpince - 1 freq suspensions - 2 freq sykvnsgtsw - 1 freq |
MetaPhone code - SSPN saucepan - 4 freq saucepin - 1 freq |
SAUCEPIN |
| Time to execute Levenshtein function - 0.189674 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.361404 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.027687 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.037394 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.000876 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. |