| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootfits (0) - 4 freq ootfit (1) - 12 freq outfits (1) - 2 freq ootsite (2) - 1 freq outfit (2) - 9 freq ootfaws (2) - 1 freq oobits (2) - 5 freq ootins (2) - 2 freq ootsets (2) - 6 freq wotsits (2) - 1 freq comfits (2) - 6 freq ootwith (2) - 15 freq ootpit (2) - 28 freq ootlins (2) - 3 freq ootlats (2) - 2 freq ootlets (2) - 6 freq ootgies (2) - 1 freq rootit (3) - 8 freq ootgate (3) - 1 freq ootside (3) - 635 freq orbits (3) - 1 freq optit (3) - 1 freq ootrin (3) - 1 freq €˜fits (3) - 1 freq ootrels (3) - 18 freq |
ootfits (0) - 4 freq outfits (1) - 2 freq ootfit (2) - 12 freq ootlats (3) - 2 freq ootlets (3) - 6 freq ootsets (3) - 6 freq outfit (3) - 9 freq ootfaws (3) - 1 freq lofts (4) - 1 freq twits (4) - 1 freq befits (4) - 3 freq foties (4) - 6 freq thits (4) - 1 freq outlets (4) - 1 freq tits (4) - 33 freq tufts (4) - 2 freq fits (4) - 130 freq totties (4) - 8 freq taits (4) - 1 freq comfits (4) - 6 freq ootpit (4) - 28 freq ootlins (4) - 3 freq wotsits (4) - 1 freq ootins (4) - 2 freq ootsite (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 - OTFTS ootfits - 4 freq outfits - 2 freq |
OOTFITS |
| Time to execute Levenshtein function - 0.210394 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.373078 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.027861 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.038120 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.005849 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. |