| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ambroise (0) - 2 freq amboise (1) - 3 freq ambros (2) - 1 freq embroil (3) - 1 freq embro's (3) - 2 freq brose (3) - 22 freq abuise (3) - 3 freq browse (3) - 3 freq arose (3) - 15 freq improvise (3) - 1 freq brise (3) - 1 freq araise (3) - 1 freq abbswise (3) - 2 freq broose (3) - 1 freq appraise (3) - 1 freq bruise (3) - 15 freq apprise (3) - 1 freq embroiled (3) - 1 freq acrose (3) - 1 freq ameise (3) - 1 freq amorous (3) - 3 freq aboose (3) - 1 freq amyoose (3) - 1 freq embroider (3) - 1 freq arise (3) - 10 freq |
ambroise (0) - 2 freq ambros (2) - 1 freq amboise (2) - 3 freq bruise (4) - 15 freq embryos (4) - 3 freq brouse (4) - 1 freq embrasse (4) - 1 freq morose (4) - 1 freq brise (4) - 1 freq amorous (4) - 3 freq broose (4) - 1 freq brose (4) - 22 freq embro's (4) - 2 freq embroil (4) - 1 freq melrose (5) - 6 freq bros (5) - 1 freq bris (5) - 1 freq umbers (5) - 1 freq marisa (5) - 1 freq ambles (5) - 2 freq umbrage (5) - 1 freq morris (5) - 14 freq embarris (5) - 1 freq melrois (5) - 1 freq embrae (5) - 4 freq |
SoundEx code - A516 anniversary - 28 freq amber - 13 freq anniversiry - 2 freq anniversaries - 1 freq awenbracin - 1 freq anniversery - 1 freq ambroise - 2 freq ambrosianae' - 1 freq anniversarie - 3 freq anniversar - 5 freq amphora - 1 freq €œane-pairty - 1 freq ambros - 1 freq €˜amber - 1 freq aimfor - 2 freq |
MetaPhone code - AMRS aumers - 4 freq americy - 1 freq amorous - 3 freq aumrie's - 1 freq aamers - 1 freq ambroise - 2 freq ambros - 1 freq |
AMBROISE |
| Time to execute Levenshtein function - 0.197649 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.379475 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.027826 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.037014 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.000791 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. |