| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rowling (0) - 3 freq bowling (1) - 1 freq dowling (1) - 1 freq rowting (1) - 1 freq howling (1) - 3 freq growling (1) - 1 freq rolling (1) - 7 freq rowlin (1) - 4 freq rollin (2) - 58 freq gowlin (2) - 15 freq rocking (2) - 2 freq fowlin (2) - 1 freq rawlin (2) - 1 freq ruling (2) - 1 freq roslin (2) - 1 freq browsing (2) - 2 freq browning (2) - 7 freq cooling (2) - 1 freq bowlin (2) - 14 freq prowlin (2) - 3 freq poling (2) - 1 freq rowein (2) - 7 freq crawling (2) - 1 freq rotting (2) - 1 freq roaring (2) - 5 freq |
rowling (0) - 3 freq rolling (2) - 7 freq rowlin (2) - 4 freq howling (2) - 3 freq growling (2) - 1 freq dowling (2) - 1 freq rowting (2) - 1 freq bowling (2) - 1 freq bawling (3) - 1 freq crawling (3) - 1 freq ruling (3) - 1 freq railing (3) - 6 freq rawlin (3) - 1 freq rowin' (4) - 1 freq crowlin (4) - 3 freq lowping (4) - 1 freq howlin' (4) - 2 freq bowing (4) - 1 freq polling (4) - 3 freq trolling (4) - 3 freq yowlin (4) - 16 freq lowsing (4) - 2 freq rowsting (4) - 1 freq boiling (4) - 2 freq rowtin (4) - 4 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 |
ROWLING |
| Time to execute Levenshtein function - 0.301111 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.553812 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.062962 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.038074 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.000826 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. |