Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dazler (0) - 2 freq dailer (1) - 1 freq dazzler (1) - 2 freq caaler (2) - 1 freq dailers (2) - 2 freq raeler (2) - 1 freq hauler (2) - 1 freq dazzled (2) - 2 freq dainer (2) - 5 freq waller (2) - 1 freq dan'er (2) - 1 freq dabber (2) - 3 freq caler (2) - 1 freq dagger (2) - 4 freq darker (2) - 9 freq aaler (2) - 17 freq damper (2) - 3 freq dancer (2) - 30 freq taller (2) - 23 freq daze (2) - 7 freq razer (2) - 1 freq parler (2) - 2 freq dizer (2) - 1 freq dazed (2) - 4 freq daaner (2) - 1 freq |
dazler (0) - 2 freq dazzler (2) - 2 freq dailer (2) - 1 freq duller (3) - 2 freq dealer (3) - 15 freq dueler (3) - 1 freq dirler (3) - 1 freq dizer (3) - 1 freq gahler (4) - 1 freq dauner (4) - 57 freq daiver (4) - 4 freq dafter (4) - 6 freq dales (4) - 6 freq caller (4) - 78 freq dale (4) - 29 freq hazer (4) - 1 freq dater (4) - 1 freq dale' (4) - 1 freq danger (4) - 109 freq darger (4) - 2 freq taaler (4) - 3 freq doubler (4) - 6 freq doobler (4) - 1 freq dollar (4) - 12 freq hazelr (4) - 7 freq |
SoundEx code - D246 declar't - 1 freq declare - 24 freq declaart - 1 freq declares - 5 freq declared - 26 freq declaration - 69 freq declird - 1 freq declir - 1 freq discoloured - 3 freq declarter - 3 freq declartin - 1 freq declarations - 3 freq declarin - 10 freq declaration' - 4 freq declered - 2 freq declarative - 1 freq declarit - 3 freq declaris - 2 freq dazler - 2 freq dazzler - 2 freq declaret - 1 freq declaire - 1 freq declarationofarbroath - 1 freq declaring - 1 freq |
MetaPhone code - TSLR dazler - 2 freq dazzler - 2 freq |
DAZLER |
Time to execute Levenshtein function - 0.459762 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.698559 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.028384 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.086484 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.000843 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. |