Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootskirts (0) - 10 freq outskirts (1) - 6 freq ootfits (3) - 4 freq ootsmert (3) - 1 freq ootsets (3) - 6 freq aetshirts (3) - 2 freq wotsits (3) - 1 freq ootgairth (3) - 6 freq skirts (3) - 26 freq ootsite (3) - 1 freq ootshines (3) - 1 freq skirps (4) - 3 freq motorists (4) - 3 freq ootlets (4) - 6 freq scotswirds (4) - 1 freq oobits (4) - 5 freq consaits (4) - 20 freq ootskailin (4) - 1 freq ootsheens (4) - 1 freq optimists (4) - 2 freq ootside (4) - 635 freq wotsit (4) - 1 freq ooirs (4) - 2 freq ootbursts (4) - 1 freq ootins (4) - 2 freq |
ootskirts (0) - 10 freq outskirts (1) - 6 freq aetshirts (4) - 2 freq skirts (4) - 26 freq ootsets (5) - 6 freq skarts (5) - 3 freq ootsmert (5) - 1 freq shirts (6) - 21 freq miniskirts (6) - 1 freq skirls (6) - 16 freq skirt's (6) - 1 freq boskers (6) - 2 freq weskits (6) - 1 freq ootsiders (6) - 4 freq t-shirts (6) - 11 freq bastirts (6) - 1 freq tairts (6) - 5 freq stairts (6) - 46 freq tooskit (6) - 1 freq skirps (6) - 3 freq skirt (6) - 56 freq ootshines (6) - 1 freq ootgairth (6) - 6 freq ootsite (6) - 1 freq ootfits (6) - 4 freq |
SoundEx code - O326 outskirts - 6 freq ootgairth - 6 freq ootcrops - 1 freq ootskirts - 10 freq ootgrowin - 1 freq odgers - 1 freq ootgrowthe - 1 freq outcrop - 1 freq outcry - 1 freq outsourcin - 1 freq ootcry - 1 freq outgrown - 1 freq |
MetaPhone code - OTSKRTS outskirts - 6 freq ootskirts - 10 freq |
OOTSKIRTS |
Time to execute Levenshtein function - 0.275112 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.487021 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.031980 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.044246 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.000936 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. |