| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prerequisite (0) - 2 freq exquisite (4) - 3 freq preeveilige (5) - 1 freq preecise (5) - 1 freq perpetuitie (5) - 1 freq prejuidice (5) - 1 freq peruasive (5) - 1 freq preterite (5) - 2 freq requirit (5) - 1 freq reveisit (5) - 1 freq preevilige (5) - 1 freq plebiscite (6) - 1 freq bruisit (6) - 2 freq permeision (6) - 1 freq reveisitit (6) - 1 freq preterites (6) - 2 freq propensity (6) - 2 freq arreist (6) - 3 freq perisht (6) - 2 freq preists (6) - 3 freq reservist (6) - 3 freq preeshts (6) - 20 freq preceese (6) - 5 freq persistit (6) - 5 freq preferit (6) - 1 freq |
prerequisite (0) - 2 freq exquisite (7) - 3 freq propensity (8) - 2 freq persist (8) - 9 freq praisit (8) - 1 freq arreist (8) - 3 freq preist (8) - 3 freq professit (8) - 2 freq persuit (8) - 1 freq progressit (8) - 1 freq pressit (8) - 4 freq parasite (8) - 3 freq peruasive (8) - 1 freq preecise (8) - 1 freq perpetuitie (8) - 1 freq preterite (8) - 2 freq request (8) - 28 freq reveisit (8) - 1 freq requirit (8) - 1 freq profest (9) - 1 freq predicate (9) - 11 freq proveision (9) - 6 freq requested (9) - 5 freq pre-set (9) - 1 freq premeese (9) - 1 freq |
SoundEx code - P662 prayers - 59 freq prior's - 4 freq prayer-saft - 1 freq prauers - 1 freq priouris - 1 freq prerequisite - 2 freq pryers - 1 freq |
MetaPhone code - PRRKST prerequisite - 2 freq |
PREREQUISITE |
| Time to execute Levenshtein function - 0.228985 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.453914 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.031348 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.038338 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.000886 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. |