| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| regcrawford (0) - 2 freq crawford (3) - 5 freq katycrawford (4) - 1 freq crawfor (4) - 1 freq crawfurd (4) - 1 freq regard (5) - 16 freq recawed (5) - 2 freq regaird (5) - 39 freq trafford (5) - 1 freq robinacrawford (5) - 2 freq crawroad (5) - 1 freq crawford's (5) - 2 freq refractors (5) - 2 freq record (5) - 99 freq rocafort (5) - 1 freq recaird (5) - 1 freq redcard (5) - 1 freq redrafted (5) - 1 freq stratford (5) - 1 freq regulaetors (5) - 1 freq negator (6) - 6 freq herefore (6) - 1 freq regiar (6) - 1 freq wallayford (6) - 1 freq bedford (6) - 1 freq |
regcrawford (0) - 2 freq crawford (5) - 5 freq crawfurd (6) - 1 freq katycrawford (6) - 1 freq crawfor (7) - 1 freq robinacrawford (7) - 2 freq crawroad (8) - 1 freq recaird (9) - 1 freq redcard (9) - 1 freq rocafort (9) - 1 freq jamiecrawfordd (9) - 9 freq rutherford (9) - 4 freq redrafted (9) - 1 freq stratford (9) - 1 freq recawed (9) - 2 freq regard (9) - 16 freq record (9) - 99 freq regaird (9) - 39 freq trafford (9) - 1 freq crawford's (9) - 2 freq efterword (10) - 2 freq scrawled (10) - 4 freq blackford (10) - 6 freq graifyaird (10) - 1 freq grafted (10) - 4 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 - RKKRFRT regcrawford - 2 freq |
REGCRAWFORD |
| Time to execute Levenshtein function - 0.262364 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.372709 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.027895 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.040672 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.000938 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. |