| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reservoirs (0) - 2 freq reservoir (1) - 10 freq reserves (3) - 4 freq repertoire (3) - 7 freq reservit (3) - 5 freq reserrs (3) - 1 freq reservists (3) - 1 freq reservin (3) - 1 freq deservis (3) - 1 freq reservist (3) - 3 freq rescours (4) - 3 freq preservit (4) - 2 freq reverrons (4) - 1 freq deserters (4) - 2 freq deservit (4) - 3 freq reevlers (4) - 4 freq preservin' (4) - 3 freq deservin (4) - 4 freq reservt (4) - 1 freq preserve's (4) - 1 freq revoir (4) - 5 freq reveries (4) - 1 freq reservations (4) - 4 freq servers (4) - 1 freq observers (4) - 1 freq |
reservoirs (0) - 2 freq reservoir (2) - 10 freq reserves (4) - 4 freq reserrs (4) - 1 freq observers (5) - 1 freq deservis (5) - 1 freq servers (5) - 1 freq reservist (5) - 3 freq reservin (5) - 1 freq reservists (5) - 1 freq reservit (5) - 5 freq reservations (6) - 4 freq reserrin (6) - 1 freq deserves (6) - 32 freq reserve (6) - 7 freq reveries (6) - 1 freq resairves (6) - 2 freq reserved (6) - 11 freq reservation (6) - 4 freq researchers (6) - 8 freq rescours (6) - 3 freq repertoire (6) - 7 freq deserters (6) - 2 freq preserve's (6) - 1 freq reservt (6) - 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 - RSRFRS reservoirs - 2 freq |
RESERVOIRS |
| Time to execute Levenshtein function - 0.275326 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.410573 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.027316 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.042083 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.000836 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. |