| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reserve (0) - 7 freq reserved (1) - 11 freq reservt (1) - 1 freq preserve (1) - 20 freq deserve (1) - 63 freq reserves (1) - 4 freq serve (2) - 72 freq resolve (2) - 10 freq presarve (2) - 1 freq preserved (2) - 7 freq reservit (2) - 5 freq deserved (2) - 58 freq receive (2) - 21 freq 'deserve (2) - 1 freq reverse (2) - 21 freq reservin (2) - 1 freq reverie (2) - 2 freq observe (2) - 14 freq reserrs (2) - 1 freq referee (2) - 15 freq reerie (2) - 4 freq reeve (2) - 1 freq deserves (2) - 32 freq desarve (2) - 2 freq restive (2) - 1 freq |
reserve (0) - 7 freq reserves (2) - 4 freq preserve (2) - 20 freq deserve (2) - 63 freq reservt (2) - 1 freq reserved (2) - 11 freq reservin (3) - 1 freq observe (3) - 14 freq desarve (3) - 2 freq reservit (3) - 5 freq restive (3) - 1 freq resolve (3) - 10 freq serve (3) - 72 freq presarve (3) - 1 freq presairve (4) - 4 freq deserved (4) - 58 freq resoorce (4) - 4 freq repreive (4) - 1 freq reservoir (4) - 10 freq desairve (4) - 1 freq resort (4) - 8 freq sarve (4) - 10 freq resource (4) - 68 freq resorb (4) - 1 freq sereive (4) - 1 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 - RSRF reserve - 7 freq |
RESERVE |
| Time to execute Levenshtein function - 0.201490 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.484815 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.028391 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.070247 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.000832 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. |