| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dobson (0) - 4 freq robson (1) - 14 freq gibson (2) - 21 freq bob-on (2) - 1 freq dobbin (2) - 13 freq doesn (2) - 11 freq dowsin (2) - 2 freq dossin (2) - 3 freq boson (2) - 1 freq doosin (2) - 2 freq dolton (2) - 1 freq dosan (2) - 1 freq danson (2) - 1 freq rowson (2) - 2 freq dobson's (2) - 1 freq dousin (2) - 1 freq doon (2) - 6952 freq dodgson (2) - 9 freq damson (2) - 1 freq poison (2) - 28 freq dyson (2) - 1 freq robeson (2) - 1 freq dooron (2) - 5 freq dubbin (3) - 1 freq tomsin (3) - 2 freq |
dobson (0) - 4 freq robson (2) - 14 freq dousin (3) - 1 freq danson (3) - 1 freq dyson (3) - 1 freq robeson (3) - 1 freq doosin (3) - 2 freq damson (3) - 1 freq dosan (3) - 1 freq doesn (3) - 11 freq boson (3) - 1 freq dobbin (3) - 13 freq dowsin (3) - 2 freq gibson (3) - 21 freq dossin (3) - 3 freq dbn (4) - 1 freq doesni (4) - 1 freq ibsen (4) - 2 freq doubtin (4) - 3 freq doesna (4) - 90 freq datsun (4) - 3 freq doublan (4) - 2 freq doublin (4) - 6 freq doosno (4) - 1 freq dansin (4) - 14 freq |
SoundEx code - D125 dobson's - 1 freq dobson - 4 freq devisins - 4 freq devisin - 7 freq defusing - 1 freq division - 17 freq deficiencies - 1 freq deveesion - 1 freq deficient - 3 freq diveesions - 1 freq davison - 1 freq divisions - 8 freq diapason - 1 freq division' - 1 freq dubbieknowe - 2 freq diveision - 1 freq deficient' - 1 freq debasement - 1 freq debasements - 1 freq devosioun - 1 freq dowffsome - 1 freq deveesions - 1 freq davyshanks - 8 freq dvegxynyls - 1 freq davejmcgregor - 16 freq defqmha - 1 freq dafcnews - 1 freq daveshnedders - 1 freq dvkgmdqpco - 1 freq |
MetaPhone code - TBSN dobson - 4 freq |
DOBSON |
| Time to execute Levenshtein function - 0.225883 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.348489 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.027670 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.037625 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.000855 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. |