| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relyin (0) - 7 freq relayin (1) - 1 freq replyin (1) - 9 freq rellin (1) - 1 freq relyan (1) - 1 freq eelyin (1) - 1 freq fellin (2) - 3 freq redein (2) - 1 freq reevin (2) - 3 freq melvin (2) - 3 freq mellin (2) - 64 freq redin (2) - 2 freq rallyin (2) - 3 freq flyin (2) - 45 freq regain (2) - 10 freq kelvin (2) - 8 freq meldin (2) - 2 freq rearin (2) - 8 freq revvin (2) - 1 freq denyin (2) - 21 freq beltin (2) - 22 freq replayin (2) - 1 freq relaxin (2) - 6 freq reddin (2) - 60 freq reesin (2) - 1 freq |
relyin (0) - 7 freq relyan (1) - 1 freq relayin (1) - 1 freq rilin (2) - 2 freq rulin (2) - 6 freq reelin (2) - 16 freq replyin (2) - 9 freq rellin (2) - 1 freq eelyin (2) - 1 freq rein (3) - 14 freq remin (3) - 1 freq reezin (3) - 1 freq reelan (3) - 3 freq reekin (3) - 45 freq reasin (3) - 2 freq reamin (3) - 6 freq rely (3) - 16 freq reikin (3) - 2 freq resin (3) - 6 freq relatin (3) - 9 freq plyin (3) - 1 freq readyin (3) - 5 freq renyie (3) - 1 freq readin (3) - 366 freq lyin (3) - 327 freq |
SoundEx code - R450 reelin - 16 freq rollin - 58 freq railin - 12 freq rallyin - 3 freq rullion - 3 freq reelan - 3 freq rawlin - 1 freq realm - 20 freq roilin - 1 freq rulin - 6 freq rollin' - 1 freq rollen - 2 freq rowlin - 4 freq roulin - 2 freq roilan - 1 freq rallyan - 2 freq rellin - 1 freq relyin - 7 freq relyan - 1 freq rollan - 2 freq rolleen - 1 freq roullin - 3 freq realme - 1 freq relayin - 1 freq rilin - 2 freq rollon - 1 freq |
MetaPhone code - RLYN rallyin - 3 freq rallyan - 2 freq relyin - 7 freq relyan - 1 freq relayin - 1 freq |
RELYIN |
| Time to execute Levenshtein function - 0.206832 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.336376 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.026973 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.036701 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.000755 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. |