| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fatst (0) - 1 freq matst (1) - 1 freq faist (1) - 29 freq fast (1) - 314 freq faast (1) - 4 freq fats (1) - 2 freq fatsu (1) - 1 freq fautit (2) - 3 freq tatt (2) - 1 freq haust (2) - 3 freq nats (2) - 2 freq matt (2) - 29 freq fauts (2) - 27 freq fatty (2) - 37 freq faat (2) - 15 freq pats (2) - 15 freq hatt (2) - 1 freq feast (2) - 54 freq last (2) - 1873 freq ast (2) - 8 freq 'att (2) - 1 freq fait (2) - 6 freq baist (2) - 80 freq facts' (2) - 1 freq raist (2) - 7 freq |
fatst (0) - 1 freq fatsu (2) - 1 freq fitest (2) - 1 freq faast (2) - 4 freq fats (2) - 2 freq matst (2) - 1 freq fast (2) - 314 freq faist (2) - 29 freq fist (3) - 56 freq fatstuc (3) - 1 freq fitt (3) - 42 freq ferst (3) - 29 freq fett (3) - 1 freq faats (3) - 7 freq jatest (3) - 1 freq frst (3) - 3 freq first (3) - 2518 freq forst (3) - 1 freq frost (3) - 139 freq taist (3) - 2 freq figst (3) - 1 freq fits (3) - 130 freq foust (3) - 1 freq fates (3) - 4 freq filst (3) - 4 freq |
SoundEx code - F323 fidged - 7 freq fitsteps - 18 freq fidgety - 2 freq fidgetin - 5 freq fitstool - 2 freq footsteps - 11 freq fuit-steps - 1 freq fuitsteps - 9 freq fidgit - 3 freq fitstaps - 4 freq fit-sodjers - 1 freq fuitsodgets - 1 freq feetsteps - 1 freq fetched - 8 freq fitsides - 1 freq fatst - 1 freq fidgeted - 2 freq fitsteel - 2 freq fit-stool - 1 freq fidgetry - 1 freq fetchit - 1 freq fidget - 3 freq fitjots - 1 freq fuitstaps - 1 freq fattest - 1 freq fittest - 3 freq fouthiest - 1 freq fitstep - 1 freq fuidstuffs - 1 freq fidgitin - 2 freq fitest - 1 freq fitdyecaat - 1 freq fitstepps - 1 freq foodstorycoffee - 1 freq fitsthescoop - 5 freq fatigued - 1 freq fidgeting - 1 freq fatstuc - 1 freq fadista - 1 freq fatzdomingo - 2 freq |
MetaPhone code - FTST fatst - 1 freq ghettoised - 1 freq fattest - 1 freq fittest - 3 freq fitest - 1 freq fadista - 1 freq |
FATST |
| Time to execute Levenshtein function - 0.320933 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.860913 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.096155 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.046759 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.000877 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. |