| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sax-fit (0) - 1 freq six-fit (1) - 2 freq saufit (2) - 1 freq baa-pit (3) - 2 freq sait (3) - 8 freq stuffit (3) - 1 freq sainit (3) - 1 freq saughit (3) - 1 freq -fit (3) - 1 freq haffit (3) - 1 freq saatit (3) - 1 freq sauft (3) - 1 freq saft (3) - 293 freq wauffit (3) - 1 freq 'f-fit (3) - 1 freq sackit (3) - 1 freq axfil (3) - 1 freq salvit (3) - 1 freq saxtie (3) - 6 freq sniffit (3) - 9 freq saggit (3) - 1 freq sailit (3) - 10 freq sattit (3) - 1 freq saaft (3) - 5 freq stair-fit (3) - 1 freq |
sax-fit (0) - 1 freq six-fit (1) - 2 freq six-feet (3) - 1 freq six-foot (3) - 1 freq saufit (4) - 1 freq snaa-fite (4) - 1 freq stair-fit (5) - 1 freq saxtie (5) - 6 freq saaft (5) - 5 freq bare-fit (5) - 5 freq re-fit (5) - 1 freq sci-fi (5) - 2 freq saxt (5) - 8 freq twa-fit (5) - 1 freq stairfit (5) - 1 freq sniffit (5) - 9 freq -fit (5) - 1 freq saft (5) - 293 freq sauft (5) - 1 freq stuffit (5) - 1 freq ten-fit (5) - 1 freq 'f-fit (5) - 1 freq soft (6) - 52 freq snufft (6) - 2 freq scrift (6) - 2 freq |
SoundEx code - S213 saggy-bawed - 1 freq six-fit - 2 freq sauch-patternt - 1 freq six-fit-four - 3 freq six-foot - 1 freq seeck-beds - 1 freq six-feet - 1 freq shoogie-boats - 1 freq suackbuts - 1 freq seik-bed - 1 freq sax-fit - 1 freq suspetioun - 1 freq suspeitioun - 1 freq susbtrate - 1 freq susceptible - 3 freq sesspit - 1 freq |
MetaPhone code - SKSFT six-fit - 2 freq six-foot - 1 freq six-feet - 1 freq sax-fit - 1 freq |
SAX-FIT |
| Time to execute Levenshtein function - 0.305998 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.565906 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.035670 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.065031 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.000871 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. |