| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| outfit (0) - 9 freq ootfit (1) - 12 freq outfits (1) - 2 freq output (2) - 2 freq outin (2) - 4 freq routit (2) - 1 freq outwi (2) - 1 freq unfit (2) - 1 freq outset (2) - 1 freq puffit (2) - 3 freq loutit (2) - 3 freq ootpit (2) - 28 freq wudfit (2) - 2 freq outwith (2) - 9 freq optit (2) - 1 freq ruttit (2) - 3 freq outlet (2) - 3 freq cuttit (2) - 21 freq oubit (2) - 2 freq outlin (2) - 3 freq doutit (2) - 4 freq outhir (2) - 1 freq ootfits (2) - 4 freq putit (2) - 2 freq moutit (2) - 1 freq |
outfit (0) - 9 freq ootfit (1) - 12 freq outfits (2) - 2 freq tuft (3) - 1 freq ootfits (3) - 4 freq outlet (3) - 3 freq ootpit (3) - 28 freq outset (3) - 1 freq lufit (3) - 1 freq unfit (3) - 1 freq output (3) - 2 freq thit (4) - 568 freq tounfuit (4) - 2 freq infit (4) - 1 freq fit (4) - 3811 freq oooft (4) - 4 freq tuimit (4) - 3 freq tit (4) - 26 freq luift (4) - 3 freq taft (4) - 1 freq ostoft (4) - 1 freq oaft (4) - 6 freq tufty (4) - 1 freq tfi (4) - 2 freq buft (4) - 1 freq |
SoundEx code - O313 ootpit - 28 freq output - 2 freq oot-tapped - 1 freq ootfit - 12 freq ootfits - 4 freq outfit - 9 freq ootpittin - 5 freq oot-aboot - 1 freq out-pittin - 1 freq outfits - 2 freq ootput - 2 freq €œoot-patriotic - 1 freq otbudckhw - 1 freq |
MetaPhone code - OTFT ootfit - 12 freq outfit - 9 freq |
OUTFIT |
| Time to execute Levenshtein function - 0.200604 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.341222 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.030498 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.037663 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.000933 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. |