| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reservit (0) - 5 freq reservin (1) - 1 freq preservit (1) - 2 freq reservist (1) - 3 freq reservt (1) - 1 freq deservit (1) - 3 freq reservoir (2) - 10 freq reserve (2) - 8 freq reserved (2) - 11 freq deservin (2) - 4 freq revertit (2) - 4 freq remerkit (2) - 2 freq desertit (2) - 7 freq reserves (2) - 4 freq referrit (2) - 11 freq receivit (2) - 3 freq deservis (2) - 1 freq resentit (2) - 2 freq reserrin (2) - 1 freq reservists (2) - 1 freq resolvit (2) - 2 freq deseruit (2) - 1 freq preservin (2) - 8 freq servit (2) - 8 freq observit (2) - 2 freq |
reservit (0) - 5 freq reservt (1) - 1 freq reservin (2) - 1 freq preservit (2) - 2 freq deservit (2) - 3 freq reservist (2) - 3 freq reserves (3) - 4 freq servit (3) - 8 freq resolvit (3) - 2 freq observit (3) - 2 freq reserved (3) - 11 freq reservoir (3) - 10 freq reserve (3) - 8 freq reservists (4) - 1 freq resort (4) - 8 freq deseruit (4) - 1 freq servt (4) - 1 freq reserrin (4) - 1 freq preservin (4) - 8 freq deservin (4) - 4 freq resentit (4) - 2 freq remerkit (4) - 2 freq referrit (4) - 11 freq desertit (4) - 7 freq deservis (4) - 1 freq |
SoundEx code - R261 reserve - 8 freq reservt - 1 freq reserved - 11 freq reservit - 5 freq razorbill - 1 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 |
RESERVIT |
| Time to execute Levenshtein function - 0.203379 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.444512 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.030344 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.038806 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.004035 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. |