Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
door-gap (0) - 1 freq doorstap (2) - 2 freq door-a (2) - 1 freq doorstep (3) - 17 freq doors-an (3) - 1 freq door-ti (3) - 1 freq door-jamb (3) - 1 freq doorman (3) - 2 freq doorway (3) - 17 freq soor-an (3) - 4 freq organ (4) - 16 freq doon-low (4) - 1 freq doon-deep (4) - 1 freq dodgan (4) - 1 freq doorsteps (4) - 2 freq doorbell (4) - 15 freq door-chik (4) - 1 freq doorstane (4) - 5 freq oora (4) - 1 freq hooligan (4) - 1 freq dooglas (4) - 4 freq droap (4) - 11 freq dorsal (4) - 1 freq oot-tak (4) - 1 freq door (4) - 1906 freq |
door-gap (0) - 1 freq door-a (4) - 1 freq doorstap (4) - 2 freq door-ti (5) - 1 freq doorstep (5) - 17 freq droap (6) - 11 freq drap (6) - 265 freq ruif-gap (6) - 1 freq doo-grey (6) - 1 freq doon-deep (6) - 1 freq door-jamb (6) - 1 freq doorman (6) - 2 freq doorway (6) - 17 freq doors-an (6) - 1 freq soor-an (6) - 4 freq poortugal (7) - 1 freq doori (7) - 1 freq doorwey (7) - 13 freq doogie (7) - 1 freq drop (7) - 39 freq drip (7) - 12 freq drog (7) - 3 freq doon-cry (7) - 1 freq dordogne (7) - 1 freq doorlike (7) - 1 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRKP door-gap - 1 freq |
DOOR-GAP |
Time to execute Levenshtein function - 0.265521 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.407056 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.030166 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.039844 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.001045 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. |