Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
laxdale (0) - 1 freq ladle (2) - 8 freq axae (3) - 1 freq laddie (3) - 577 freq lad'll (3) - 1 freq saiddle (3) - 6 freq magdala (3) - 1 freq laudably (3) - 1 freq daidle (3) - 2 freq daudle (3) - 1 freq landart (3) - 2 freq landels (3) - 1 freq gandalf (3) - 1 freq paddle (3) - 23 freq sardane (3) - 1 freq turdale (3) - 1 freq dale (3) - 29 freq ladel (3) - 3 freq handle (3) - 36 freq glendale (3) - 3 freq laude (3) - 1 freq landles (3) - 2 freq adae (3) - 139 freq sandal (3) - 1 freq dugdale (3) - 7 freq |
laxdale (0) - 1 freq ladle (3) - 8 freq lapdul (4) - 1 freq liddle (4) - 1 freq ladel (4) - 3 freq dawdle (5) - 10 freq laldee (5) - 1 freq paidle (5) - 1 freq laldie (5) - 7 freq ladled (5) - 2 freq saddle (5) - 9 freq liddel (5) - 2 freq ladle' (5) - 2 freq lawdie (5) - 4 freq vandal (5) - 1 freq aidle (5) - 1 freq lidl (5) - 1 freq lexical (5) - 25 freq axle (5) - 1 freq ladar (5) - 1 freq locale (5) - 1 freq adele (5) - 1 freq eandle (5) - 1 freq lauddie (5) - 4 freq lordlie (5) - 1 freq |
SoundEx code - L234 lestlie - 3 freq lastly - 5 freq lichtly - 15 freq lichtlie - 10 freq licht'll - 2 freq lightly - 7 freq lichtlied - 7 freq listly - 1 freq laistly - 2 freq lichtlins - 1 freq listlessness - 1 freq leukit-like - 1 freq laxdale - 1 freq €˜lichtlie - 1 freq listless - 1 freq liztellsstories - 1 freq lgscotland - 8 freq louisathelast - 1 freq |
MetaPhone code - LKSTL laxdale - 1 freq |
LAXDALE |
Time to execute Levenshtein function - 0.194948 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.358378 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.027669 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.040042 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.001015 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. |