| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| up-to-date (0) - 1 freq up-ti-date (1) - 2 freq up-tae-date (2) - 1 freq pre-date (4) - 1 freq update (4) - 16 freq pit-pat (5) - 2 freq potentate (5) - 1 freq -til-late (5) - 1 freq uptake (5) - 4 freq uptae (5) - 22 freq up-haudit (5) - 1 freq toate (5) - 1 freq co-locate (5) - 1 freq upstage (5) - 2 freq ultimate (5) - 11 freq up-the (5) - 1 freq updates (5) - 9 freq spatulate (5) - 1 freq to-day (5) - 1 freq aphrodite (5) - 20 freq up-hauddit (6) - 1 freq polatie (6) - 1 freq southgate (6) - 1 freq up-an-up (6) - 1 freq stoat (6) - 24 freq |
up-to-date (0) - 1 freq up-ti-date (1) - 2 freq up-tae-date (2) - 1 freq pre-date (6) - 1 freq pit-pat (7) - 2 freq update (7) - 16 freq up-haudit (7) - 1 freq to-day (8) - 1 freq pit-doun (8) - 1 freq pit-oot (8) - 5 freq up-the (8) - 1 freq p-l-i-t (8) - 1 freq up-hauddit (8) - 1 freq aphrodite (8) - 20 freq p-p-pit (8) - 1 freq -til-late (8) - 1 freq potentate (8) - 1 freq day-tae-day (9) - 3 freq pretendit (9) - 6 freq up-dander (9) - 1 freq -to- (9) - 1 freq antidote (9) - 2 freq tae-dae (9) - 6 freq t-that (9) - 1 freq -that (9) - 1 freq |
SoundEx code - U133 updatin - 4 freq updates - 9 freq updatit - 13 freq uphauddit - 2 freq updaetit - 2 freq update - 16 freq updating - 2 freq up-ti-date - 2 freq up-tae-date - 1 freq uphaudit - 13 freq up-hauddit - 1 freq up-to-date - 1 freq up-haudit - 1 freq up-tae-the-meinit - 1 freq up-tae-the-meenit - 1 freq upthedons - 2 freq updates' - 1 freq |
MetaPhone code - UPTTT updatit - 13 freq updaetit - 2 freq up-ti-date - 2 freq up-tae-date - 1 freq up-to-date - 1 freq |
UP-TO-DATE |
| Time to execute Levenshtein function - 0.213042 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.372798 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.029271 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.037947 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.000841 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. |