| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| database (0) - 25 freq airbase (3) - 1 freq ragabash (3) - 5 freq databanks (3) - 1 freq fanbase (3) - 1 freq alabast (3) - 1 freq disabuse (3) - 2 freq abase (3) - 1 freq data-bank (3) - 1 freq dalaman (4) - 1 freq carapace (4) - 1 freq daads (4) - 1 freq dabs (4) - 5 freq draaback (4) - 2 freq darnae (4) - 5 freq baabie (4) - 21 freq daars (4) - 1 freq calabar (4) - 1 freq draabak (4) - 1 freq dats (4) - 21 freq aranese (4) - 1 freq arase (4) - 1 freq satan's (4) - 5 freq daadle (4) - 1 freq disabused (4) - 2 freq |
database (0) - 25 freq disabuse (4) - 2 freq dabs (5) - 5 freq datfs (5) - 1 freq fitbas (5) - 1 freq daubs (5) - 1 freq dats (5) - 21 freq dates (5) - 36 freq patubs (5) - 1 freq stabs (5) - 9 freq databanks (5) - 1 freq date's (5) - 3 freq airbase (5) - 1 freq fanbase (5) - 1 freq dat's (5) - 97 freq tabs (5) - 4 freq abase (5) - 1 freq details (5) - 70 freq sitable (6) - 2 freq dats (6) - 5 freq tamas (6) - 4 freq dbis (6) - 1 freq disaise (6) - 2 freq atlas (6) - 28 freq matisse (6) - 1 freq |
SoundEx code - D312 deid-box - 1 freq datfs - 1 freq database - 25 freq dotheboys - 1 freq dodefoxpodcast - 5 freq |
MetaPhone code - TTBS database - 25 freq |
DATABASE |
| Time to execute Levenshtein function - 0.210241 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.435877 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.031108 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.037725 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.000829 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. |