| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vastly (0) - 3 freq lastly (1) - 5 freq vainly (2) - 3 freq aaftly (2) - 1 freq aptly (2) - 4 freq ghastly (2) - 3 freq partly (2) - 10 freq castle (2) - 157 freq maistly (2) - 226 freq laistly (2) - 2 freq tasty (2) - 45 freq hasty (2) - 6 freq gaistly (2) - 1 freq maestly (2) - 5 freq easily (2) - 60 freq justly (2) - 3 freq bastle (2) - 1 freq nasty (2) - 27 freq faitly (2) - 2 freq rustly (2) - 1 freq saftly (2) - 64 freq factly (2) - 1 freq listly (2) - 1 freq easely (2) - 1 freq vestry (2) - 3 freq |
vastly (0) - 3 freq lastly (2) - 5 freq rustly (3) - 1 freq bastle (3) - 1 freq maestly (3) - 5 freq justly (3) - 3 freq mostly (3) - 17 freq costly (3) - 4 freq vast (3) - 36 freq hastily (3) - 22 freq gaistly (3) - 1 freq vestry (3) - 3 freq listly (3) - 1 freq maistly (3) - 226 freq castle (3) - 157 freq laistly (3) - 2 freq vesta (4) - 2 freq vauntily (4) - 1 freq vested (4) - 2 freq moistly (4) - 1 freq castel (4) - 8 freq visibly (4) - 9 freq avast (4) - 3 freq tistle (4) - 3 freq vista (4) - 3 freq |
SoundEx code - V234 vastly - 3 freq victuals - 5 freq victual - 1 freq visitwales - 1 freq |
MetaPhone code - FSTL ghaistlie - 1 freq fustle - 3 freq vastly - 3 freq ghostly - 16 freq ghastly - 3 freq ghaistly - 13 freq festool - 2 freq |
VASTLY |
| Time to execute Levenshtein function - 0.215839 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.364484 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.035424 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.043379 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.000938 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. |