| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootfield (0) - 1 freq notified (3) - 2 freq heyfield (3) - 3 freq midfield (3) - 18 freq cornfield (3) - 2 freq ootgies (3) - 1 freq field (3) - 230 freq renfield (3) - 2 freq hayfield (3) - 3 freq ootrel (3) - 3 freq northfield (3) - 1 freq nuffield (3) - 3 freq ootrels (3) - 18 freq hadfield (3) - 4 freq bothied (3) - 2 freq ootsiyd (3) - 1 freq seafield (3) - 7 freq hoofjeld (3) - 1 freq ooted (3) - 1 freq broomfield (3) - 1 freq ontied (3) - 1 freq ootsized (3) - 1 freq downfield (3) - 1 freq afield (3) - 8 freq ootliers (3) - 1 freq |
ootfield (0) - 1 freq seafield (4) - 7 freq hayfield (4) - 3 freq enfield (4) - 7 freq mayfield (4) - 4 freq field (4) - 230 freq afield (4) - 8 freq heyfield (4) - 3 freq linfield (5) - 2 freq ootlined (5) - 7 freq ootfits (5) - 4 freq ootfit (5) - 12 freq renfield (5) - 2 freq ootwaled (5) - 1 freq feeld (5) - 1 freq toffed (5) - 1 freq onfauld (5) - 1 freq tfel (5) - 1 freq southfield (5) - 1 freq ootsized (5) - 1 freq notified (5) - 2 freq ootsiyd (5) - 1 freq nuffield (5) - 3 freq midfield (5) - 18 freq hadfield (5) - 4 freq |
SoundEx code - O314 ootfield - 1 freq oot-o-place - 1 freq outblent - 1 freq out-flist - 1 freq oddball - 1 freq ootflank - 1 freq outplayed - 1 freq |
MetaPhone code - OTFLT ootfield - 1 freq |
OOTFIELD |
| Time to execute Levenshtein function - 0.222127 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.374520 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.033249 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.037188 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.000969 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. |