Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
daniels (0) - 1 freq daniel (1) - 128 freq daniel's (1) - 17 freq danielb (1) - 1 freq daniela (1) - 2 freq dancers (2) - 37 freq damies (2) - 1 freq panels (2) - 15 freq cannels (2) - 4 freq davie's (2) - 36 freq diels (2) - 2 freq dantes (2) - 1 freq danes (2) - 2 freq daniella (2) - 1 freq dasies (2) - 1 freq dances (2) - 43 freq davies (2) - 13 freq daies (2) - 2 freq danders (2) - 8 freq hansels (2) - 3 freq lanies (2) - 1 freq rankels (2) - 1 freq ransels (2) - 1 freq sannels (2) - 1 freq landels (2) - 1 freq |
daniels (0) - 1 freq daniel (2) - 128 freq danielb (2) - 1 freq daniela (2) - 2 freq daniel's (2) - 17 freq daels (3) - 9 freq dances (3) - 43 freq denies (3) - 12 freq dandies (3) - 15 freq daniella (3) - 1 freq deanies (3) - 1 freq danielle (3) - 1 freq deniers (3) - 4 freq panels (3) - 15 freq diels (3) - 2 freq danes (3) - 2 freq dantes (3) - 1 freq canals (4) - 3 freq deils (4) - 35 freq danns (4) - 1 freq dinless (4) - 1 freq danss (4) - 2 freq haunels (4) - 1 freq dansis (4) - 3 freq dreels (4) - 11 freq |
SoundEx code - D542 doon-leukin - 1 freq daniel's - 17 freq demolished - 9 freq demolish - 2 freq doon-licht - 1 freq daniels - 1 freq dwinnles - 1 freq doon-lookin - 1 freq dounluik - 1 freq demolishin - 1 freq dinnles - 1 freq dinless - 1 freq dwaamie-like - 1 freq doun-luikin - 1 freq demolishit - 1 freq dimoleish - 1 freq dimoleished - 1 freq dimoleishin - 1 freq dawnleslie - 14 freq doonlock - 1 freq danieljohnsonuk - 1 freq |
MetaPhone code - TNLS tunnels - 11 freq daniel's - 17 freq tuneless - 2 freq daniels - 1 freq taenails - 2 freq tunnel's - 1 freq dinnles - 1 freq dinless - 1 freq teenless - 1 freq tonnels - 1 freq |
DANIELS |
Time to execute Levenshtein function - 0.217053 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.406445 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.030205 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.038506 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.001097 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. |