Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
accusin (0) - 7 freq accusit (1) - 1 freq accusing (1) - 3 freq accursit (2) - 1 freq excusin (2) - 1 freq causin (2) - 14 freq accuses (2) - 1 freq amusin (2) - 6 freq accepin (2) - 1 freq abusin (2) - 4 freq accused (2) - 24 freq cousin (2) - 100 freq chusin (2) - 4 freq accuse (2) - 6 freq focusin (2) - 9 freq crusin (2) - 1 freq accessin (2) - 5 freq accusinly (2) - 1 freq dousin (3) - 1 freq caukin (3) - 1 freq focusing (3) - 1 freq acktin (3) - 1 freq actin (3) - 58 freq alcudia (3) - 1 freq cuin (3) - 8 freq |
accusin (0) - 7 freq accusit (2) - 1 freq accusing (2) - 3 freq accuse (3) - 6 freq chusin (3) - 4 freq crusin (3) - 1 freq accusinly (3) - 1 freq occasion (3) - 42 freq cousin (3) - 100 freq accessin (3) - 5 freq focusin (3) - 9 freq causin (3) - 14 freq accused (3) - 24 freq excusin (3) - 1 freq accuses (3) - 1 freq accepin (3) - 1 freq caasin (4) - 3 freq occupyin (4) - 2 freq occasioun (4) - 2 freq clasin (4) - 1 freq cruisin (4) - 11 freq cursin (4) - 23 freq closin (4) - 27 freq coursin (4) - 1 freq causen (4) - 3 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 - AKKSN accusin - 7 freq |
ACCUSIN |
Time to execute Levenshtein function - 0.187541 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.346696 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.028051 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.039373 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.000948 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. |