Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
getmethinagain (0) - 1 freq germinatin (6) - 1 freq something (7) - 451 freq somethings (7) - 1 freq getting' (7) - 2 freq oerthinkin (7) - 1 freq re-stringin (7) - 1 freq 'something's (7) - 1 freq yetagain (7) - 1 freq getting (7) - 310 freq lethington (7) - 4 freq shewinsagain (7) - 1 freq determination (7) - 11 freq owerhingin (7) - 3 freq thinggyin (7) - 1 freq gottingen (7) - 1 freq hermetically (8) - 1 freq reengin (8) - 34 freq eemitatin (8) - 1 freq mesmerizin (8) - 1 freq ettilin (8) - 1 freq chingin (8) - 3 freq everthings (8) - 1 freq stinkin-gin (8) - 1 freq saft-hingin (8) - 1 freq |
getmethinagain (0) - 1 freq gottingen (9) - 1 freq getting (10) - 310 freq getting' (10) - 2 freq germinatin (10) - 1 freq somethings (10) - 1 freq something (10) - 451 freq strathvaigin (11) - 3 freq gitting (11) - 12 freq stame-ingine (11) - 2 freq gutting (11) - 1 freq teathings (11) - 1 freq getitchanged (11) - 1 freq quait-hingin (11) - 1 freq sumthing (11) - 24 freq oerthinkin (11) - 1 freq re-stringin (11) - 1 freq 'something's (11) - 1 freq owerhingin (11) - 3 freq lethington (11) - 4 freq thinggyin (11) - 1 freq onhingin (12) - 1 freq meetings (12) - 16 freq getherin (12) - 34 freq machineman (12) - 2 freq |
SoundEx code - G353 good-naturt - 2 freq goodnaturtly - 1 freq guid-naitured - 2 freq guidmither - 3 freq guid-naturet - 1 freq gotten't - 1 freq god-damned - 1 freq guid-mither - 6 freq guid-mithers - 1 freq guid-naturedly - 1 freq guid-natured - 2 freq gweed-mither - 1 freq godmither - 3 freq good-naturedly - 2 freq gate-end - 1 freq goodnatured - 1 freq god-damnt - 1 freq gud-naturt - 2 freq getmethinagain - 1 freq gdnd - 1 freq gcdnd - 1 freq |
MetaPhone code - JTM0NKN getmethinagain - 1 freq |
GETMETHINAGAIN |
Time to execute Levenshtein function - 0.237941 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.395372 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.031874 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.038536 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.000979 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. |