Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
leddylanners (0) - 2 freq leddylanner (1) - 1 freq leidbangers (4) - 2 freq ledders (5) - 2 freq lawlanders (5) - 1 freq planners (5) - 2 freq heilanders (5) - 2 freq ley-lanns (5) - 1 freq lowlanders (5) - 1 freq heid-bangers (5) - 3 freq leddy-fern (5) - 1 freq meddlers (5) - 1 freq learners (5) - 6 freq englanders (5) - 1 freq heidbangers (5) - 1 freq daddylanglegs (5) - 7 freq leanne's (5) - 6 freq leddy-friens (5) - 1 freq headlines (6) - 6 freq complainers (6) - 1 freq bedlaes (6) - 1 freq bedclaes (6) - 12 freq tenners (6) - 4 freq caddlers (6) - 1 freq aeraplanes (6) - 1 freq |
leddylanners (0) - 2 freq leddylanner (2) - 1 freq leidbangers (7) - 2 freq lowlanders (8) - 1 freq meddlers (8) - 1 freq ley-lanns (8) - 1 freq ledders (8) - 2 freq lawlanders (8) - 1 freq planners (8) - 2 freq denners (9) - 11 freq suddenness (9) - 1 freq lslanns (9) - 1 freq hardliners (9) - 1 freq deadline's (9) - 1 freq lipliners (9) - 1 freq landowners (9) - 7 freq dinners (9) - 14 freq caddlers (9) - 1 freq lilyyinnes (9) - 1 freq toddlers (9) - 3 freq suddroners (9) - 1 freq leddy-friens (9) - 1 freq englanders (9) - 1 freq heidbangers (9) - 1 freq learners (9) - 6 freq |
SoundEx code - L345 laithliness - 1 freq littlin - 17 freq laidlin - 1 freq littlins - 25 freq littleins - 1 freq littleens' - 1 freq €œlittlins - 1 freq leddylanners - 2 freq littlin's - 2 freq littlans - 2 freq leddylanner - 1 freq ladelin - 1 freq littlenaughty - 1 freq littlemusic - 4 freq littlemore - 2 freq ladylyonglencoe - 11 freq |
MetaPhone code - LTLNRS leddylanners - 2 freq |
LEDDYLANNERS |
Time to execute Levenshtein function - 0.275511 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.476625 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.034477 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.039047 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.000893 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. |