| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxsters (0) - 8 freq oxster (1) - 4 freq oxters (1) - 45 freq oysters (1) - 1 freq posters (2) - 28 freq systers (2) - 1 freq possters (2) - 1 freq roosters (2) - 3 freq mesters (2) - 1 freq disters (2) - 1 freq tasters (2) - 1 freq festers (2) - 1 freq gowsters (2) - 1 freq roasters (2) - 8 freq misters (2) - 1 freq gousters (2) - 3 freq dusters (2) - 3 freq ulsters (2) - 1 freq masters (2) - 10 freq eysters (2) - 8 freq sisters (2) - 127 freq osiers (2) - 1 freq casters (2) - 2 freq lobsters (2) - 37 freq oxter's (2) - 1 freq |
oxsters (0) - 8 freq oxster (2) - 4 freq oysters (2) - 1 freq oxters (2) - 45 freq casters (3) - 2 freq sisters (3) - 127 freq ulsters (3) - 1 freq pousters (3) - 1 freq masters (3) - 10 freq jesters (3) - 2 freq busters (3) - 1 freq sesters (3) - 3 freq sters (3) - 1 freq coasters (3) - 4 freq dusters (3) - 3 freq wasters (3) - 6 freq eysters (3) - 8 freq gousters (3) - 3 freq disters (3) - 1 freq roosters (3) - 3 freq systers (3) - 1 freq posters (3) - 28 freq tasters (3) - 1 freq mesters (3) - 1 freq roasters (3) - 8 freq |
SoundEx code - O236 ostriches - 2 freq oyster - 23 freq oxter - 45 freq oxters - 45 freq oxterin - 7 freq oxtert - 6 freq oyster-scap - 1 freq oxterfaes - 1 freq oyster-sappy - 1 freq oxster - 4 freq oxsters - 8 freq ostracised - 1 freq oxter-cogglet - 1 freq oxtered - 7 freq ostrich - 1 freq oxterfae - 1 freq oestrogen - 1 freq oxterfus - 1 freq oxster-high - 1 freq oxter-staffs - 1 freq oxter's - 1 freq oysters - 1 freq oxter-cogged - 1 freq ostracise - 1 freq oystercatcher - 1 freq |
MetaPhone code - OKSSTRS oxsters - 8 freq |
OXSTERS |
| Time to execute Levenshtein function - 0.201657 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.368255 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.027490 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.037059 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.000848 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. |