| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lauchfulle (0) - 1 freq lauchfully (1) - 1 freq lauchfull (1) - 2 freq lauchful (2) - 2 freq lauchabil (4) - 2 freq dauchle (4) - 2 freq tactfully (4) - 1 freq auchmill (4) - 3 freq watchful (4) - 2 freq lauchable- (4) - 1 freq rauchle (4) - 8 freq lucille (4) - 2 freq pauchle (4) - 20 freq truchbull (4) - 1 freq faithfully (4) - 1 freq truthfully (4) - 4 freq luckully (4) - 1 freq wauchle (4) - 4 freq laughable (4) - 1 freq bauchle (4) - 26 freq lawfully (4) - 3 freq bauchlie (4) - 1 freq lochgelly (5) - 18 freq latchie (5) - 7 freq fauchled (5) - 1 freq |
lauchfulle (0) - 1 freq lauchfull (1) - 2 freq lauchfully (1) - 1 freq lauchful (3) - 2 freq lucille (6) - 2 freq luckully (6) - 1 freq faithfully (6) - 1 freq lauchable- (6) - 1 freq lochgelly (6) - 18 freq auchmill (6) - 3 freq lauchabil (6) - 2 freq lichfield (6) - 1 freq tactfully (6) - 1 freq lawfully (6) - 3 freq moothfull (7) - 1 freq landfill (7) - 1 freq richtfully (7) - 1 freq cairfully (7) - 4 freq jchelle (7) - 1 freq schull (7) - 1 freq peacefullie (7) - 1 freq carefully (7) - 40 freq carefullie (7) - 1 freq licht'll (7) - 2 freq fethfully (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 |
LAUCHFULLE |
| Time to execute Levenshtein function - 0.208420 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.386813 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.030356 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.040537 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.000858 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. |