Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
assassination (0) - 6 freq assassinations (1) - 2 freq assassinatit (2) - 1 freq assassinate (3) - 1 freq assasinate (4) - 1 freq association (4) - 44 freq assimilation (4) - 2 freq fascination (4) - 7 freq bastardization (5) - 1 freq imagination (5) - 60 freq dissemination (5) - 1 freq abomination (5) - 5 freq imaagination (5) - 1 freq fescination (5) - 1 freq resuscitation (5) - 1 freq lamination (5) - 1 freq assignations (5) - 1 freq bastardisation (5) - 1 freq €œdestination (5) - 1 freq vaccination (5) - 1 freq associations (5) - 5 freq fascinatin (5) - 16 freq examination (5) - 8 freq classifaction (5) - 1 freq aspiration (5) - 4 freq |
assassination (0) - 6 freq assassinations (2) - 2 freq assassinatit (3) - 1 freq assassinate (4) - 1 freq assasinate (6) - 1 freq dissemination (7) - 1 freq assassin (7) - 2 freq disassociation (7) - 1 freq assimilation (7) - 2 freq association (7) - 44 freq assassins (7) - 2 freq fascination (7) - 7 freq destination (8) - 19 freq assessit (8) - 1 freq assessin' (8) - 1 freq disseminatioun (8) - 1 freq fascinatin (8) - 16 freq assessin (8) - 4 freq associatin (8) - 1 freq dissapintin (8) - 1 freq essention (8) - 1 freq resuscitation (8) - 1 freq assistin (8) - 2 freq assignations (8) - 1 freq fescination (8) - 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 - 6 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 - ASSNXN assassination - 6 freq |
ASSASSINATION |
Time to execute Levenshtein function - 0.234421 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.374586 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.027797 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.037612 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.000918 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. |