| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alarm (0) - 41 freq alarum (1) - 1 freq alarmt (1) - 3 freq alarms (1) - 2 freq alairm (1) - 7 freq claem (2) - 2 freq afar (2) - 10 freq amara (2) - 1 freq clara (2) - 9 freq glam (2) - 2 freq alaft (2) - 2 freq foarm (2) - 66 freq alairmt (2) - 1 freq aware (2) - 54 freq clam (2) - 10 freq alaek (2) - 2 freq clare (2) - 12 freq award (2) - 59 freq laam (2) - 1 freq blare (2) - 3 freq slam (2) - 13 freq aar (2) - 5 freq aam (2) - 9 freq garm (2) - 1 freq aaarms (2) - 1 freq |
alarm (0) - 41 freq alairm (1) - 7 freq alarum (1) - 1 freq alarms (2) - 2 freq alarmt (2) - 3 freq airm (3) - 358 freq warm (3) - 355 freq lara (3) - 1 freq lart (3) - 1 freq alamo (3) - 2 freq waarm (3) - 81 freq lars (3) - 1 freq farm (3) - 28 freq harm (3) - 21 freq larn (3) - 16 freq acrm (3) - 1 freq alairms (3) - 10 freq lam (3) - 1 freq arm (3) - 50 freq lark (3) - 23 freq alert (3) - 17 freq ali'm (3) - 1 freq alarmin (3) - 4 freq album (3) - 23 freq lare (3) - 7 freq |
SoundEx code - A465 alarm - 41 freq alarmin - 4 freq aaler'n - 1 freq alairmt - 1 freq alairmed - 2 freq alarms - 2 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 - 41 freq alairm - 7 freq alarum - 1 freq |
ALARM |
| Time to execute Levenshtein function - 0.289932 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.492371 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.028889 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.036835 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.000838 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. |