| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| robdrummond (0) - 6 freq drummond (3) - 6 freq johnpdrummond (4) - 6 freq drummin (5) - 9 freq robertsons (5) - 1 freq summond (5) - 1 freq roberston (5) - 1 freq mormond (5) - 5 freq reedrimmed (5) - 1 freq redmond (5) - 2 freq drummed (5) - 8 freq drummin' (5) - 2 freq an'drummin' (5) - 1 freq robertson (5) - 75 freq roberton (5) - 49 freq andraemon (6) - 1 freq bumming (6) - 2 freq bycommon (6) - 2 freq road-end (6) - 3 freq common (6) - 301 freq robertson's (6) - 5 freq roadman (6) - 3 freq programmin (6) - 2 freq lomond (6) - 17 freq richmond (6) - 3 freq |
robdrummond (0) - 6 freq drummond (5) - 6 freq reedrimmed (7) - 1 freq drummed (8) - 8 freq an'drummin' (8) - 1 freq drummin' (8) - 2 freq redmond (8) - 2 freq drummin (8) - 9 freq johnpdrummond (8) - 6 freq brammed (9) - 1 freq brimming (9) - 2 freq dromonde (9) - 1 freq brimman (9) - 1 freq dortmund (9) - 1 freq dremmed (9) - 1 freq rebrand (9) - 2 freq recommend (9) - 25 freq brimmed (9) - 4 freq dremmin (9) - 2 freq brammin (9) - 1 freq brimmin (9) - 13 freq robertsons (9) - 1 freq roberton (9) - 49 freq roberston (9) - 1 freq summond (9) - 1 freq |
SoundEx code - R136 riptur - 1 freq revedere - 1 freq rafters - 11 freq ruif-trees - 1 freq refters - 1 freq roof-tree - 1 freq ruptured - 1 freq rafter - 1 freq raptor - 1 freq raptur - 3 freq rabbit-horn - 1 freq ripture - 2 freq riptured - 8 freq riptures - 13 freq robotars - 1 freq rapture - 1 freq raptors - 1 freq rapturous - 1 freq robdrummond - 6 freq |
MetaPhone code - RBTRMNT robdrummond - 6 freq |
ROBDRUMMOND |
| Time to execute Levenshtein function - 0.231337 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.402273 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.028046 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.039081 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.000857 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. |