Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
guiltless (0) - 1 freq buitless (2) - 1 freq ruitless (2) - 2 freq guidless (2) - 3 freq gutless (2) - 1 freq liltless (2) - 1 freq guiless (2) - 1 freq guidiness (3) - 1 freq wutless (3) - 1 freq gisless (3) - 1 freq yuiseless (3) - 2 freq uissless (3) - 1 freq quietness (3) - 2 freq uiseless (3) - 4 freq shitless (3) - 1 freq guidness (3) - 22 freq muinless (3) - 4 freq hairtless (3) - 2 freq ruifless (3) - 2 freq pointless (3) - 10 freq giless (3) - 4 freq buikless (3) - 1 freq guiltie (3) - 4 freq faultless (3) - 1 freq guiness (3) - 2 freq |
guiltless (0) - 1 freq gutless (3) - 1 freq liltless (3) - 1 freq faultless (4) - 1 freq guiless (4) - 1 freq guidless (4) - 3 freq ruitless (4) - 2 freq buitless (4) - 1 freq guillys (5) - 3 freq hairtless (5) - 2 freq pointless (5) - 10 freq giless (5) - 4 freq shitless (5) - 1 freq listless (5) - 1 freq wutless (5) - 1 freq gisless (5) - 1 freq witless (5) - 6 freq fruitless (5) - 3 freq galleys (6) - 3 freq adultress (6) - 1 freq peitiless (6) - 2 freq unstlass (6) - 3 freq limitless (6) - 1 freq pitiless (6) - 1 freq lairless (6) - 1 freq |
SoundEx code - G434 glottal - 11 freq gledlie - 5 freq gladly - 7 freq glaidly - 2 freq gledly - 5 freq guiltless - 1 freq goldie-leukin - 2 freq glottals - 1 freq gleyt-like - 1 freq €˜goldilocks - 1 freq goldilocks - 1 freq 'glottal - 1 freq |
MetaPhone code - KLTLS cloodless - 3 freq guiltless - 1 freq glottals - 1 freq cloudless - 4 freq |
GUILTLESS |
Time to execute Levenshtein function - 0.224403 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.423396 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.027428 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.039079 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.001183 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. |