| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facetit (0) - 1 freq daetit (2) - 1 freq faintit (2) - 7 freq fackit (2) - 1 freq haetit (2) - 1 freq fleetit (2) - 2 freq facets (2) - 2 freq maetit (2) - 1 freq fautit (2) - 3 freq pactit (2) - 3 freq facelift (2) - 1 freq facet (2) - 1 freq saetit (2) - 1 freq actit (2) - 9 freq lichtit (3) - 64 freq flotit (3) - 1 freq maitit (3) - 1 freq faerie (3) - 8 freq fatst (3) - 1 freq repetit (3) - 1 freq fait (3) - 6 freq faceelity (3) - 1 freq actin (3) - 58 freq taintit (3) - 1 freq dacent (3) - 14 freq |
facetit (0) - 1 freq facets (3) - 2 freq fautit (3) - 3 freq pactit (3) - 3 freq fleetit (3) - 2 freq actit (3) - 9 freq fackit (3) - 1 freq facet (3) - 1 freq faintit (3) - 7 freq recitit (4) - 5 freq locatit (4) - 7 freq facinatit (4) - 1 freq fiytit (4) - 1 freq fittit (4) - 26 freq faction (4) - 3 freq fentit (4) - 3 freq ficets (4) - 1 freq faintet (4) - 6 freq facts (4) - 46 freq factly (4) - 1 freq foostit (4) - 1 freq facultie (4) - 1 freq fett (4) - 1 freq fattie (4) - 2 freq ectit (4) - 1 freq |
SoundEx code - F233 foostit - 1 freq fixated - 5 freq fixted - 1 freq foistit - 1 freq feightit - 1 freq fisted - 1 freq foisted - 1 freq facetit - 1 freq foustit - 1 freq fastidiousness - 1 freq fooshtit - 1 freq fastidious - 1 freq feasted - 2 freq fkjtutlnvr - 5 freq fechted - 1 freq |
MetaPhone code - FSTT foostit - 1 freq visited - 23 freq ghaistit - 1 freq foistit - 1 freq veesitit - 8 freq fisted - 1 freq foisted - 1 freq facetit - 1 freq veisited - 3 freq vestit - 1 freq veesited - 7 freq foustit - 1 freq veisitit - 7 freq vested - 2 freq visitit - 2 freq feasted - 2 freq vísitit - 1 freq |
FACETIT |
| Time to execute Levenshtein function - 0.225321 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.420847 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.029051 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.037774 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.000878 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. |