| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albert (0) - 25 freq albeit (1) - 6 freq halbert (1) - 2 freq alert (1) - 17 freq 'albert (1) - 1 freq albertz (1) - 4 freq alberta (1) - 1 freq alberto (1) - 2 freq awbeit (2) - 8 freq libert (2) - 1 freq allest (2) - 1 freq scalbert (2) - 1 freq abeit (2) - 1 freq aldest (2) - 1 freq lambert (2) - 3 freq angert (2) - 16 freq allers (2) - 1 freq apaert (2) - 2 freq robert (2) - 237 freq abort (2) - 3 freq arbeit (2) - 1 freq assert (2) - 7 freq albeid (2) - 1 freq aller (2) - 1 freq alder (2) - 1 freq |
albert (0) - 25 freq alberta (1) - 1 freq alberto (1) - 2 freq alert (2) - 17 freq libert (2) - 1 freq albeit (2) - 6 freq halbert (2) - 2 freq 'albert (2) - 1 freq albertz (2) - 4 freq filbert (3) - 3 freq abort (3) - 3 freq liberty (3) - 31 freq robert (3) - 237 freq larbert (3) - 2 freq loert (3) - 2 freq alreet (3) - 3 freq gilbert (3) - 15 freq albeest (3) - 1 freq sobert (3) - 1 freq fibert (3) - 2 freq lambert (3) - 3 freq bert (3) - 104 freq berty (4) - 3 freq lart (4) - 1 freq roberto (4) - 2 freq |
SoundEx code - A416 aal-farrant - 3 freq 'albert - 1 freq aulfarrent - 1 freq alfresco - 3 freq albrecht - 1 freq aul-farrant - 4 freq alfred - 12 freq albert - 25 freq albert's - 2 freq allover - 3 freq alberto - 2 freq alberta - 1 freq €™aal-farrant - 1 freq alford - 4 freq albertz - 4 freq albertina - 1 freq alfordbrad - 32 freq allfreezehahahahahaha - 1 freq allforaurora - 2 freq alfrescodent - 1 freq albertkirkjr - 1 freq |
MetaPhone code - ALBRT 'albert - 1 freq albert - 25 freq alberto - 2 freq alberta - 1 freq |
ALBERT |
| Time to execute Levenshtein function - 0.391420 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.718830 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.080393 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.088983 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.000874 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. |