Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dwellin-place (0) - 9 freq dwallin-place (1) - 1 freq beeryin-place (4) - 1 freq sleepin-place (4) - 1 freq meetin-place (4) - 1 freq beerying-place (5) - 1 freq trystin-place (5) - 1 freq ill-place (5) - 2 freq weill-placed (5) - 1 freq twelve-pack (6) - 1 freq tellin-aff (6) - 1 freq dwellins (6) - 1 freq dillie-like (6) - 2 freq ill-plece (6) - 1 freq mercat-place (6) - 1 freq well-paid (6) - 1 freq weeyin-life (6) - 1 freq dwellin (6) - 4 freq doll-face (6) - 1 freq dwellings (6) - 1 freq willintlie (6) - 2 freq dwelling (6) - 2 freq wark-place (6) - 1 freq wullintlie (6) - 1 freq deil-lake (6) - 1 freq |
dwellin-place (0) - 9 freq dwallin-place (1) - 1 freq sleepin-place (7) - 1 freq weill-placed (8) - 1 freq ill-place (8) - 2 freq meetin-place (8) - 1 freq beeryin-place (8) - 1 freq ill-plece (9) - 1 freq trystin-place (9) - 1 freq dwellings (10) - 1 freq doll-face (10) - 1 freq willintlie (10) - 2 freq dwelling (10) - 2 freq wark-place (10) - 1 freq wullintlie (10) - 1 freq dwellin (10) - 4 freq dwellins (10) - 1 freq beerying-place (10) - 1 freq wellplayed (10) - 1 freq dillie-like (10) - 2 freq well-paid (10) - 1 freq allangprice (11) - 1 freq dwallin (11) - 15 freq wullintly (11) - 1 freq dwallins (11) - 3 freq |
SoundEx code - D451 dwallin-place - 1 freq dwellin-place - 9 freq dylanbhoy - 2 freq dialmformurdo - 1 freq |
MetaPhone code - TWLNPLS dwallin-place - 1 freq dwellin-place - 9 freq |
DWELLIN-PLACE |
Time to execute Levenshtein function - 0.217893 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.397490 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.027167 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.039088 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.000862 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. |