| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dazler (0) - 2 freq dazzler (1) - 2 freq dailer (1) - 1 freq daled (2) - 5 freq dale (2) - 29 freq dainer (2) - 5 freq dazzled (2) - 2 freq danser (2) - 1 freq waller (2) - 1 freq dabber (2) - 3 freq dales (2) - 6 freq dafter (2) - 6 freq daze (2) - 7 freq dauner (2) - 57 freq dale' (2) - 1 freq danger (2) - 110 freq taaler (2) - 3 freq tazper (2) - 1 freq daiver (2) - 4 freq dancer (2) - 31 freq daiker (2) - 2 freq daener (2) - 2 freq taller (2) - 24 freq darker (2) - 9 freq darger (2) - 2 freq |
dazler (0) - 2 freq dailer (2) - 1 freq dazzler (2) - 2 freq dizer (3) - 1 freq dealer (3) - 15 freq dirler (3) - 1 freq duller (3) - 2 freq dueler (3) - 1 freq sadler (4) - 1 freq dagger (4) - 4 freq caller (4) - 80 freq dailers (4) - 2 freq dander (4) - 61 freq sazleh (4) - 1 freq auler (4) - 17 freq baler (4) - 4 freq dazed (4) - 4 freq aller (4) - 2 freq aaler (4) - 17 freq hauler (4) - 1 freq hazle (4) - 1 freq doubler (4) - 6 freq xzlr (4) - 1 freq dlir (4) - 1 freq doobler (4) - 1 freq |
SoundEx code - D246 declar't - 1 freq declare - 25 freq declaart - 1 freq declares - 5 freq declared - 26 freq declaration - 69 freq declarin - 13 freq declird - 1 freq declir - 1 freq discoloured - 3 freq declarter - 3 freq declartin - 1 freq declarations - 3 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.280035 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.522177 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.033193 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.044702 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.001101 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. |