| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yabbert (0) - 1 freq habbert (1) - 1 freq scabbert (2) - 2 freq yammert (2) - 1 freq hubbert (2) - 1 freq yarbent (2) - 2 freq dabbers (2) - 1 freq halbert (2) - 2 freq habbers (2) - 1 freq larbert (2) - 2 freq lambert (2) - 3 freq albert (2) - 25 freq dabber (2) - 3 freq rubbert (2) - 2 freq jabber (2) - 4 freq 'albert (2) - 1 freq clabbert (2) - 2 freq hubber (3) - 1 freq aert (3) - 45 freq hankert (3) - 1 freq aseert (3) - 1 freq sabbat (3) - 1 freq gilbert (3) - 15 freq bastert (3) - 9 freq yatters (3) - 2 freq |
yabbert (0) - 1 freq habbert (2) - 1 freq albert (3) - 25 freq rubbert (3) - 2 freq hubbert (3) - 1 freq sobert (4) - 1 freq abbot (4) - 5 freq libert (4) - 1 freq bert (4) - 106 freq babbit (4) - 2 freq alberta (4) - 1 freq baitert (4) - 1 freq cubbart (4) - 1 freq robert (4) - 238 freq abort (4) - 3 freq fibert (4) - 2 freq alberto (4) - 2 freq dabbers (4) - 1 freq lambert (4) - 3 freq larbert (4) - 2 freq halbert (4) - 2 freq habbers (4) - 1 freq yarbent (4) - 2 freq dabber (4) - 3 freq yammert (4) - 1 freq |
SoundEx code - Y163 yabbert - 1 freq yfrdjj - 1 freq |
MetaPhone code - YBRT yabbert - 1 freq |
YABBERT |
| Time to execute Levenshtein function - 0.253972 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.669752 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.028892 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.074890 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.000877 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. |