| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceps (0) - 1 freq accepp (1) - 3 freq accep (1) - 12 freq accepts (1) - 6 freq accept (1) - 76 freq access (1) - 74 freq accepps (1) - 1 freq acres (2) - 24 freq acceese (2) - 2 freq aces (2) - 5 freq scheps (2) - 2 freq acce (2) - 1 freq ceps (2) - 1 freq accede (2) - 1 freq abcess (2) - 2 freq ackers (2) - 16 freq accent (2) - 116 freq accepit (2) - 2 freq ace's (2) - 1 freq accepte (2) - 1 freq biceps (2) - 6 freq aches (2) - 10 freq accepin (2) - 1 freq accents (2) - 29 freq acers (2) - 1 freq |
acceps (0) - 1 freq access (2) - 74 freq accepps (2) - 1 freq accept (2) - 76 freq accepts (2) - 6 freq accepp (2) - 3 freq accep (2) - 12 freq ceps (3) - 1 freq accepit (3) - 2 freq accies (3) - 2 freq accepte (3) - 1 freq accepin (3) - 1 freq acceese (3) - 2 freq biceps (3) - 6 freq coops (4) - 1 freq crops (4) - 19 freq coups (4) - 2 freq chops (4) - 17 freq conceps (4) - 4 freq corps (4) - 13 freq creeps (4) - 16 freq caups (4) - 6 freq craps (4) - 16 freq taecups (4) - 1 freq ccp (4) - 3 freq |
SoundEx code - A212 aspeck - 13 freq aspects - 24 freq aspect - 21 freq aesop's - 4 freq aspecks - 26 freq agivey's - 1 freq aesophagus - 1 freq auspices - 1 freq asbestos - 9 freq aissy-faced - 1 freq aesopic - 1 freq achieves - 1 freq acceps - 1 freq accepps - 1 freq aspekts - 1 freq aeyxfjl - 1 freq azbfszi - 1 freq aaxvihswu - 1 freq aeisfpcnst - 1 freq akvx - 1 freq azbffk - 1 freq ajvcnhvhjb - 1 freq aogkibkef - 1 freq akbvsdogc - 1 freq |
MetaPhone code - AKSPS acceps - 1 freq accepps - 1 freq |
ACCEPS |
| Time to execute Levenshtein function - 0.223608 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.362416 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.027564 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.037924 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.000904 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. |