| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assassination (0) - 5 freq assassinations (1) - 2 freq assassinatit (2) - 1 freq assassinate (3) - 1 freq assasinate (4) - 1 freq fascination (4) - 6 freq association (4) - 43 freq assimilation (4) - 2 freq resuscitation (5) - 1 freq destination (5) - 17 freq assignations (5) - 1 freq dissemination (5) - 1 freq classifaction (5) - 1 freq associatin (5) - 1 freq assassins (5) - 2 freq €œdestination (5) - 1 freq associations (5) - 5 freq imagination (5) - 56 freq abomination (5) - 5 freq deracination (5) - 1 freq fescination (5) - 1 freq disassociation (5) - 1 freq lamination (5) - 1 freq bastardisation (5) - 1 freq fascinatin (5) - 16 freq |
assassination (0) - 5 freq assassinations (2) - 2 freq assassinatit (3) - 1 freq assassinate (4) - 1 freq assasinate (6) - 1 freq disassociation (7) - 1 freq assassin (7) - 2 freq dissemination (7) - 1 freq association (7) - 43 freq fascination (7) - 6 freq assassins (7) - 2 freq assimilation (7) - 2 freq assessin' (8) - 1 freq fascinatin (8) - 16 freq assessin (8) - 4 freq disseminatioun (8) - 1 freq assistin (8) - 2 freq assessit (8) - 1 freq fescination (8) - 1 freq dissapintin (8) - 1 freq essention (8) - 1 freq destination (8) - 17 freq associatin (8) - 1 freq assignations (8) - 1 freq resuscitation (8) - 1 freq |
SoundEx code - A225 accusin - 7 freq aisy-gaun - 1 freq assignations - 1 freq assessin - 4 freq ashkenazi - 1 freq assignment - 4 freq assigned - 6 freq accusing - 3 freq assassination - 5 freq accessin - 5 freq assessment - 21 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 - ASSNXN assassination - 5 freq |
ASSASSINATION |
| Time to execute Levenshtein function - 0.223868 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.386773 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.027511 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.037440 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.000849 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. |