| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| derekofhighbury (0) - 1 freq dereksmithblues (7) - 1 freq gregorhepburn (8) - 8 freq derogatory (8) - 1 freq firefighters (8) - 1 freq derekcorner (9) - 1 freq dereeshion (9) - 4 freq ceremonious (9) - 1 freq eurofishers (9) - 1 freq deeficulty (9) - 3 freq rashieburn (9) - 1 freq feeltheburn (9) - 2 freq forefaithers (9) - 5 freq territury (9) - 1 freq berkshire (9) - 4 freq drookithoor (9) - 1 freq forefaither (9) - 1 freq neighbours (9) - 45 freq ueweaoijur (9) - 1 freq depository (9) - 2 freq gordonhepburn (9) - 1 freq neighbour (9) - 42 freq milehiguy (9) - 1 freq ceremoniously (9) - 3 freq hereditary (9) - 4 freq |
derekofhighbury (0) - 1 freq dereksmithblues (12) - 1 freq drkkhgagrj (13) - 1 freq drookithoor (13) - 1 freq derogatory (13) - 1 freq firefighters (13) - 1 freq dark-hair (14) - 1 freq forefaither (14) - 1 freq dreicher (14) - 1 freq neighbor (14) - 2 freq neighbour (14) - 42 freq berkshire (14) - 4 freq derekcorner (14) - 1 freq gregorhepburn (14) - 8 freq doughboys (15) - 2 freq derk-haired (15) - 1 freq deckchair (15) - 2 freq nighber (15) - 7 freq granfither (15) - 1 freq deekthejoiner (15) - 8 freq sky-high (15) - 2 freq granfaither (15) - 38 freq drudgery (15) - 3 freq forefinger (15) - 8 freq dryborough (15) - 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 - TRKFHFBR derekofhighbury - 1 freq |
DEREKOFHIGHBURY |
| Time to execute Levenshtein function - 0.495619 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 - 1.070345 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.034188 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.088488 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.000913 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. |