| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fixated (0) - 5 freq fixted (1) - 1 freq fisted (2) - 1 freq fited (2) - 1 freq dilated (2) - 1 freq fitted (2) - 27 freq pirated (2) - 1 freq inated (2) - 1 freq floated (2) - 14 freq fated (2) - 1 freq fixed (2) - 71 freq stoated (3) - 3 freq fainted (3) - 4 freq gifted (3) - 8 freq finshed (3) - 1 freq animated (3) - 5 freq fitage (3) - 1 freq pleated (3) - 5 freq sighted (3) - 2 freq fiat (3) - 3 freq filter (3) - 5 freq fates (3) - 4 freq fiyiten (3) - 1 freq dichted (3) - 16 freq grated (3) - 1 freq |
fixated (0) - 5 freq fixted (1) - 1 freq floated (3) - 14 freq fixed (3) - 71 freq fitted (3) - 27 freq fated (3) - 1 freq fisted (3) - 1 freq fited (3) - 1 freq exited (4) - 1 freq foisted (4) - 1 freq farted (4) - 3 freq fluted (4) - 1 freq flaited (4) - 1 freq fauted (4) - 1 freq fleeted (4) - 3 freq footed (4) - 1 freq fixit (4) - 7 freq fixation (4) - 1 freq feasted (4) - 2 freq inated (4) - 1 freq pirated (4) - 1 freq dilated (4) - 1 freq flyted (4) - 2 freq texted (4) - 4 freq fainted (4) - 4 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 - FKSTT fixated - 5 freq fixted - 1 freq |
FIXATED |
| Time to execute Levenshtein function - 0.203659 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.407627 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.027260 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.036850 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.000850 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. |