| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oceans (0) - 16 freq ocean (1) - 63 freq ocean's (1) - 4 freq scrans (2) - 3 freq 'means (2) - 1 freq crans (2) - 1 freq geans (2) - 2 freq means (2) - 542 freq cans (2) - 45 freq cleans (2) - 9 freq peans (2) - 1 freq 'weans (2) - 1 freq opens (2) - 62 freq gleans (2) - 1 freq omens (2) - 3 freq chans (2) - 1 freq owens (2) - 3 freq ovens (2) - 4 freq orleans (2) - 5 freq lochans (2) - 8 freq jeans (2) - 53 freq deans (2) - 3 freq organs (2) - 10 freq ceann (2) - 1 freq obrans (2) - 1 freq |
oceans (0) - 16 freq cans (2) - 45 freq ocean's (2) - 4 freq ocean (2) - 63 freq oceanic (3) - 1 freq cheans (3) - 2 freq oens (3) - 1 freq eans (3) - 10 freq ceann (3) - 1 freq queans (3) - 5 freq clans (3) - 26 freq leans (3) - 16 freq canes (3) - 2 freq cuns (3) - 1 freq cons (3) - 4 freq coins (3) - 50 freq icons (3) - 9 freq cains (3) - 1 freq scans (3) - 4 freq deans (3) - 3 freq beans (3) - 64 freq weans (3) - 615 freq opens (3) - 62 freq canus (3) - 1 freq peans (3) - 1 freq |
SoundEx code - O252 oceans - 16 freq ocean's - 4 freq oceanographic - 1 freq oceanic - 1 freq oshin's - 1 freq o'consultatioin - 1 freq ossianic - 1 freq okoyong - 1 freq ossian's - 1 freq osmosis - 1 freq oqnsrdnfp - 1 freq ogxmocxsqg - 1 freq ossians - 1 freq oxgangstrinity - 1 freq |
MetaPhone code - OSNS oceans - 16 freq ocean's - 4 freq ossian's - 1 freq ossians - 1 freq |
OCEANS |
| Time to execute Levenshtein function - 0.191268 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.330703 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.027303 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.037165 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.000842 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. |