| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dublin (0) - 29 freq dullin (1) - 2 freq doublin (1) - 6 freq dublin' (1) - 1 freq dunlin (1) - 2 freq dubbin (1) - 1 freq surlin (2) - 1 freq dalin (2) - 4 freq blin (2) - 116 freq dublin's (2) - 1 freq rumblin (2) - 12 freq mullin (2) - 3 freq purlin (2) - 1 freq dubbie (2) - 7 freq dustin (2) - 12 freq cuilin (2) - 1 freq outlin (2) - 3 freq derlin (2) - 1 freq hurlin (2) - 21 freq tumlin (2) - 1 freq yulin (2) - 1 freq dibblin (2) - 1 freq publik (2) - 1 freq puhlin (2) - 1 freq dailin (2) - 1 freq |
dublin (0) - 29 freq doublin (1) - 6 freq doublan (2) - 2 freq dubbin (2) - 1 freq dunlin (2) - 2 freq dullin (2) - 2 freq dublin' (2) - 1 freq cablin (3) - 1 freq dellin (3) - 5 freq doubtin (3) - 3 freq dailin (3) - 1 freq dealin (3) - 30 freq devlin (3) - 1 freq 'blin (3) - 1 freq dirlin (3) - 45 freq daelin (3) - 6 freq goblin (3) - 9 freq duellin (3) - 2 freq siblin (3) - 1 freq amblin (3) - 3 freq dobbin (3) - 13 freq doubling (3) - 1 freq driblin (3) - 1 freq dabbin (3) - 8 freq dybin (3) - 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 |
DUBLIN |
| Time to execute Levenshtein function - 0.378872 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.590721 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.029208 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.069939 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.000974 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. |