| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| derekbateman (0) - 2 freq dreaman (5) - 2 freq draeman (5) - 4 freq deebaiten (5) - 1 freq derekjames (5) - 1 freq sereaman (5) - 1 freq breathan (6) - 4 freq newstatesman (6) - 4 freq freeman (6) - 3 freq dereliction (6) - 1 freq draemin (6) - 4 freq dreamin (6) - 38 freq derogatin (6) - 1 freq desecration (6) - 2 freq debaiten (6) - 1 freq batman (6) - 5 freq desecrate (6) - 1 freq neesteran (6) - 1 freq delegatin (6) - 1 freq wisebaldman (6) - 1 freq derken (6) - 1 freq defeated (6) - 7 freq burkeman (6) - 1 freq breadman (6) - 1 freq presbyterian (6) - 19 freq |
derekbateman (0) - 2 freq deebaiten (8) - 1 freq derekjames (8) - 1 freq draeman (8) - 4 freq dreaman (8) - 2 freq derken (9) - 1 freq derivation (9) - 2 freq debatin (9) - 3 freq kirkbean (9) - 2 freq dothebartman (9) - 1 freq presbyterian (9) - 19 freq derekweston (9) - 5 freq batman (9) - 5 freq darkenan (9) - 1 freq burkeman (9) - 1 freq verbatim (9) - 3 freq dereliction (9) - 1 freq draughtsman (9) - 1 freq sereaman (9) - 1 freq dreamin (9) - 38 freq draemin (9) - 4 freq debaiten (9) - 1 freq derogatin (9) - 1 freq dervtn (10) - 1 freq doricbananaman (10) - 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 - TRKBTMN derekbateman - 2 freq |
DEREKBATEMAN |
| Time to execute Levenshtein function - 0.215390 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.417381 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.034762 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.037878 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.000895 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. |