Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lauchfully (0) - 1 freq lauchfull (1) - 2 freq lauchfulle (1) - 1 freq lauchful (2) - 2 freq faithfully (3) - 1 freq tactfully (3) - 1 freq lawfully (3) - 3 freq luckully (3) - 1 freq truthfully (3) - 4 freq thochtfully (4) - 5 freq acshully (4) - 3 freq beautifully (4) - 4 freq mournfully (4) - 2 freq forcefully (4) - 4 freq tuinfully (4) - 1 freq cairfully (4) - 4 freq awfully (4) - 12 freq thouchtfully (4) - 3 freq hatefully (4) - 1 freq laughingly (4) - 2 freq playfully (4) - 4 freq gracefully (4) - 6 freq doubtfully (4) - 2 freq auchmill (4) - 3 freq acyully (4) - 1 freq |
lauchfully (0) - 1 freq lauchfulle (1) - 1 freq lauchfull (1) - 2 freq lauchful (3) - 2 freq lawfully (5) - 3 freq lochgelly (5) - 18 freq luckully (5) - 1 freq tactfully (5) - 1 freq faithfully (5) - 1 freq leafully (6) - 1 freq lauchabil (6) - 2 freq auchmill (6) - 3 freq carefully (6) - 40 freq fethfully (6) - 1 freq peacefully (6) - 4 freq leidfully (6) - 1 freq lauchable- (6) - 1 freq truthfully (6) - 4 freq richtfully (6) - 1 freq lichfield (6) - 1 freq cairfully (6) - 4 freq painfully (7) - 11 freq dutifully (7) - 3 freq manfully (7) - 1 freq truchbull (7) - 1 freq |
SoundEx code - L214 lichfield - 1 freq legpullin - 1 freq likeable - 2 freq leg-bail - 1 freq lik'able - 1 freq legible - 3 freq lauchabil - 2 freq lauchfully - 1 freq lauchfulle - 1 freq lauchful - 2 freq lauchfull - 2 freq laich-flett - 1 freq ljubljana - 1 freq lauchable- - 1 freq lqbal - 2 freq lisafaulkner - 1 freq lisboalions - 1 freq ljployalist - 1 freq laughable - 1 freq |
MetaPhone code - LXFL lauchfully - 1 freq lauchfulle - 1 freq lauchful - 2 freq lauchfull - 2 freq |
LAUCHFULLY |
Time to execute Levenshtein function - 0.291233 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.431799 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.032146 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.043908 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.001177 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. |