Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
docknail's (2) - 1 freq cocktail (2) - 21 freq doornail (2) - 1 freq dockit (3) - 4 freq vockal (3) - 1 freq toenail (3) - 1 freq dovetail (3) - 1 freq macsnail (3) - 4 freq dockra (3) - 1 freq hobnail (3) - 2 freq lockal (3) - 1 freq dockyaird (3) - 1 freq rockall (3) - 1 freq cocktails (3) - 9 freq donal (3) - 7 freq locail (3) - 44 freq dockin (3) - 3 freq donnal (3) - 1 freq rockit (4) - 4 freq hockit (4) - 3 freq hotmail (4) - 3 freq donald (4) - 193 freq tookna (4) - 1 freq vocal (4) - 10 freq dochtie (4) - 3 freq |
docknail's (4) - 1 freq doornail (4) - 1 freq dockin (4) - 3 freq cocktail (4) - 21 freq dockit (5) - 4 freq deckin (5) - 2 freq dickin (5) - 3 freq dockens (5) - 5 freq jackoneil (5) - 1 freq dockins (5) - 1 freq docken (5) - 30 freq donal (5) - 7 freq donnal (5) - 1 freq vockal (5) - 1 freq dockra (5) - 1 freq macsnail (5) - 4 freq lockal (5) - 1 freq rockall (5) - 1 freq duckin (5) - 3 freq dockyaird (5) - 1 freq decking (6) - 1 freq cockney (6) - 8 freq nickname (6) - 15 freq docks (6) - 27 freq mockin (6) - 11 freq |
SoundEx code - D254 dismal - 5 freq docknail's - 1 freq decimalisation - 1 freq diagonal - 3 freq disneyland - 11 freq decimal - 1 freq diagonally - 1 freq |
MetaPhone code - TKNL diagonal - 3 freq diagonally - 1 freq |
DOCKNAIL |
Time to execute Levenshtein function - 0.218536 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.420777 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.030335 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.037237 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.000876 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. |