| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assassinate (0) - 1 freq assasinate (1) - 1 freq assassinatit (2) - 1 freq assassination (3) - 6 freq assassins (3) - 2 freq assassin (3) - 2 freq passionate (4) - 6 freq assessin' (4) - 1 freq assimilate (4) - 1 freq assessit (4) - 1 freq assessin (4) - 4 freq associate (4) - 15 freq assassinations (4) - 2 freq dispassionate (4) - 1 freq associated (5) - 10 freq slainte (5) - 3 freq salivate (5) - 1 freq castigate (5) - 1 freq associat (5) - 1 freq disseminate (5) - 2 freq aspirate (5) - 1 freq sassidge (5) - 6 freq sassanach (5) - 1 freq assimilated (5) - 2 freq laminate (5) - 2 freq |
assassinate (0) - 1 freq assasinate (2) - 1 freq assassinatit (3) - 1 freq assassins (4) - 2 freq assassin (4) - 2 freq assassination (4) - 6 freq assessit (5) - 1 freq assessin' (5) - 1 freq assessin (5) - 4 freq assessment (6) - 23 freq assassinations (6) - 2 freq assistant (6) - 19 freq dispassionate (6) - 1 freq passionate (6) - 6 freq assistin (7) - 2 freq assint (7) - 1 freq paissionate (7) - 1 freq disassociate (7) - 1 freq assistance (7) - 10 freq disseminate (7) - 2 freq assistants (7) - 3 freq assailant (7) - 1 freq assistit (7) - 1 freq associate (7) - 15 freq assimilate (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 - 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 - ASSNT assassinate - 1 freq assasinate - 1 freq |
ASSASSINATE |
| Time to execute Levenshtein function - 0.350616 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.535990 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.057472 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.037000 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.000907 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. |