| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albrecht (0) - 1 freq arecht (2) - 1 freq alricht (2) - 4 freq brecht (2) - 2 freq bricht (3) - 436 freq strecht (3) - 143 freq 'strecht (3) - 1 freq lecht (3) - 3 freq alright (3) - 21 freq abiech (3) - 3 freq albeit (3) - 6 freq abject (3) - 1 freq aricht (3) - 71 freq awricht (3) - 85 freq broecht (3) - 1 freq a'richt (3) - 8 freq recht (3) - 10 freq albert (3) - 25 freq liecht (3) - 1 freq alicht (3) - 14 freq aircht (3) - 1 freq aaricht (3) - 35 freq fleecht (3) - 3 freq brocht (3) - 730 freq albeest (3) - 1 freq |
albrecht (0) - 1 freq brecht (3) - 2 freq alricht (3) - 4 freq broecht (4) - 1 freq brocht (4) - 730 freq upbrocht (4) - 1 freq inbrocht (4) - 5 freq arecht (4) - 1 freq bricht (4) - 436 freq aaricht (5) - 35 freq aircht (5) - 1 freq alicht (5) - 14 freq breachit (5) - 1 freq lecht (5) - 3 freq aa'richt (5) - 1 freq awericht (5) - 2 freq broucht (5) - 13 freq liecht (5) - 1 freq aricht (5) - 71 freq alright (5) - 21 freq albert (5) - 25 freq awricht (5) - 85 freq recht (5) - 10 freq a'richt (5) - 8 freq strecht (5) - 143 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 - ALBRXT albrecht - 1 freq |
ALBRECHT |
| Time to execute Levenshtein function - 0.215421 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.387067 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.032304 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.042135 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.001238 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. |