Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
doublan (0) - 2 freq doublin (1) - 6 freq doubles (2) - 11 freq doubly (2) - 4 freq doublt (2) - 2 freq dublin (2) - 29 freq outlan (2) - 2 freq doubtin (2) - 3 freq doubling (2) - 1 freq doubled (2) - 7 freq douglas (2) - 270 freq doubler (2) - 6 freq double (2) - 129 freq couldn (3) - 3 freq houlin (3) - 21 freq moulin (3) - 1 freq outland (3) - 2 freq outlaun (3) - 1 freq uplan (3) - 4 freq doutna (3) - 1 freq dodgan (3) - 1 freq doubil (3) - 3 freq dourles (3) - 4 freq coupla (3) - 12 freq doungang (3) - 1 freq |
doublan (0) - 2 freq doublin (1) - 6 freq dublin (2) - 29 freq doubling (3) - 1 freq double (3) - 129 freq doubtin (3) - 3 freq doubler (3) - 6 freq doubled (3) - 7 freq doubles (3) - 11 freq doubly (3) - 4 freq doublt (3) - 2 freq dullin (4) - 2 freq doodlin (4) - 2 freq dunblane (4) - 4 freq doobled (4) - 4 freq dubbin (4) - 1 freq dirlan (4) - 3 freq doobles (4) - 2 freq dobbin (4) - 13 freq driblin (4) - 1 freq dibblin (4) - 1 freq dylan (4) - 15 freq doubloons (4) - 1 freq dooble (4) - 26 freq dillan (4) - 1 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 - TBLN doublin - 6 freq dublin - 29 freq dibblin - 1 freq dublin' - 1 freq doublan - 2 freq |
DOUBLAN |
Time to execute Levenshtein function - 0.216094 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.368605 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.029773 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.038582 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.001019 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. |