| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deprived (0) - 7 freq derived (1) - 12 freq deprive (1) - 3 freq depraved (1) - 1 freq deprives (1) - 1 freq decried (2) - 3 freq derives (2) - 10 freq deprivat (2) - 1 freq derive (2) - 2 freq repruved (2) - 1 freq deprivin (2) - 1 freq deceived (2) - 2 freq deived (2) - 1 freq descrived (2) - 18 freq descrieved (3) - 1 freq cerved (3) - 1 freq arrived (3) - 136 freq kerried (3) - 23 freq beeried (3) - 14 freq drive (3) - 167 freq dearie (3) - 37 freq pried (3) - 2 freq deskrive (3) - 1 freq approved (3) - 9 freq repreive (3) - 1 freq |
deprived (0) - 7 freq depraved (1) - 1 freq derived (2) - 12 freq deprive (2) - 3 freq deprives (2) - 1 freq deprivin (3) - 1 freq deprivat (3) - 1 freq repruved (3) - 1 freq pruived (4) - 13 freq appruived (4) - 1 freq desairved (4) - 1 freq depairted (4) - 3 freq deserved (4) - 58 freq appreived (4) - 1 freq approved (4) - 9 freq preived (4) - 1 freq proved (4) - 30 freq departed (4) - 10 freq improved (4) - 7 freq pruved (4) - 1 freq derive (4) - 2 freq deceived (4) - 2 freq deived (4) - 1 freq derives (4) - 10 freq descrived (4) - 18 freq |
SoundEx code - D161 deprive - 3 freq deprived - 7 freq deprivation - 11 freq deprives - 1 freq deprivin - 1 freq depravity - 2 freq deprivat - 1 freq day-afore-peyday - 1 freq debrief - 1 freq dabarbuckle - 3 freq depraved - 1 freq daveraver - 2 freq |
MetaPhone code - TPRFT deprived - 7 freq depravity - 2 freq deprivat - 1 freq depraved - 1 freq |
DEPRIVED |
| Time to execute Levenshtein function - 0.179826 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.381404 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.027520 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.037202 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.000834 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. |