| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relyan (0) - 1 freq relyin (1) - 7 freq geyan (2) - 17 freq gellan (2) - 7 freq lellan (2) - 1 freq regan (2) - 1 freq reiban (2) - 2 freq rely (2) - 16 freq defyan (2) - 1 freq relayin (2) - 1 freq denyan (2) - 2 freq readan (2) - 10 freq helpan (2) - 1 freq restan (2) - 4 freq irelan (2) - 3 freq reidan (2) - 1 freq tellan (2) - 13 freq relaxan (2) - 2 freq ellan (2) - 2 freq sellan (2) - 1 freq rellin (2) - 1 freq rollan (2) - 2 freq reliant (2) - 3 freq rearan (2) - 1 freq relax (2) - 44 freq |
relyan (0) - 1 freq relyin (1) - 7 freq irelan (2) - 3 freq reelan (2) - 3 freq relayin (2) - 1 freq reelin (3) - 16 freq lyan (3) - 29 freq replyin (3) - 9 freq relax (3) - 44 freq reliant (3) - 3 freq rearan (3) - 1 freq flyan (3) - 17 freq yellan (3) - 1 freq rilin (3) - 2 freq reekan (3) - 1 freq relay (3) - 4 freq rollan (3) - 2 freq eelyin (3) - 1 freq rallyan (3) - 2 freq rulin (3) - 6 freq ryan (3) - 32 freq rely (3) - 16 freq readan (3) - 10 freq reiban (3) - 2 freq rellin (3) - 1 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 |
RELYAN |
| Time to execute Levenshtein function - 0.219432 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.384079 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.034924 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.044389 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.000867 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. |