Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dealers (0) - 10 freq dealer (1) - 15 freq balers (2) - 1 freq beakers (2) - 1 freq reapers (2) - 2 freq healer (2) - 3 freq dramers (2) - 1 freq sealess (2) - 1 freq drawers (2) - 52 freq beaters (2) - 2 freq dearer (2) - 8 freq whalers (2) - 8 freq teylers (2) - 1 freq meelers (2) - 1 freq deckers (2) - 2 freq tellers (2) - 5 freq desers (2) - 1 freq peelers (2) - 7 freq dealins (2) - 5 freq deafens (2) - 1 freq deeners (2) - 1 freq dra'ers (2) - 2 freq eaters (2) - 2 freq dailers (2) - 2 freq dwallers (2) - 3 freq |
dealers (0) - 10 freq dealer (2) - 15 freq dailers (2) - 2 freq teylers (3) - 1 freq desers (3) - 1 freq meelers (3) - 1 freq dealins (3) - 5 freq feelers (3) - 1 freq deeners (3) - 1 freq dears (3) - 12 freq peelers (3) - 7 freq idlers (3) - 1 freq deals (3) - 18 freq deualess (3) - 1 freq deniers (3) - 4 freq eilers (3) - 1 freq balers (3) - 1 freq dales (3) - 6 freq defers (3) - 1 freq draaers (3) - 3 freq velars (4) - 1 freq dileas (4) - 1 freq declares (4) - 5 freq dowers (4) - 1 freq doublers (4) - 2 freq |
SoundEx code - D462 deleerious - 1 freq dwallers - 3 freq dollars - 7 freq dailers - 2 freq dealers - 10 freq delirious - 3 freq dollarglen - 1 freq dollars- - 1 freq |
MetaPhone code - TLRS tellers - 5 freq deleerious - 1 freq tellaris - 1 freq dollars - 7 freq dailers - 2 freq tellures - 1 freq dealers - 10 freq delirious - 3 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq dollars- - 1 freq tylers - 1 freq tailrace - 1 freq |
DEALERS |
Time to execute Levenshtein function - 0.459795 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.700929 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.027690 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.088829 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.001357 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. |