| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspecks (0) - 26 freq aspects (1) - 24 freq specks (1) - 6 freq aspeck (1) - 13 freq specs (2) - 31 freq expecks (2) - 3 freq spicks (2) - 6 freq specky (2) - 7 freq suspecks (2) - 2 freq snecks (2) - 7 freq speiks (2) - 10 freq pecks (2) - 1 freq secks (2) - 8 freq speaks (2) - 93 freq speck (2) - 12 freq attecks (2) - 1 freq affecks (2) - 6 freq 'speaks (2) - 1 freq sperks (2) - 5 freq aspect (2) - 21 freq respecks (2) - 11 freq copecks (2) - 3 freq aspekts (2) - 1 freq wrecks (3) - 2 freq spek (3) - 1 freq |
aspecks (0) - 26 freq specks (1) - 6 freq spicks (2) - 6 freq aspeck (2) - 13 freq aspects (2) - 24 freq speck (3) - 12 freq speaks (3) - 93 freq respecks (3) - 11 freq copecks (3) - 3 freq pecks (3) - 1 freq sperks (3) - 5 freq secks (3) - 8 freq expecks (3) - 3 freq specs (3) - 31 freq suspecks (3) - 2 freq specky (3) - 7 freq speiks (3) - 10 freq snecks (3) - 7 freq spooks (4) - 1 freq socks (4) - 96 freq auspices (4) - 1 freq spricks (4) - 1 freq stocks (4) - 14 freq smocks (4) - 2 freq sticks (4) - 144 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 - ASPKS aspecks - 26 freq |
ASPECKS |
| Time to execute Levenshtein function - 0.185128 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.349204 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.028391 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.037932 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.000927 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. |