Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootgang (0) - 4 freq ootgane (1) - 1 freq ootgans (1) - 1 freq ootgaans (2) - 1 freq forgang (2) - 1 freq ootgaun (2) - 2 freq ootlan (2) - 1 freq ootgait (2) - 1 freq ootdane (2) - 1 freq ootgate (2) - 1 freq ootgaen (2) - 1 freq ootland (2) - 5 freq cowgang (2) - 1 freq outlan (3) - 2 freq ootlats (3) - 2 freq onthank (3) - 1 freq rorang (3) - 1 freq organs (3) - 12 freq soothing (3) - 3 freq taegang (3) - 1 freq ootlaws (3) - 1 freq thang (3) - 3 freq weygang (3) - 1 freq outling (3) - 2 freq tomlang (3) - 3 freq |
ootgang (0) - 4 freq ootgans (2) - 1 freq ootgane (2) - 1 freq taegang (3) - 1 freq outgoing (3) - 1 freq ootgaen (3) - 1 freq ootgaun (3) - 2 freq ootgaans (3) - 1 freq ingang (4) - 21 freq 'gang (4) - 8 freq outling (4) - 2 freq toting (4) - 1 freq twang (4) - 13 freq gang (4) - 1111 freq trang (4) - 15 freq bygang (4) - 1 freq outgaun (4) - 2 freq outing (4) - 2 freq weygang (4) - 1 freq outgauns (4) - 1 freq tang (4) - 50 freq ootgoin (4) - 1 freq wagang (4) - 1 freq ootgate (4) - 1 freq ootland (4) - 5 freq |
SoundEx code - O325 ootcome - 48 freq ootgang - 4 freq ootsmert - 1 freq ootcom - 1 freq ootsheens - 1 freq ootcumin - 1 freq ootgane - 1 freq ootgaans - 1 freq outcome - 4 freq ootgans - 1 freq outshine - 1 freq ootcum - 20 freq odyssean - 2 freq outcomes - 2 freq ootshine - 3 freq oot-gansh - 1 freq ootcums - 9 freq out-cum - 2 freq outcum - 1 freq outgaun - 2 freq ootcomes - 9 freq ootgaun - 2 freq ootcomin - 1 freq oot-come - 1 freq ootcam - 3 freq out-cam - 1 freq outcam - 1 freq outgauns - 1 freq ootgaen - 1 freq oot-comes - 1 freq ootshines - 1 freq €˜ootcomes - 1 freq outgoing - 1 freq ootgoin - 1 freq |
MetaPhone code - OTKNK ootgang - 4 freq outgoing - 1 freq |
OOTGANG |
Time to execute Levenshtein function - 0.250619 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.556026 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.058416 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.038328 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.001044 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. |