| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxtered (0) - 7 freq ordered (2) - 64 freq oxter (2) - 45 freq footered (2) - 5 freq uttered (2) - 10 freq loitered (2) - 1 freq tottered (2) - 3 freq dytered (2) - 1 freq sottered (2) - 1 freq hytered (2) - 3 freq altered (2) - 17 freq oxter's (2) - 1 freq hottered (2) - 6 freq oxters (2) - 45 freq oxtert (2) - 6 freq tootered (2) - 2 freq tortered (2) - 1 freq offered (2) - 47 freq watered (2) - 5 freq petered (2) - 3 freq oxterin (2) - 7 freq entered (2) - 39 freq pottered (2) - 1 freq contered (2) - 2 freq poodered (3) - 10 freq |
oxtered (0) - 7 freq oxtert (3) - 6 freq oxters (3) - 45 freq altered (3) - 17 freq tootered (3) - 2 freq watered (3) - 5 freq entered (3) - 39 freq oxterin (3) - 7 freq hytered (3) - 3 freq petered (3) - 3 freq footered (3) - 5 freq oxter (3) - 45 freq loitered (3) - 1 freq uttered (3) - 10 freq dytered (3) - 1 freq extree (4) - 1 freq touered (4) - 1 freq textured (4) - 2 freq oxford (4) - 27 freq tooered (4) - 1 freq tred (4) - 33 freq teared (4) - 1 freq tired (4) - 98 freq oxterfae (4) - 1 freq stored (4) - 15 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 - OKSTRT oxtert - 6 freq oxtered - 7 freq |
OXTERED |
| Time to execute Levenshtein function - 0.181529 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.356581 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.027652 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.037099 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.000844 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. |