| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| railins (0) - 22 freq railing (1) - 6 freq railings (1) - 7 freq dailins (1) - 4 freq failins (1) - 1 freq pailins (1) - 4 freq railin (1) - 12 freq mailins (1) - 1 freq ailins (1) - 1 freq raisins (1) - 10 freq wailing (2) - 1 freq raisons (2) - 20 freq bailin (2) - 3 freq fairins (2) - 7 freq palins (2) - 8 freq hanlins (2) - 1 freq pairins (2) - 1 freq failings (2) - 1 freq nailing (2) - 3 freq ravelins (2) - 1 freq failin (2) - 27 freq heilins (2) - 1 freq raiblin (2) - 1 freq hailin (2) - 7 freq walins (2) - 2 freq |
railins (0) - 22 freq raileens (2) - 3 freq ailins (2) - 1 freq raisins (2) - 10 freq railing (2) - 6 freq railin (2) - 12 freq mailins (2) - 1 freq pailins (2) - 4 freq dailins (2) - 4 freq railings (2) - 7 freq failins (2) - 1 freq risins (3) - 2 freq aalins (3) - 2 freq rails (3) - 16 freq rail's (3) - 1 freq raivens (3) - 1 freq rains (3) - 27 freq eilins (3) - 4 freq raitions (3) - 1 freq darlins (3) - 4 freq roilin (3) - 1 freq rivlins (3) - 2 freq airlines (3) - 1 freq yerlins (3) - 1 freq yearlins (3) - 1 freq |
SoundEx code - R452 rolling - 7 freq railins - 22 freq realms - 6 freq relinquishes - 1 freq rowling - 3 freq rowling's - 1 freq railings - 7 freq raileens - 3 freq reliance - 4 freq railing - 6 freq ruling - 1 freq realeoinjess - 1 freq realmackaystv - 1 freq rholmes - 2 freq rlong - 1 freq rlmcalpine - 1 freq |
MetaPhone code - RLNS railins - 22 freq raileens - 3 freq reliance - 4 freq |
RAILINS |
| Time to execute Levenshtein function - 0.204660 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.386239 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.028313 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.037249 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.000928 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. |