| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspects (0) - 24 freq aspekts (1) - 1 freq aspecks (1) - 26 freq aspect (1) - 21 freq ashets (2) - 14 freq specs (2) - 31 freq speats (2) - 1 freq affects (2) - 10 freq asserts (2) - 1 freq speets (2) - 2 freq specks (2) - 6 freq sects (2) - 2 freq expects (2) - 6 freq assets (2) - 15 freq aspeck (2) - 13 freq respects (2) - 8 freq suspects (2) - 4 freq inspects (2) - 1 freq asset (3) - 8 freq spewes (3) - 1 freq respect (3) - 163 freq appert (3) - 1 freq alec's (3) - 8 freq spots (3) - 31 freq directs (3) - 6 freq |
aspects (0) - 24 freq aspekts (2) - 1 freq aspect (2) - 21 freq aspecks (2) - 26 freq sects (3) - 2 freq expects (3) - 6 freq specks (3) - 6 freq suspects (3) - 4 freq respects (3) - 8 freq inspects (3) - 1 freq speets (3) - 2 freq speats (3) - 1 freq specs (3) - 31 freq spoots (4) - 12 freq spreits (4) - 2 freq impacts (4) - 1 freq species (4) - 47 freq auspices (4) - 1 freq splats (4) - 3 freq picts (4) - 42 freq spectre (4) - 4 freq spicks (4) - 6 freq sports (4) - 63 freq spaces (4) - 19 freq spectres (4) - 2 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 - ASPKTS aspects - 24 freq aspekts - 1 freq |
ASPECTS |
| Time to execute Levenshtein function - 0.192232 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.337901 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.027367 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.037236 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.003824 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. |