| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootline (0) - 14 freq ootlins (1) - 3 freq hotline (1) - 1 freq outline (1) - 4 freq ootlinn (1) - 3 freq ootlin (1) - 12 freq ootlined (1) - 7 freq ootlines (1) - 6 freq oanline (2) - 36 freq ootlyin (2) - 2 freq ootlinned (2) - 2 freq ootlyn (2) - 1 freq ootrin (2) - 1 freq outlined (2) - 1 freq ootside (2) - 635 freq ootsize (2) - 1 freq offline (2) - 1 freq ootlings (2) - 1 freq ootdane (2) - 1 freq ootlinin (2) - 2 freq ootsite (2) - 1 freq ootshine (2) - 3 freq ootgane (2) - 1 freq rootine (2) - 1 freq ootin' (2) - 1 freq |
ootline (0) - 14 freq ootlin (1) - 12 freq outline (1) - 4 freq ootlyin (2) - 2 freq ootlan (2) - 1 freq ootlyn (2) - 1 freq ootlines (2) - 6 freq outlin (2) - 3 freq ootlins (2) - 3 freq ootlinn (2) - 3 freq hotline (2) - 1 freq ootlined (2) - 7 freq ootin (3) - 5 freq ootgane (3) - 1 freq outlyin (3) - 1 freq outlins (3) - 2 freq oanline (3) - 36 freq outlan (3) - 2 freq online (3) - 143 freq outling (3) - 2 freq ootlinin (3) - 2 freq yatlin (3) - 1 freq outlined (3) - 1 freq ootrin (3) - 1 freq toilin (3) - 2 freq |
SoundEx code - O345 ootlander - 2 freq ootlin - 12 freq ootline - 14 freq ootlings - 1 freq ootlin-shapit - 1 freq outlyin - 1 freq outline - 4 freq ootlins - 3 freq ootlined - 7 freq outlins - 2 freq ootland - 5 freq outling - 2 freq ootlines - 6 freq outlan - 2 freq outland - 2 freq ootlyn - 1 freq ootlaund - 1 freq oot-londoned - 1 freq outlin - 3 freq oot-walin - 1 freq ootlinin - 2 freq ootlinn - 3 freq ootlinned - 2 freq outlaun - 1 freq €˜outlins - 1 freq outlander - 3 freq outlinin - 1 freq ootlyin - 2 freq outlined - 1 freq €œoutlins - 1 freq ootlan - 1 freq ootlandish - 1 freq |
MetaPhone code - OTLN ootlin - 12 freq ootline - 14 freq outline - 4 freq outlan - 2 freq ootlyn - 1 freq outlin - 3 freq ootlinn - 3 freq outlaun - 1 freq ootlan - 1 freq |
OOTLINE |
| Time to execute Levenshtein function - 0.175588 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.329815 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.027250 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.037418 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.000883 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. |