Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
outing (0) - 2 freq outin (1) - 4 freq outling (1) - 2 freq touting (1) - 1 freq outins (1) - 1 freq hunting (2) - 10 freq outgoing (2) - 1 freq luving (2) - 1 freq cutting (2) - 16 freq rating (2) - 1 freq ting (2) - 49 freq ruling (2) - 1 freq fouling (2) - 1 freq owning (2) - 1 freq costing (2) - 1 freq huving (2) - 1 freq louring (2) - 1 freq posting (2) - 6 freq oftin (2) - 1 freq gutting (2) - 1 freq ottin (2) - 1 freq mating (2) - 1 freq suiting (2) - 1 freq loutin (2) - 3 freq offing (2) - 1 freq |
outing (0) - 2 freq ting (2) - 49 freq outins (2) - 1 freq touting (2) - 1 freq outling (2) - 2 freq eating (2) - 18 freq outin (2) - 4 freq ootins (3) - 2 freq tinge (3) - 4 freq dating (3) - 8 freq taing (3) - 10 freq outen (3) - 7 freq tong (3) - 6 freq booting (3) - 2 freq buying (3) - 13 freq tng (3) - 1 freq biting (3) - 1 freq owing (3) - 2 freq quoting (3) - 3 freq using (3) - 35 freq teng (3) - 1 freq acting (3) - 12 freq tuning (3) - 3 freq toung (3) - 7 freq onyting (3) - 1 freq |
SoundEx code - O352 othings - 1 freq outins - 1 freq ootmaist - 14 freq odin's - 2 freq owdience - 10 freq ootmest - 1 freq outing - 2 freq outainsells - 1 freq ootins - 2 freq otinnies - 1 freq odinsbudgie - 1 freq ohtmezpccx - 1 freq |
MetaPhone code - OTNK outing - 2 freq |
OUTING |
Time to execute Levenshtein function - 0.327680 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.511186 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.035856 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.037764 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.000808 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. |