| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laithly (0) - 2 freq daithly (1) - 3 freq laytly (2) - 1 freq faithey (2) - 1 freq lately (2) - 57 freq laith (2) - 25 freq laetly (2) - 2 freq deithly (2) - 1 freq yaishly (2) - 1 freq airthly (2) - 1 freq laistly (2) - 2 freq laithes (2) - 1 freq laithlie (2) - 1 freq earthly (2) - 10 freq laithed (2) - 2 freq lairdly (2) - 2 freq lastly (2) - 5 freq laithfu (2) - 1 freq laither (2) - 2 freq laithery (2) - 1 freq eithly (2) - 2 freq faitly (2) - 2 freq lithy (2) - 1 freq aaftly (3) - 1 freq blately (3) - 2 freq |
laithly (0) - 2 freq daithly (2) - 3 freq laithlie (2) - 1 freq laithed (3) - 2 freq earthly (3) - 10 freq laithfu (3) - 1 freq laithery (3) - 1 freq lythely (3) - 1 freq eithly (3) - 2 freq laithes (3) - 1 freq laither (3) - 2 freq lithy (3) - 1 freq laith (3) - 25 freq lately (3) - 57 freq laytly (3) - 1 freq laetly (3) - 2 freq deithly (3) - 1 freq airthly (3) - 1 freq lithca (4) - 1 freq lathes (4) - 1 freq leith' (4) - 1 freq lethal (4) - 3 freq lithe (4) - 5 freq daithlie (4) - 1 freq little (4) - 421 freq |
SoundEx code - L340 lately - 57 freq ladle - 8 freq little - 421 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 - L0L laithly - 2 freq lythely - 1 freq lethal - 3 freq laithlie - 1 freq |
LAITHLY |
| Time to execute Levenshtein function - 0.214616 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.406326 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.027483 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.037303 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.000870 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. |