| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootlines (0) - 6 freq ootlives (1) - 1 freq ootlined (1) - 7 freq ootlins (1) - 2 freq ootlings (1) - 1 freq ootline (1) - 14 freq ootins (2) - 2 freq outline (2) - 2 freq ootshines (2) - 1 freq hotline (2) - 1 freq outlins (2) - 2 freq ootliers (2) - 1 freq ootlin (2) - 11 freq ootlinin (2) - 2 freq oolies (2) - 1 freq ootlinn (2) - 3 freq outlined (2) - 1 freq ootlinned (2) - 2 freq ootgies (2) - 1 freq declines (3) - 1 freq ootsized (3) - 1 freq confines (3) - 2 freq carlines (3) - 3 freq outlin (3) - 3 freq rosines (3) - 1 freq |
ootlines (0) - 6 freq ootlins (1) - 2 freq ootline (2) - 14 freq ootlings (2) - 1 freq outlins (2) - 2 freq ootlined (2) - 7 freq ootlives (2) - 1 freq ootlin (3) - 11 freq outlined (3) - 1 freq ootliers (3) - 1 freq ootlinn (3) - 3 freq ootlinin (3) - 2 freq ootins (3) - 2 freq outline (3) - 2 freq outins (4) - 1 freq lines (4) - 216 freq ootland (4) - 5 freq ootlaws (4) - 1 freq outlinin (4) - 1 freq ootgans (4) - 1 freq ootlan (4) - 1 freq erlines (4) - 2 freq tines (4) - 7 freq ootlays (4) - 2 freq ootlets (4) - 6 freq |
SoundEx code - O345 ootlander - 2 freq ootlin - 11 freq ootline - 14 freq ootlings - 1 freq ootlin-shapit - 1 freq outlyin - 1 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 outline - 2 freq €˜outlins - 1 freq outlander - 3 freq outlinin - 1 freq ootlyin - 2 freq outlined - 1 freq €œoutlins - 1 freq ootlins - 2 freq ootlan - 1 freq ootlandish - 1 freq |
MetaPhone code - OTLNS outlins - 2 freq ootlines - 6 freq €˜outlins - 1 freq €œoutlins - 1 freq ootlins - 2 freq |
OOTLINES |
| Time to execute Levenshtein function - 0.185059 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.375266 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.029313 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.037974 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.001139 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. |