| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootlets (0) - 6 freq oolets (1) - 1 freq ootsets (1) - 6 freq ootlats (1) - 2 freq ootlet (1) - 4 freq outlets (1) - 1 freq ootleuk (2) - 3 freq outlet (2) - 3 freq hoolets (2) - 5 freq ootfits (2) - 4 freq ooclet (2) - 1 freq dootless (2) - 7 freq cutlets (2) - 3 freq ootlays (2) - 2 freq oonless (2) - 4 freq ootlins (2) - 3 freq ootlaws (2) - 1 freq howlets (2) - 1 freq potless (2) - 1 freq ootrels (2) - 18 freq toilets (2) - 32 freq houlets (2) - 1 freq ootlaas (2) - 1 freq ootlat (2) - 6 freq ootliers (2) - 1 freq |
ootlets (0) - 6 freq ootlats (1) - 2 freq outlets (1) - 1 freq oolets (2) - 1 freq toilets (2) - 32 freq ootlet (2) - 4 freq ootsets (2) - 6 freq ootlins (3) - 3 freq houlets (3) - 1 freq ootlays (3) - 2 freq ootliers (3) - 1 freq ootlat (3) - 6 freq ootlaas (3) - 1 freq ootlaws (3) - 1 freq outlet (3) - 3 freq ootfits (3) - 4 freq hoolets (3) - 5 freq cutlets (3) - 3 freq outfits (4) - 2 freq tles (4) - 1 freq totes (4) - 1 freq outlins (4) - 2 freq toijets (4) - 1 freq ootlines (4) - 6 freq toilet (4) - 93 freq |
SoundEx code - O343 ootlet - 4 freq outlawed - 4 freq ootwaled - 1 freq ootlat - 6 freq ootlats - 2 freq ootlets - 6 freq outlet - 3 freq outlets - 1 freq |
MetaPhone code - OTLTS ootlats - 2 freq ootlets - 6 freq outlets - 1 freq |
OOTLETS |
| Time to execute Levenshtein function - 0.208123 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.360162 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.027690 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.036912 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.000929 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. |