| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reservists (0) - 1 freq reservist (1) - 3 freq reservit (2) - 5 freq reserves (3) - 4 freq deservis (3) - 1 freq reservoirs (3) - 2 freq reservt (3) - 1 freq preservit (3) - 2 freq restraints (3) - 1 freq deservit (3) - 3 freq reservin (3) - 1 freq preservin' (4) - 3 freq restraunts (4) - 1 freq reserrin (4) - 1 freq enseeists (4) - 1 freq hervist (4) - 1 freq reformist (4) - 1 freq energises (4) - 1 freq resist (4) - 47 freq reveries (4) - 2 freq persists (4) - 3 freq preservin (4) - 8 freq reservations (4) - 4 freq reserved (4) - 11 freq 'hervist' (4) - 1 freq |
reservists (0) - 1 freq reservist (2) - 3 freq reservit (4) - 5 freq reservt (5) - 1 freq reservoirs (5) - 2 freq reserves (5) - 4 freq reservations (6) - 4 freq servents (6) - 1 freq reservin (6) - 1 freq servants (6) - 45 freq sarvints (6) - 10 freq preservit (6) - 2 freq restraints (6) - 1 freq deservis (6) - 1 freq deservit (6) - 3 freq servint (7) - 1 freq servetus (7) - 2 freq supervises (7) - 1 freq preserve's (7) - 1 freq services (7) - 66 freq resairves (7) - 2 freq federistas (7) - 1 freq reservation (7) - 4 freq reverses (7) - 1 freq reists (7) - 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 - RSRFSTS reservists - 1 freq |
RESERVISTS |
| Time to execute Levenshtein function - 0.205978 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.381857 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.028319 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.038583 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.000910 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. |