Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
micro-press (0) - 2 freq compress (4) - 1 freq microwaves (4) - 2 freq decompress (4) - 1 freq vice-preses (4) - 1 freq hinny-press (4) - 1 freq mirk-ness (4) - 1 freq microsoft's (5) - 1 freq microphones (5) - 1 freq misstress (5) - 1 freq mirrors (5) - 25 freq i'press (5) - 1 freq mirkness (5) - 3 freq progress (5) - 96 freq ixpress (5) - 1 freq mirrens (5) - 1 freq repress (5) - 6 freq microwave (5) - 16 freq mirror's (5) - 1 freq cypress (5) - 2 freq microns (5) - 1 freq nicobarese (5) - 1 freq micro-waith (5) - 1 freq ukcongress (5) - 1 freq mince-pies (5) - 1 freq |
micro-press (0) - 2 freq vice-preses (6) - 1 freq decompress (7) - 1 freq hinny-press (7) - 1 freq compress (7) - 1 freq impress (8) - 23 freq crapless (8) - 1 freq hot-press (8) - 1 freq cypress (8) - 2 freq ahrcpress (8) - 1 freq wordpress (8) - 3 freq repress (8) - 6 freq microphones (8) - 1 freq mirk-ness (8) - 1 freq microwaves (8) - 2 freq comprises (9) - 4 freq acroess (9) - 1 freq microcosm (9) - 1 freq morroless (9) - 1 freq micro-licht (9) - 1 freq mistress (9) - 111 freq scotexpress (9) - 2 freq creepiness (9) - 2 freq microphone (9) - 5 freq caur-parks (9) - 1 freq |
SoundEx code - M261 miserable - 57 freq meiserable - 1 freq meeserable - 6 freq meesrable - 2 freq microwave - 16 freq microphone - 5 freq micrawave - 1 freq mïserable - 1 freq meeserably - 1 freq microwaves - 2 freq 'microwave' - 2 freq 'microwave - 1 freq micro-press - 2 freq misrepresents - 1 freq mockrife - 1 freq mockrife-like - 1 freq misrepresentation - 1 freq mcrobert - 1 freq microphones - 1 freq mokryfe - 1 freq misreportit - 1 freq meisurable - 2 freq micrawaved - 2 freq magggerafelt - 1 freq mackerafelt - 1 freq miserably - 3 freq microbrewery - 1 freq macarifdn - 2 freq mycarpetsfecked - 1 freq |
MetaPhone code - MKRPRS micro-press - 2 freq |
MICRO-PRESS |
Time to execute Levenshtein function - 0.282852 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.439357 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.028981 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.038299 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.000914 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. |