Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oyster-sappy (0) - 1 freq oyster-scap (3) - 1 freq eyster-shalls (5) - 1 freq hysterically (5) - 2 freq strappy (5) - 2 freq oysters (5) - 2 freq water-supply (5) - 1 freq yesterday (6) - 135 freq hysterical (6) - 14 freq ulster-scot (6) - 4 freq yisterday (6) - 39 freq scrappy (6) - 4 freq hysteria (6) - 9 freq waste-paper (6) - 2 freq sisters-dey (6) - 1 freq sae-say (6) - 1 freq winter-day (6) - 1 freq oxster-high (6) - 1 freq ostensibly (6) - 4 freq latter-day (6) - 1 freq systers (6) - 1 freq stroppy (6) - 1 freq ulster-scots (6) - 643 freq wunter-day (6) - 1 freq 'yesterday (6) - 1 freq |
oyster-sappy (0) - 1 freq oyster-scap (4) - 1 freq strappy (7) - 2 freq water-supply (7) - 1 freq oysters (8) - 2 freq stroppy (8) - 1 freq scrappy (9) - 4 freq eysters (9) - 8 freq star-sign (9) - 1 freq starship (9) - 2 freq ever-supply (9) - 1 freq eyster-shalls (9) - 1 freq ulster-scot (9) - 4 freq efter-shave (10) - 1 freq sterns (10) - 26 freq steel-caps (10) - 1 freq strappin (10) - 10 freq stew-pan (10) - 1 freq sterrs (10) - 7 freq stereotype (10) - 7 freq yisterdays (10) - 8 freq sters (10) - 1 freq after-shave (10) - 2 freq sterotypes (10) - 1 freq stir-fry (10) - 1 freq |
SoundEx code - O236 ostriches - 2 freq oyster - 23 freq oxter - 45 freq oxters - 46 freq oxterin - 7 freq oxtert - 6 freq oyster-scap - 1 freq oxterfaes - 1 freq oysters - 2 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 oxter-cogged - 1 freq ostracise - 1 freq oystercatcher - 1 freq |
MetaPhone code - OSTRSP oyster-sappy - 1 freq |
OYSTER-SAPPY |
Time to execute Levenshtein function - 0.426510 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.698008 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.039191 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.069546 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.001130 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. |