Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
munageable (0) - 1 freq manageable (1) - 1 freq stageable (3) - 1 freq unaebl (4) - 1 freq menagerie (4) - 1 freq moveable (4) - 1 freq mungle (4) - 2 freq unviable (4) - 1 freq munaged (4) - 9 freq saveable (4) - 1 freq punishable (4) - 3 freq mengele (4) - 8 freq malleable (4) - 2 freq peaceable (4) - 2 freq mungerel (4) - 1 freq unstable (4) - 1 freq gangable (4) - 1 freq munages (4) - 1 freq munage (4) - 6 freq 'unable (4) - 1 freq unable (4) - 19 freq chargeable (4) - 1 freq unmutable (4) - 1 freq lunchable (4) - 2 freq traceable (4) - 1 freq |
munageable (0) - 1 freq manageable (1) - 1 freq mungerel (5) - 1 freq gangable (5) - 1 freq mengele (5) - 8 freq mungle (5) - 2 freq stageable (5) - 1 freq mangle (6) - 4 freq munages (6) - 1 freq munage (6) - 6 freq unable (6) - 19 freq mingle (6) - 10 freq tangible (6) - 4 freq 'unable (6) - 1 freq unviable (6) - 1 freq menagerie (6) - 1 freq unaebl (6) - 1 freq munaged (6) - 9 freq moveable (6) - 1 freq malleable (6) - 2 freq bungle (7) - 2 freq notable (7) - 5 freq enjoyable (7) - 7 freq mang'l (7) - 1 freq meiserable (7) - 1 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 - MNJBL munageable - 1 freq manageable - 1 freq |
MUNAGEABLE |
Time to execute Levenshtein function - 0.226346 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.435398 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.028004 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.037244 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.000977 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. |