| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| railins (0) - 22 freq mailins (1) - 1 freq pailins (1) - 4 freq raisins (1) - 10 freq ailins (1) - 1 freq railings (1) - 7 freq failins (1) - 1 freq dailins (1) - 4 freq railing (1) - 6 freq railin (1) - 12 freq mailies (2) - 1 freq aiblins (2) - 278 freq ravelins (2) - 1 freq darlins (2) - 4 freq rainin (2) - 40 freq railise (2) - 1 freq hanlins (2) - 1 freq raikin (2) - 14 freq risins (2) - 2 freq tailin (2) - 1 freq bailin (2) - 3 freq raising (2) - 7 freq heilins (2) - 1 freq raitions (2) - 1 freq dailin (2) - 1 freq |
railins (0) - 22 freq dailins (2) - 4 freq railing (2) - 6 freq failins (2) - 1 freq raileens (2) - 3 freq railin (2) - 12 freq pailins (2) - 4 freq mailins (2) - 1 freq raisins (2) - 10 freq railings (2) - 7 freq ailins (2) - 1 freq palins (3) - 8 freq walins (3) - 2 freq eilins (3) - 4 freq rail's (3) - 1 freq raisons (3) - 20 freq raivens (3) - 1 freq rilin (3) - 2 freq roilin (3) - 1 freq yearlins (3) - 1 freq aalins (3) - 2 freq yerlins (3) - 1 freq airlines (3) - 1 freq rails (3) - 15 freq rains (3) - 27 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.179005 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.349131 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.033134 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.039583 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.000848 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. |