| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fences (0) - 22 freq finces (1) - 1 freq fenced (1) - 7 freq pences (1) - 3 freq fence (1) - 154 freq eence (2) - 319 freq minces (2) - 1 freq offences (2) - 2 freq genres (2) - 13 freq fects (2) - 5 freq dunces (2) - 5 freq fince (2) - 5 freq cence (2) - 3 freq eenies (2) - 15 freq peeces (2) - 1 freq fentest (2) - 1 freq fender (2) - 10 freq frances (2) - 11 freq senses (2) - 56 freq fetches (2) - 4 freq dances (2) - 43 freq winces (2) - 3 freq hence (2) - 33 freq tenses (2) - 8 freq tencel (2) - 1 freq |
fences (0) - 22 freq finces (1) - 1 freq fence (2) - 154 freq funcies (2) - 5 freq fancies (2) - 27 freq pences (2) - 3 freq fenced (2) - 7 freq fends (3) - 5 freq defences (3) - 5 freq lances (3) - 1 freq finches (3) - 1 freq fencin (3) - 1 freq ounces (3) - 1 freq fasces (3) - 1 freq faces (3) - 230 freq fones (3) - 1 freq oonces (3) - 3 freq fines (3) - 7 freq fens (3) - 3 freq nonces (3) - 2 freq forces (3) - 42 freq fleeces (3) - 8 freq menaces (3) - 1 freq farces (3) - 1 freq winces (3) - 3 freq |
SoundEx code - F522 fences - 22 freq fancy's - 1 freq feenishes - 7 freq fence-stobs - 1 freq feinishes - 12 freq fancies - 27 freq fanciest - 2 freq funcies - 5 freq finishes - 8 freq feeneeshes - 2 freq funsize - 1 freq finces - 1 freq finches - 1 freq fence-separated - 1 freq fingaa's - 1 freq |
MetaPhone code - FNSS fences - 22 freq fancy's - 1 freq fancies - 27 freq funcies - 5 freq funsize - 1 freq vinci's - 2 freq finces - 1 freq |
FENCES |
| Time to execute Levenshtein function - 0.202132 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.354555 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.027722 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.038219 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.000885 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. |