| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resurface (0) - 1 freq resurfaced (1) - 2 freq surface (2) - 86 freq resurrect (3) - 3 freq retrace (3) - 1 freq resurgence (3) - 6 freq resource (3) - 68 freq surfaces (3) - 6 freq surfaced (3) - 3 freq returnan (4) - 1 freq reference (4) - 52 freq returnable (4) - 1 freq ruffage (4) - 1 freq resuman (4) - 1 freq resume (4) - 6 freq surfan (4) - 1 freq heidrace (4) - 1 freq suffice (4) - 10 freq assurance (4) - 6 freq recreate (4) - 1 freq rephrase (4) - 1 freq resurrected (4) - 4 freq reframe (4) - 1 freq dusgrace (4) - 1 freq weirfare (4) - 3 freq |
resurface (0) - 1 freq resurfaced (2) - 2 freq surface (3) - 86 freq resource (4) - 68 freq surfiece (5) - 1 freq resoorce (5) - 4 freq surfaced (5) - 3 freq surfeece (5) - 1 freq surfaces (5) - 6 freq resurrect (5) - 3 freq resurgence (5) - 6 freq retrace (5) - 1 freq reserve (6) - 8 freq reassurance (6) - 5 freq resourced (6) - 10 freq preface (6) - 2 freq ramrace (6) - 1 freq reuerence (6) - 1 freq insurance (6) - 18 freq residence (6) - 17 freq reverence (6) - 10 freq resonance (6) - 5 freq resources (6) - 219 freq assurance (6) - 6 freq surfan (6) - 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 - RSRFS reserves - 4 freq resurface - 1 freq resairves - 2 freq |
RESURFACE |
| Time to execute Levenshtein function - 0.216700 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.376664 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.031240 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.041187 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.001028 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. |