Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootput (0) - 2 freq ootpit (1) - 28 freq output (1) - 2 freq ooprt (2) - 1 freq hotpot (2) - 1 freq ootset (2) - 15 freq ootpost (2) - 1 freq rotgut (2) - 1 freq ootlat (2) - 6 freq ootrun (2) - 3 freq ootht (2) - 4 freq ootlet (2) - 4 freq ootfit (2) - 12 freq ootcum (2) - 20 freq 'out (3) - 2 freq nottit (3) - 3 freq ootlin (3) - 12 freq toppit (3) - 1 freq dotit (3) - 1 freq oomph (3) - 4 freq wotsit (3) - 1 freq ooty (3) - 21 freq soapt (3) - 1 freq ootz (3) - 1 freq oxtert (3) - 6 freq |
ootput (0) - 2 freq ootpit (1) - 28 freq output (1) - 2 freq ootht (3) - 4 freq ootlet (3) - 4 freq ytpyt (3) - 1 freq ootfit (3) - 12 freq ootlat (3) - 6 freq ootset (3) - 15 freq ootpost (3) - 1 freq hotpot (3) - 1 freq 'put (4) - 5 freq onpit (4) - 1 freq loopit (4) - 1 freq outlet (4) - 3 freq thut (4) - 29 freq totue (4) - 1 freq ootgait (4) - 1 freq kaput (4) - 1 freq ootgate (4) - 1 freq tipt (4) - 1 freq taepot (4) - 1 freq opt (4) - 2 freq soupit (4) - 4 freq poopit (4) - 4 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 - OTPT ootpit - 28 freq output - 2 freq ootput - 2 freq |
OOTPUT |
Time to execute Levenshtein function - 0.253171 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.344887 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.027226 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.037249 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.000903 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. |