Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
reservoir (0) - 10 freq reservoirs (1) - 2 freq reservin (2) - 1 freq reservit (2) - 5 freq deservin (3) - 4 freq deservis (3) - 1 freq reserrin (3) - 1 freq reserved (3) - 11 freq preservit (3) - 2 freq reserves (3) - 4 freq reserve (3) - 7 freq preservin (3) - 8 freq reservt (3) - 1 freq deservit (3) - 3 freq reservist (3) - 3 freq revoir (3) - 5 freq repertoire (3) - 7 freq beauvoir (4) - 1 freq referrin (4) - 11 freq deserve (4) - 63 freq resortin (4) - 3 freq 'servin (4) - 1 freq observer (4) - 3 freq receivin (4) - 7 freq deserves (4) - 32 freq |
reservoir (0) - 10 freq reservoirs (2) - 2 freq reservit (3) - 5 freq reservin (3) - 1 freq reserves (4) - 4 freq reserve (4) - 7 freq reserved (4) - 11 freq reservt (4) - 1 freq revoir (5) - 5 freq preservit (5) - 2 freq deservin (5) - 4 freq observer (5) - 3 freq reservist (5) - 3 freq repertoire (5) - 7 freq deservit (5) - 3 freq reserrin (5) - 1 freq preservin (5) - 8 freq deservis (5) - 1 freq server (5) - 2 freq priservin (6) - 1 freq observin (6) - 8 freq fervour (6) - 2 freq resolvit (6) - 2 freq receiver (6) - 4 freq deserved (6) - 58 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 - RSRFR reservoir - 10 freq |
RESERVOIR |
Time to execute Levenshtein function - 0.188698 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.353450 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.027910 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.037557 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.000848 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. |