| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| minesweeper (0) - 1 freq sweeper (4) - 3 freq innkeeper (4) - 1 freq timekeeper (4) - 3 freq neeper (5) - 5 freq moneylender (5) - 2 freq mienewspaper (5) - 1 freq steeper (5) - 1 freq sweeped (5) - 2 freq gatekeeper (5) - 1 freq likeweese (5) - 1 freq peesweeps' (5) - 1 freq minister (5) - 67 freq minestrone (5) - 1 freq windswept (5) - 1 freq mineer (5) - 2 freq win-swept (5) - 1 freq messenger (5) - 33 freq sweemer (5) - 1 freq newspepper (5) - 2 freq eoinsweeney (5) - 1 freq peesweeps (5) - 2 freq milestene (5) - 1 freq in-keper (5) - 1 freq gamekeeper (5) - 3 freq |
minesweeper (0) - 1 freq sweeper (6) - 3 freq minister (7) - 67 freq mienewspaper (7) - 1 freq innkeeper (7) - 1 freq nswer (8) - 1 freq aunswer (8) - 2 freq ministrie (8) - 1 freq sweeter (8) - 7 freq unswer (8) - 6 freq answer (8) - 444 freq minerwell (8) - 1 freq meinister (8) - 34 freq munster (8) - 7 freq monster (8) - 52 freq meenester (8) - 8 freq monsieur (8) - 3 freq 'answer (8) - 2 freq awnswer (8) - 2 freq sleeper (8) - 2 freq answeir (8) - 2 freq ministery (8) - 1 freq hansper (8) - 1 freq conseeder (8) - 14 freq mainser (8) - 2 freq |
SoundEx code - M521 mensefu - 40 freq mensefou - 2 freq monkfeish - 1 freq munageable - 1 freq minesweeper - 1 freq moonscape - 1 freq mancouver - 1 freq municipal - 2 freq monkfish - 2 freq mensefae - 1 freq mansfield - 5 freq mensefuness - 1 freq mense-free - 1 freq mensefulness - 1 freq mince-pies - 1 freq mensefu-like - 1 freq manageable - 1 freq menseful - 1 freq mensfu-like - 1 freq mense-fu - 1 freq mansefield - 1 freq munkibhoy - 1 freq munchbunch - 1 freq moneysavingexp - 1 freq mienewspaper - 1 freq mansplainin - 1 freq memsefciqk - 1 freq mannzabj - 1 freq monkeyflower - 1 freq manseyful - 1 freq |
MetaPhone code - MNSWPR minesweeper - 1 freq |
MINESWEEPER |
| Time to execute Levenshtein function - 0.353996 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.458299 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.030271 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.043811 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.001049 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. |