Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
outfits (0) - 2 freq ootfits (1) - 4 freq outfit (1) - 9 freq outlets (2) - 1 freq outins (2) - 1 freq outlins (2) - 2 freq ootfit (2) - 12 freq outwith (2) - 9 freq moutains (3) - 1 freq cutlets (3) - 3 freq pouties (3) - 1 freq puffins (3) - 5 freq optit (3) - 1 freq lufts (3) - 2 freq outhir (3) - 1 freq doutis (3) - 1 freq buttit (3) - 4 freq profits (3) - 17 freq ootlins (3) - 3 freq coutts (3) - 1 freq ruttit (3) - 3 freq nuthins (3) - 1 freq puttit (3) - 1 freq outset (3) - 1 freq outling (3) - 2 freq |
outfits (0) - 2 freq ootfits (1) - 4 freq outfit (2) - 9 freq tufts (3) - 2 freq ootfit (3) - 12 freq outlets (3) - 1 freq fuits (4) - 2 freq twits (4) - 1 freq tits (4) - 33 freq ootfaws (4) - 1 freq taits (4) - 1 freq befits (4) - 3 freq ootsets (4) - 6 freq ootlets (4) - 6 freq outwith (4) - 9 freq outins (4) - 1 freq lufts (4) - 2 freq fits (4) - 130 freq ootlats (4) - 2 freq thits (4) - 1 freq outlins (4) - 2 freq yettis (5) - 1 freq softies (5) - 2 freq texts (5) - 101 freq trots (5) - 3 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 - OTFTS ootfits - 4 freq outfits - 2 freq |
OUTFITS |
Time to execute Levenshtein function - 0.211814 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.360371 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.027702 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.041160 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.001092 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. |