| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwaiblin (0) - 1 freq dwaiblie (1) - 15 freq wailin (2) - 11 freq warblin (2) - 1 freq driblin (2) - 1 freq dwaibly (2) - 9 freq wamblin (2) - 1 freq dwamlin (2) - 1 freq raiblin (2) - 1 freq dailin (2) - 1 freq dwallin (2) - 15 freq wabblin (2) - 5 freq dwinlin (2) - 2 freq draiglin (2) - 1 freq dwaible (2) - 2 freq dalin (3) - 4 freq dabbin (3) - 8 freq wairin (3) - 1 freq wailin' (3) - 2 freq wastlin (3) - 1 freq bailin (3) - 3 freq haiglin (3) - 3 freq sailin (3) - 38 freq truiblin (3) - 1 freq wairdin (3) - 1 freq |
dwaiblin (0) - 1 freq dwaiblie (2) - 15 freq dwaible (3) - 2 freq dwaibly (3) - 9 freq dwamlin (3) - 1 freq driblin (3) - 1 freq dwallin (3) - 15 freq dwinlin (3) - 2 freq dibblin (4) - 1 freq dublin (4) - 29 freq dreeblin (4) - 3 freq dweeblie (4) - 1 freq dwellin (4) - 4 freq dawdlin (4) - 2 freq doublin (4) - 6 freq dailin (4) - 1 freq wailin (4) - 11 freq raiblin (4) - 1 freq warblin (4) - 1 freq wamblin (4) - 1 freq wabblin (4) - 5 freq draiglin (4) - 1 freq nabblin (5) - 1 freq drawlin (5) - 7 freq swillin (5) - 2 freq |
SoundEx code - D145 doublin - 6 freq dubliners - 2 freq dublin - 29 freq doubling - 1 freq diplomatic - 6 freq diplomatkness - 1 freq diplomaticly - 1 freq divilmint - 2 freq dibblin - 1 freq diploma - 3 freq deevilment - 2 freq dublin' - 1 freq dublin's - 1 freq diplomae - 1 freq doublan - 2 freq double-manned - 1 freq devaalin - 1 freq devilment - 3 freq diplomats - 3 freq devellin - 1 freq deployment - 1 freq double-hauner - 1 freq develing - 1 freq diplomacy - 4 freq dwaiblin - 1 freq diplayin - 1 freq doubleness - 2 freq diplomas - 1 freq doubloons - 1 freq devalna - 1 freq dipolimatic - 1 freq dibble-ennit - 1 freq devlinmartina - 2 freq devlin - 1 freq dublintracey - 1 freq |
MetaPhone code - TWBLN dwaiblin - 1 freq |
DWAIBLIN |
| Time to execute Levenshtein function - 0.196989 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.360918 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.028103 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.037798 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.000909 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. |