| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assinments (0) - 1 freq assignment (2) - 3 freq assessments (3) - 4 freq argiments (3) - 3 freq amenments (3) - 1 freq argiements (3) - 11 freq adornments (3) - 1 freq attainments (3) - 1 freq agiements (3) - 1 freq assistants (3) - 3 freq ailments (3) - 9 freq allotments (4) - 1 freq apairtments (4) - 2 freq pigments (4) - 1 freq airguments (4) - 2 freq abuliments (4) - 1 freq assortment (4) - 2 freq assizes (4) - 2 freq ailmints (4) - 1 freq parliaments (4) - 10 freq arguments (4) - 23 freq appintmints (4) - 2 freq aisement (4) - 2 freq apartments (4) - 2 freq testaments (4) - 4 freq |
assinments (0) - 1 freq assignment (4) - 3 freq adornments (5) - 1 freq attainments (5) - 1 freq amenments (5) - 1 freq assessments (5) - 4 freq assistants (5) - 3 freq moniments (6) - 5 freq vestments (6) - 1 freq amusements (6) - 2 freq testaments (6) - 4 freq sediments (6) - 1 freq segments (6) - 2 freq agiements (6) - 1 freq ailments (6) - 9 freq argiments (6) - 3 freq argiements (6) - 11 freq asserts (7) - 1 freq shipment (7) - 1 freq intments (7) - 1 freq airgiements (7) - 1 freq assessment (7) - 23 freq ornaments (7) - 13 freq intents (7) - 2 freq assistant (7) - 19 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - ASNMNTS assinments - 1 freq |
ASSINMENTS |
| Time to execute Levenshtein function - 0.209896 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.348478 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.027630 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.037185 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.000924 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. |