| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accuses (0) - 1 freq accusers (1) - 2 freq accuse (1) - 6 freq accused (1) - 24 freq accured (2) - 1 freq causes (2) - 23 freq accies (2) - 2 freq accause (2) - 9 freq access (2) - 73 freq accusin (2) - 7 freq accusit (2) - 1 freq abuses (2) - 4 freq acause (2) - 299 freq focuses (2) - 2 freq excuses (2) - 24 freq acuse (2) - 1 freq cruises (3) - 5 freq clusks (3) - 1 freq closes (3) - 27 freq crises (3) - 1 freq courses (3) - 13 freq acres (3) - 24 freq schules (3) - 3 freq refuses (3) - 17 freq caused (3) - 78 freq |
accuses (0) - 1 freq access (2) - 73 freq accused (2) - 24 freq accuse (2) - 6 freq accusers (2) - 2 freq accusin (3) - 7 freq excuses (3) - 24 freq focuses (3) - 2 freq accusit (3) - 1 freq accause (3) - 9 freq accies (3) - 2 freq causes (3) - 23 freq chases (4) - 7 freq excuises (4) - 5 freq acoss (4) - 1 freq abcess (4) - 2 freq accaised (4) - 1 freq bicuss (4) - 1 freq casses (4) - 1 freq curses (4) - 8 freq eccies (4) - 3 freq caucasus (4) - 1 freq actoss (4) - 1 freq crocuses (4) - 2 freq cases (4) - 54 freq |
SoundEx code - A222 assizes - 2 freq associe's - 1 freq accuses - 1 freq associes - 5 freq axcizojvhk - 1 freq |
MetaPhone code - AKKSS accuses - 1 freq |
ACCUSES |
| Time to execute Levenshtein function - 0.227425 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.423717 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.029181 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.037391 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.000792 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. |