| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| devellin (0) - 1 freq levellin (1) - 5 freq revellin (1) - 3 freq levellin' (2) - 3 freq dwellin (2) - 4 freq deelin (2) - 1 freq develing (2) - 1 freq developin (2) - 36 freq duellin (2) - 2 freq retellin (2) - 4 freq dellin (2) - 5 freq devlin (2) - 1 freq devaalin (2) - 1 freq eveluin (2) - 1 freq trevellin (2) - 21 freq resellin (2) - 1 freq revealin (2) - 14 freq devolvin (2) - 2 freq repellin (2) - 2 freq deveron (3) - 1 freq revoltin (3) - 1 freq trevelin (3) - 4 freq unveilin (3) - 1 freq rellin (3) - 1 freq dealin (3) - 30 freq |
devellin (0) - 1 freq levellin (2) - 5 freq revellin (2) - 3 freq dellin (3) - 5 freq devlin (3) - 1 freq duellin (3) - 2 freq devaalin (3) - 1 freq devolvin (3) - 2 freq developin (3) - 36 freq dwellin (3) - 4 freq raivellin (4) - 1 freq devillok (4) - 1 freq drillin (4) - 13 freq levellin' (4) - 3 freq dullin (4) - 2 freq devalled (4) - 1 freq diallin (4) - 4 freq divulgin (4) - 1 freq dwallin (4) - 15 freq develing (4) - 1 freq trevellin (4) - 21 freq eveluin (4) - 1 freq retellin (4) - 4 freq resellin (4) - 1 freq repellin (4) - 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 - TFLN devaalin - 1 freq devellin - 1 freq devalna - 1 freq devlin - 1 freq teflon - 2 freq |
DEVELLIN |
| Time to execute Levenshtein function - 0.420276 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.591236 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.065982 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.043495 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.000859 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. |