| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspeck (0) - 13 freq aspect (1) - 21 freq aspecks (1) - 26 freq speck (1) - 12 freq aspen (2) - 9 freq spick (2) - 95 freq sheck (2) - 1 freq steck (2) - 1 freq seeck (2) - 23 freq aspects (2) - 24 freq sneck (2) - 41 freq aleck (2) - 2 freq suspeck (2) - 4 freq specks (2) - 6 freq specky (2) - 5 freq asper- (2) - 1 freq 'speak (2) - 8 freq sperk (2) - 3 freq specs (2) - 28 freq spack (2) - 7 freq expeck (2) - 53 freq seck (2) - 16 freq skeck (2) - 14 freq affeck (2) - 7 freq inspeck (2) - 2 freq |
aspeck (0) - 13 freq speck (1) - 12 freq specky (2) - 5 freq spack (2) - 7 freq spick (2) - 95 freq aspect (2) - 21 freq aspecks (2) - 26 freq skeck (3) - 14 freq expeck (3) - 53 freq inspeck (3) - 2 freq seck (3) - 16 freq speik (3) - 52 freq spetk (3) - 1 freq spek (3) - 1 freq specs (3) - 28 freq peck (3) - 20 freq respeck (3) - 77 freq speak (3) - 551 freq espece (3) - 1 freq spacky (3) - 1 freq steck (3) - 1 freq sheck (3) - 1 freq sperk (3) - 3 freq sneck (3) - 41 freq seeck (3) - 23 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 - ASPK aspeck - 13 freq |
ASPECK |
| Time to execute Levenshtein function - 0.183733 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.396902 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.066851 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.064990 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.001103 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. |