Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dublintracey (0) - 1 freq dubliners (5) - 2 freq wulinae (6) - 1 freq dusgrace (6) - 1 freq subtract (6) - 1 freq din-faced (6) - 1 freq obliterate (6) - 1 freq distract (6) - 17 freq blintrin (6) - 1 freq concintrate (6) - 1 freq blindrife (6) - 1 freq bibliography (6) - 3 freq intrae (6) - 1 freq publically (6) - 1 freq duirwey (6) - 1 freq substrate (6) - 2 freq deliberate (6) - 19 freq deliberately (6) - 22 freq wullintlie (6) - 1 freq marktracey (6) - 1 freq unliterally (6) - 1 freq blinter (6) - 2 freq blintered (6) - 2 freq subsistence (6) - 2 freq deliverance (6) - 4 freq |
dublintracey (0) - 1 freq dubliners (7) - 2 freq blintrin (8) - 1 freq blintered (8) - 2 freq blinter (8) - 2 freq literacy (9) - 34 freq dule-tree (9) - 1 freq ballantrae (9) - 1 freq blinterin (9) - 8 freq blinters (9) - 1 freq dublin's (9) - 1 freq dublin' (9) - 1 freq dublin (9) - 29 freq balintore (9) - 1 freq obliterate (9) - 1 freq blindrife (9) - 1 freq blinkered (10) - 1 freq doubling (10) - 1 freq gallantry (10) - 1 freq deviltry (10) - 1 freq dusgrace (10) - 1 freq bluntie (10) - 2 freq blint (10) - 3 freq declinet (10) - 1 freq luntren (10) - 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 - TBLNTRS dublintracey - 1 freq |
DUBLINTRACEY |
Time to execute Levenshtein function - 0.623029 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.764520 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.034295 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.056758 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.001651 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. |