| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyplace (0) - 4 freq onieplace (2) - 3 freq naeplace (3) - 2 freq workplace (3) - 2 freq replace (3) - 21 freq i'place (3) - 2 freq onysake (3) - 1 freq someplace (3) - 14 freq by-place (3) - 1 freq 'onieplace (3) - 1 freq onyane (3) - 13 freq onygate (3) - 1 freq ivryplace (3) - 1 freq sumplace (3) - 1 freq aa-place (3) - 1 freq onymare (3) - 2 freq place (3) - 1675 freq i'plate (4) - 1 freq conflate (4) - 1 freq myspace (4) - 1 freq placed (4) - 54 freq onybodie (4) - 5 freq plaece (4) - 11 freq onieane (4) - 1 freq apace (4) - 1 freq |
onyplace (0) - 4 freq onieplace (2) - 3 freq naeplace (3) - 2 freq aa-place (4) - 1 freq 'onieplace (4) - 1 freq i'place (4) - 2 freq place (4) - 1675 freq replace (4) - 21 freq plaice (5) - 13 freq pailace (5) - 8 freq anglice (5) - 1 freq plece (5) - 13 freq nopiece (5) - 2 freq populace (5) - 6 freq placie (5) - 14 freq palace (5) - 98 freq plaece (5) - 11 freq sumplace (5) - 1 freq someplace (5) - 14 freq placey (5) - 2 freq by-place (5) - 1 freq i'placie (5) - 1 freq 'palace (5) - 1 freq ivryplace (5) - 1 freq yplan (6) - 1 freq |
SoundEx code - O514 'onieplace - 1 freq onieplace - 3 freq oonfaaldit - 2 freq onbelever - 1 freq on-follaein - 1 freq onyplace - 4 freq onbelefe - 1 freq onfauldit - 1 freq onfauld - 1 freq onabil - 1 freq |
MetaPhone code - ONPLS 'onieplace - 1 freq onieplace - 3 freq onyplace - 4 freq |
ONYPLACE |
| Time to execute Levenshtein function - 0.187065 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.331198 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.027255 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.037110 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.000762 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. |