| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| outlets (0) - 1 freq ootlets (1) - 6 freq outlet (1) - 3 freq cutlets (1) - 3 freq couplets (2) - 1 freq futrets (2) - 2 freq houlets (2) - 1 freq outfits (2) - 2 freq ootlet (2) - 4 freq ootsets (2) - 6 freq bullets (2) - 27 freq outlins (2) - 2 freq oolets (2) - 1 freq ootlats (2) - 2 freq gutless (2) - 1 freq outset (2) - 1 freq doutless (2) - 4 freq wutless (2) - 1 freq motets (3) - 3 freq gullet (3) - 5 freq routes (3) - 11 freq coatless (3) - 1 freq hoolets (3) - 5 freq staets (3) - 3 freq outblent (3) - 1 freq |
outlets (0) - 1 freq ootlets (1) - 6 freq ootlats (2) - 2 freq cutlets (2) - 3 freq outlet (2) - 3 freq outlins (3) - 2 freq ootsets (3) - 6 freq toilets (3) - 30 freq oolets (3) - 1 freq ootlet (3) - 4 freq outfits (3) - 2 freq houlets (3) - 1 freq ootlins (4) - 2 freq tablets (4) - 7 freq lets (4) - 72 freq quilts (4) - 2 freq ootfits (4) - 4 freq tles (4) - 1 freq ootlays (4) - 2 freq ootlaws (4) - 1 freq tilts (4) - 8 freq teets (4) - 2 freq violets (4) - 16 freq flets (4) - 7 freq plets (4) - 1 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 |
OUTLETS |
| Time to execute Levenshtein function - 0.315411 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.673473 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.036288 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.048322 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.001134 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. |