| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aftwhiles (0) - 3 freq aftfiles (2) - 1 freq a-while (3) - 2 freq awhyles (3) - 1 freq a while (3) - 1 freq €œwhiles (3) - 4 freq awhile (3) - 15 freq aft-times (3) - 10 freq afttimes (3) - 2 freq whiles (3) - 479 freq 'whiles (3) - 2 freq aftimes (3) - 11 freq while' (4) - 1 freq 'while (4) - 1 freq €˜while (4) - 1 freq safties (4) - 6 freq awaites (4) - 1 freq twilts (4) - 1 freq ootshines (4) - 1 freq €œwhyles (4) - 1 freq while (4) - 1458 freq arteries (4) - 5 freq files (4) - 111 freq afentimes (4) - 1 freq antonines (4) - 1 freq |
aftwhiles (0) - 3 freq aftfiles (4) - 1 freq whiles (5) - 479 freq 'whiles (5) - 2 freq €œwhiles (5) - 4 freq awhyles (5) - 1 freq by-whyles (6) - 10 freq tholes (6) - 17 freq fitehills (6) - 7 freq outwales (6) - 1 freq pot-holes (6) - 1 freq whyles (6) - 85 freq fmwales (6) - 1 freq whales (6) - 15 freq f-holes (6) - 1 freq futehills (6) - 1 freq €œwhyles (6) - 1 freq meanwhiles (6) - 2 freq ootwales (6) - 1 freq aftimes (6) - 11 freq aft-times (6) - 10 freq afttimes (6) - 2 freq awhile (6) - 15 freq a-while (6) - 2 freq a while (6) - 1 freq |
SoundEx code - A134 aftwhiles - 3 freq aptly - 4 freq aaftly - 1 freq aabody'll - 3 freq aff-the-luif - 2 freq abdul - 7 freq |
MetaPhone code - AFTHLS aftwhiles - 3 freq |
AFTWHILES |
| Time to execute Levenshtein function - 0.217176 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.357753 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.027171 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.040360 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.000851 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. |