| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootposts (0) - 1 freq ootpost (1) - 1 freq ootcasts (2) - 1 freq roosts (3) - 1 freq compost (3) - 7 freq oothooses (3) - 3 freq boosts (3) - 1 freq ootfits (3) - 4 freq ootlets (3) - 6 freq ootbursts (3) - 1 freq oorpatts (3) - 3 freq ootmest (3) - 1 freq foosts (3) - 2 freq ootcast (3) - 2 freq ootput (3) - 2 freq ootcomes (3) - 9 freq hotspots (3) - 2 freq hotpot (3) - 1 freq ootcottj (3) - 1 freq ootlats (3) - 2 freq lamposts (3) - 1 freq ootsets (3) - 6 freq ootdoors (3) - 9 freq posts (3) - 45 freq noosts (3) - 2 freq |
ootposts (0) - 1 freq ootpost (2) - 1 freq ootcasts (3) - 1 freq gateposts (4) - 1 freq posts (4) - 45 freq ootsets (4) - 6 freq trists (5) - 1 freq trysts (5) - 8 freq ootpit (5) - 28 freq noosts (5) - 2 freq tests (5) - 28 freq pests (5) - 2 freq opposites (5) - 2 freq pasts (5) - 4 freq teapots (5) - 2 freq taests (5) - 1 freq twists (5) - 10 freq trusts (5) - 8 freq tourists (5) - 57 freq poasts (5) - 1 freq papists (5) - 2 freq taypots (5) - 1 freq toasts (5) - 2 freq goalposts (5) - 1 freq ootbursts (5) - 1 freq |
SoundEx code - O312 ootby's - 2 freq oot-bak - 1 freq oot-foxed - 1 freq outfacin - 1 freq ootposts - 1 freq ootfaws - 1 freq ootpost - 1 freq ootouypjrn - 1 freq odybcn - 1 freq |
MetaPhone code - OTPSTS ootposts - 1 freq |
OOTPOSTS |
| Time to execute Levenshtein function - 0.216022 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.391700 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.027983 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.038308 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.000952 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. |