| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accusinly (0) - 1 freq accusingly (1) - 1 freq accusing (2) - 3 freq cousinly (2) - 1 freq accusin (2) - 7 freq accusit (3) - 1 freq accordinly (3) - 3 freq acquaint (4) - 3 freq accurense (4) - 1 freq scathinly (4) - 1 freq amazinly (4) - 2 freq acutely (4) - 2 freq amusing (4) - 3 freq accursit (4) - 1 freq amusin (4) - 6 freq accoordinly (4) - 1 freq cousin (4) - 100 freq cousin's (4) - 15 freq acyully (4) - 1 freq accepin (4) - 1 freq maccuil (4) - 1 freq actually (4) - 377 freq accuse (4) - 6 freq acutally (4) - 1 freq accuracy (4) - 7 freq |
accusinly (0) - 1 freq accusingly (2) - 1 freq accusin (3) - 7 freq accusing (3) - 3 freq cousinly (3) - 1 freq occasional (5) - 23 freq accordinly (5) - 3 freq accusit (5) - 1 freq focusing (6) - 1 freq occasioned (6) - 1 freq excusin (6) - 1 freq 'cousin' (6) - 1 freq acushla (6) - 1 freq cousins (6) - 46 freq accurately (6) - 5 freq chusin (6) - 4 freq accidently (6) - 1 freq accused (6) - 24 freq crusin (6) - 1 freq accuses (6) - 1 freq occasioun (6) - 2 freq occasionally (6) - 11 freq occasion (6) - 42 freq occasions (6) - 19 freq accessin (6) - 5 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 - AKKSNL accusinly - 1 freq |
ACCUSINLY |
| Time to execute Levenshtein function - 0.242294 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.384455 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.027690 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.037200 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.000905 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. |