| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reserved (0) - 11 freq preserved (1) - 7 freq deserved (1) - 58 freq reserve (1) - 7 freq reserves (1) - 4 freq revered (2) - 3 freq reservin (2) - 1 freq resorted (2) - 3 freq resolved (2) - 8 freq deserves (2) - 32 freq served (2) - 73 freq reeseeved (2) - 1 freq resented (2) - 1 freq reeved (2) - 2 freq resaived (2) - 2 freq reverted (2) - 1 freq received (2) - 48 freq deserted (2) - 5 freq preserve (2) - 20 freq referred (2) - 18 freq reservt (2) - 1 freq 'served (2) - 1 freq deserred (2) - 2 freq reservit (2) - 5 freq refereed (2) - 1 freq |
reserved (0) - 11 freq preserved (2) - 7 freq reserve (2) - 7 freq reserves (2) - 4 freq deserved (2) - 58 freq observed (3) - 11 freq resaived (3) - 2 freq reservt (3) - 1 freq unreserved (3) - 1 freq reservit (3) - 5 freq 'served (3) - 1 freq reeseeved (3) - 1 freq resolved (3) - 8 freq resorted (3) - 3 freq served (3) - 73 freq reservin (3) - 1 freq deserve (4) - 63 freq €œserved (4) - 1 freq desairved (4) - 1 freq resairves (4) - 2 freq sereived (4) - 1 freq repruved (4) - 1 freq resourced (4) - 10 freq reversed (4) - 4 freq reservoir (4) - 10 freq |
SoundEx code - R261 reserve - 7 freq reservt - 1 freq reserved - 11 freq reservit - 5 freq reservoir - 10 freq reservatiouns - 1 freq resurfaced - 2 freq reserves - 4 freq razorbills - 1 freq resurface - 1 freq reservist - 3 freq reservists - 1 freq reservin - 1 freq re-scrievit - 1 freq reservations - 4 freq reservoirs - 2 freq reservation - 4 freq ruggerbaw - 3 freq ruggirbaw - 1 freq resairves - 2 freq rescreive - 1 freq roycroppernot - 1 freq regroup - 1 freq resorb - 1 freq regcrawford - 2 freq |
MetaPhone code - RSRFT reservt - 1 freq reserved - 11 freq reservit - 5 freq |
RESERVED |
| Time to execute Levenshtein function - 0.197722 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.385269 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.027230 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.037771 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.000828 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. |