| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rolling (0) - 7 freq rowling (1) - 3 freq rollin (1) - 58 freq polling (1) - 3 freq rollin' (1) - 1 freq trolling (1) - 3 freq tilling (2) - 1 freq pulling (2) - 11 freq rollen (2) - 2 freq strolling (2) - 6 freq gosling (2) - 1 freq telling (2) - 78 freq enrolling (2) - 1 freq roilin (2) - 1 freq rollies (2) - 1 freq rollon (2) - 1 freq toiling (2) - 2 freq collin (2) - 2 freq solving (2) - 2 freq roaring (2) - 5 freq fouling (2) - 1 freq killing (2) - 7 freq rollie (2) - 3 freq rowting (2) - 1 freq cooling (2) - 1 freq |
rolling (0) - 7 freq rowling (2) - 3 freq rollin' (2) - 1 freq trolling (2) - 3 freq rollin (2) - 58 freq polling (2) - 3 freq falling (3) - 10 freq rollan (3) - 2 freq roullin (3) - 3 freq willing (3) - 10 freq killing (3) - 7 freq culling (3) - 2 freq milling (3) - 1 freq grilling (3) - 1 freq calling (3) - 15 freq rellin (3) - 1 freq pilling (3) - 1 freq railing (3) - 6 freq yelling (3) - 1 freq ruling (3) - 1 freq rollen (3) - 2 freq pulling (3) - 11 freq tilling (3) - 1 freq telling (3) - 78 freq enrolling (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 - RLNK rolling - 7 freq rowling - 3 freq railing - 6 freq ruling - 1 freq rlong - 1 freq |
ROLLING |
| Time to execute Levenshtein function - 0.195368 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.350543 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.027156 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.037252 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.000849 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. |