Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
alairm (0) - 7 freq alarm (1) - 42 freq alairmt (1) - 1 freq alairms (1) - 10 freq clair (2) - 56 freq gairm (2) - 4 freq alain (2) - 8 freq fairm (2) - 126 freq awaird (2) - 2 freq alarum (2) - 1 freq tairm (2) - 13 freq blaim (2) - 1 freq chairm (2) - 11 freq lairs (2) - 15 freq alaine (2) - 1 freq ali'm (2) - 1 freq thairm (2) - 3 freq acair (2) - 1 freq lairt (2) - 5 freq alarms (2) - 3 freq alairmed (2) - 2 freq clairt (2) - 5 freq airm (2) - 358 freq apairt (2) - 197 freq blair (2) - 62 freq |
alairm (0) - 7 freq alarm (1) - 42 freq alarum (2) - 1 freq alairmt (2) - 1 freq alairms (2) - 10 freq airm (3) - 358 freq lairt (3) - 5 freq alarms (3) - 3 freq alairmed (3) - 2 freq lairn (3) - 134 freq wairm (3) - 46 freq laird (3) - 173 freq lair (3) - 58 freq alarmt (3) - 3 freq hairm (3) - 63 freq ali'm (3) - 1 freq fairm (3) - 126 freq tairm (3) - 13 freq lairs (3) - 15 freq gairm (3) - 4 freq feirm (4) - 4 freq lark (4) - 24 freq lara (4) - 1 freq lard (4) - 4 freq waarm (4) - 81 freq |
SoundEx code - A465 alarm - 42 freq alarmin - 4 freq aaler'n - 1 freq alairmt - 1 freq alairmed - 2 freq alarms - 3 freq allermuir - 1 freq alairm - 7 freq all-roonder - 1 freq alairms - 10 freq alarm's - 1 freq alarmed - 1 freq €˜alarming - 1 freq allourin - 1 freq alarum - 1 freq alarmt - 3 freq allierenison - 1 freq ayelairnin - 1 freq |
MetaPhone code - ALRM alarm - 42 freq alairm - 7 freq alarum - 1 freq |
ALAIRM |
Time to execute Levenshtein function - 0.209166 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.343881 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.027654 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.038043 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.000903 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. |