| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mcrobert (0) - 1 freq robert (2) - 238 freq 'robert (2) - 1 freq €œrobert (2) - 1 freq scalbert (3) - 1 freq €˜roberto (3) - 2 freq larbert (3) - 2 freq octobers (3) - 1 freq marbelt (3) - 1 freq sobert (3) - 1 freq cowert (3) - 2 freq scabbert (3) - 2 freq mertert (3) - 1 freq mogert (3) - 1 freq murthert (3) - 9 freq october (3) - 88 freq roberto (3) - 2 freq membert (3) - 3 freq herbert (3) - 1 freq acrobat (3) - 3 freq covert (3) - 39 freq murdert (3) - 11 freq roberts (3) - 1 freq moger (4) - 1 freq murmelt (4) - 2 freq |
mcrobert (0) - 1 freq 'robert (4) - 1 freq €œrobert (4) - 1 freq robert (4) - 238 freq roberto (5) - 2 freq mertert (5) - 1 freq membert (5) - 3 freq murdert (5) - 11 freq scabbert (5) - 2 freq macroidart (5) - 1 freq acrobat (5) - 3 freq herbert (5) - 1 freq marbelt (5) - 1 freq €˜roberto (5) - 2 freq larbert (5) - 2 freq scalbert (5) - 1 freq crabbit (6) - 107 freq cubbart (6) - 1 freq crabit (6) - 1 freq merriet (6) - 39 freq murriet (6) - 1 freq mirrort (6) - 1 freq murmurt (6) - 3 freq corbett (6) - 7 freq mariboro (6) - 1 freq |
SoundEx code - M261 miserable - 57 freq meiserable - 1 freq meeserable - 6 freq meesrable - 2 freq microwave - 16 freq microphone - 5 freq micrawave - 1 freq mïserable - 1 freq meeserably - 1 freq microwaves - 2 freq 'microwave' - 2 freq 'microwave - 1 freq micro-press - 2 freq misrepresents - 1 freq mockrife - 1 freq mockrife-like - 1 freq misrepresentation - 1 freq mcrobert - 1 freq microphones - 1 freq mokryfe - 1 freq misreportit - 1 freq meisurable - 2 freq micrawaved - 2 freq magggerafelt - 1 freq mackerafelt - 1 freq miserably - 3 freq microbrewery - 1 freq macarifdn - 2 freq mycarpetsfecked - 1 freq |
MetaPhone code - MKRBRT mcrobert - 1 freq |
MCROBERT |
| Time to execute Levenshtein function - 0.272887 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.606849 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.064289 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.067159 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.000888 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. |