| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| little-wee (0) - 5 freq littlemore (3) - 2 freq little-read (3) - 1 freq little-kent (3) - 1 freq little-' (3) - 3 freq littler (4) - 1 freq dlittleglen (4) - 1 freq nettle-bed (4) - 3 freq pittenweem (4) - 12 freq kittlesome (4) - 8 freq littleens' (4) - 1 freq battle-axe (4) - 1 freq fittaedee (4) - 1 freq littlelou (4) - 1 freq littleoggiee (4) - 1 freq mickle-ee (4) - 1 freq littleins (4) - 1 freq little (4) - 408 freq turtle-we (4) - 3 freq littered (4) - 9 freq lime-tree (5) - 1 freq liltless (5) - 1 freq fit'-ee (5) - 1 freq kittle (5) - 43 freq bide-awee (5) - 1 freq |
little-wee (0) - 5 freq little-' (4) - 3 freq littlemore (5) - 2 freq little-read (5) - 1 freq littlelou (6) - 1 freq littleoggiee (6) - 1 freq little (6) - 408 freq turtle-we (6) - 3 freq battle-axe (6) - 1 freq littleins (6) - 1 freq littler (6) - 1 freq little-kent (6) - 1 freq littleens' (7) - 1 freq lyttle's (7) - 2 freq littilest (7) - 1 freq littlin (7) - 17 freq lyttle (7) - 2 freq littlins (7) - 25 freq littered (7) - 9 freq littlans (7) - 2 freq kittlesome (7) - 8 freq nettle-bed (7) - 3 freq mettlesome (8) - 2 freq littie (8) - 1 freq tattie-bye (8) - 1 freq |
SoundEx code - L340 lately - 57 freq ladle - 8 freq little - 408 freq liddell - 4 freq little-' - 3 freq loodly - 11 freq ladle' - 2 freq loudly - 27 freq litill - 1 freq laithly - 2 freq lad'l - 1 freq laytly - 1 freq loddie'll - 1 freq liddel - 2 freq lythely - 1 freq lethal - 3 freq leetle - 2 freq lïttle - 2 freq laithlie - 1 freq 'little - 1 freq lad'll - 1 freq lyttle - 2 freq littil - 8 freq laetly - 2 freq lidl - 1 freq leitil - 1 freq lhttle - 1 freq little-wee - 5 freq laidlaw - 3 freq ladywell - 2 freq liddle - 1 freq littill - 1 freq ladel - 3 freq ldl - 2 freq |
MetaPhone code - LTLW little-wee - 5 freq |
LITTLE-WEE |
| Time to execute Levenshtein function - 0.385396 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.609641 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.028994 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.078219 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.000788 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. |