| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwaible (0) - 2 freq dwaibly (1) - 9 freq dwaiblie (1) - 15 freq daidle (2) - 2 freq dabble (2) - 2 freq draigle (2) - 1 freq dwaiblin (2) - 1 freq dwadle (2) - 1 freq taible (2) - 2 freq swabble (2) - 1 freq aible (2) - 2 freq wabble (2) - 3 freq dweeble (2) - 3 freq wifle (3) - 1 freq while (3) - 1458 freq bauble (3) - 5 freq risible (3) - 1 freq ible (3) - 1 freq dwallt (3) - 4 freq dweeblie (3) - 1 freq wabbles (3) - 1 freq truible (3) - 1 freq dachle (3) - 1 freq dwainan (3) - 1 freq aidle (3) - 1 freq |
dwaible (0) - 2 freq dwaiblie (1) - 15 freq dwaibly (1) - 9 freq dweeble (2) - 3 freq dwadle (3) - 1 freq dwaiblin (3) - 1 freq dabble (3) - 2 freq dweeblie (3) - 1 freq dwab (4) - 1 freq deeable (4) - 1 freq dwamly (4) - 1 freq dawdle (4) - 10 freq double (4) - 129 freq dooble (4) - 26 freq dwal (4) - 1 freq dubble (4) - 2 freq disable (4) - 1 freq druiblie (4) - 1 freq edible (4) - 3 freq dibble (4) - 1 freq dwall (4) - 10 freq dreeble (4) - 1 freq rewable (4) - 1 freq wabble (4) - 3 freq swabble (4) - 1 freq |
SoundEx code - D140 deeply - 37 freq deeplie - 1 freq dwaiblie - 15 freq double - 129 freq deploy - 4 freq devaul - 9 freq dooble - 26 freq devil - 35 freq duffle - 2 freq doubly - 4 freq dwaibly - 9 freq divvil - 3 freq dwaible - 2 freq devaill - 1 freq 'double - 3 freq dweeblie - 1 freq divvle - 1 freq divil - 17 freq dubble - 2 freq deevil - 17 freq dibble - 1 freq defily - 1 freq dabble - 2 freq doubil - 3 freq divvel - 4 freq devaall - 1 freq develue - 1 freq deval - 4 freq devaal - 5 freq duffel - 2 freq dapple - 2 freq divil' - 1 freq dweeble - 3 freq €˜double - 2 freq €œdouble - 1 freq dfwil - 2 freq dupl - 1 freq deeable - 1 freq diplo - 1 freq dvla - 1 freq |
MetaPhone code - TWBL dwaiblie - 15 freq dwaibly - 9 freq dwaible - 2 freq dweeblie - 1 freq dweeble - 3 freq |
DWAIBLE |
| Time to execute Levenshtein function - 0.222865 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.383116 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.032539 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.037945 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.000867 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. |