| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| online (0) - 142 freq onlie (1) - 102 freq oanline (1) - 36 freq on-line (1) - 9 freq 'online (1) - 4 freq incline (2) - 6 freq byline (2) - 2 freq onnie (2) - 7 freq opine (2) - 1 freq oblige (2) - 2 freq onhin (2) - 2 freq aniline (2) - 9 freq ollie (2) - 7 freq engine (2) - 50 freq olina (2) - 11 freq onyone (2) - 23 freq ootline (2) - 14 freq onlee (2) - 2 freq offline (2) - 1 freq line (2) - 479 freq erline (2) - 1 freq onlyke (2) - 2 freq hotline (2) - 1 freq anlie (2) - 15 freq olite (2) - 3 freq |
online (0) - 142 freq oanline (1) - 36 freq aniline (2) - 9 freq onlie (2) - 102 freq 'online (2) - 4 freq on-line (2) - 9 freq kline (3) - 1 freq feline (3) - 16 freq conlin (3) - 5 freq ingine (3) - 33 freq oonlike (3) - 1 freq unlike (3) - 42 freq injine (3) - 7 freq onyane (3) - 13 freq onyin (3) - 1 freq unalane (3) - 1 freq outline (3) - 2 freq nine (3) - 229 freq onyene (3) - 1 freq anlie (3) - 15 freq cline (3) - 4 freq onli (3) - 40 freq inlan (3) - 1 freq engine (3) - 50 freq onlee (3) - 2 freq |
SoundEx code - O545 on-line - 9 freq online - 142 freq oanline - 36 freq 'online - 4 freq onlinegames - 2 freq oonlimited - 1 freq online-price - 1 freq onlmaps - 1 freq onlyoneteeta - 1 freq |
MetaPhone code - ONLN on-line - 9 freq online - 142 freq oanline - 36 freq 'online - 4 freq |
ONLINE |
| Time to execute Levenshtein function - 0.686518 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 - 1.006458 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.092577 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.102990 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.000835 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. |