| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assessment (0) - 23 freq assessments (1) - 4 freq ameesement (3) - 2 freq assignment (3) - 3 freq plaessment (3) - 1 freq aisement (3) - 2 freq assessin' (3) - 1 freq assessin (3) - 4 freq assessit (3) - 1 freq assessed (3) - 7 freq assortment (3) - 2 freq cressent (4) - 1 freq casement (4) - 3 freq aisment (4) - 1 freq assinments (4) - 1 freq amusement (4) - 6 freq assent (4) - 2 freq chessmen (4) - 3 freq easement (4) - 9 freq harassment (4) - 3 freq assassin (4) - 2 freq adjustment (4) - 1 freq assess (4) - 8 freq arrengment (4) - 1 freq amendment (4) - 3 freq |
assessment (0) - 23 freq assessments (2) - 4 freq assessin (5) - 4 freq assessin' (5) - 1 freq assessit (5) - 1 freq plaessment (5) - 1 freq assignment (5) - 3 freq assortment (5) - 2 freq assassin (6) - 2 freq assassinate (6) - 1 freq harassment (6) - 3 freq assassins (6) - 2 freq assistant (6) - 19 freq assessed (6) - 7 freq aisement (6) - 2 freq ameesement (6) - 2 freq sediment (7) - 2 freq basement (7) - 9 freq segment (7) - 1 freq aveisement (7) - 4 freq aisment (7) - 1 freq plaessments (7) - 2 freq esslemont (7) - 3 freq misssmart (7) - 1 freq missurement (7) - 1 freq |
SoundEx code - A225 accusin - 7 freq aisy-gaun - 1 freq assignations - 1 freq assessin - 4 freq ashkenazi - 1 freq assignment - 3 freq assigned - 6 freq accusing - 3 freq assessment - 23 freq assassination - 5 freq accessin - 5 freq assessments - 4 freq assignit - 1 freq assessin' - 1 freq accessin' - 1 freq assassins - 2 freq a-seekin - 1 freq assassinatit - 1 freq accusingly - 1 freq assassin - 2 freq assassinations - 2 freq accusinly - 1 freq acquiescence - 2 freq assassinate - 1 freq acasayanymare - 1 freq ashashoneill - 1 freq assasinate - 1 freq |
MetaPhone code - ASSMNT assessment - 23 freq |
ASSESSMENT |
| Time to execute Levenshtein function - 0.227487 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.384633 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.028316 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.037512 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.001013 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. |