A method and associated systems for using methods of DNA computing to implement an operation of a natural-language processing (NLP) system. A processor translates components of a slot grammar of the NLP system and an input filler vocabulary into listings of sequences of nucleotides. These sequences are encoded into a set of nucleotide chains, which are then allowed to chemically interact with each other such that the chains automatically bond in ways that are analogous to the way that a traditional computerized NLP system would use inferences and contextual information to fill slots of the slot grammar with tokens of the filler vocabulary. The resulting DNA molecules are extracted and information encoded into sequences of nucleotides comprised by the extracted molecules is decoded to yield a set of all possible strings that may generated by filling slots of the slot grammar with tokens of the vocabulary.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for natural-language processing based on DNA computing, the method comprising: a processor of a computer system translating a grammatical rule of a natural language into a listing of a first sequence of nucleotides, wherein the grammatical rule comprises an ordered set of slots, and wherein each slot of the ordered set of slots is configured to be filled with a compatible token, and wherein a token is a string of characters comprised by a vocabulary of the natural language; the processor further translating a first token of the vocabulary into a listing of a second sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a first nucleotide chain to a second nucleotide chain, wherein nucleotides of the first nucleotide chain are ordered in the first sequence, wherein nucleotides of the second nucleotide chain are ordered in the second sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the first token. 2. The method of claim 1, wherein an unfilled slot of the ordered set of slots is compatible with the first token if a first grammatical classification associated with the unfilled slot matches a second grammatical classification associated with the first token. 3. The method of claim 2, wherein the first grammatical classification and the second grammatical classification each identifies a characteristic selected from a group comprising: a part of speech, a sentence, a clause, a syntactical classification, a semantic classification, and combinations thereof. 4. The method of claim 1, wherein the vocabulary comprises natural-language text entered by a user. 5. The method of claim 1, wherein the vocabulary comprises a dictionary of words comprised by the natural language. 6. The method of claim 1, wherein the bonded pair of nucleotide sequences is further formed by a chemical reaction that occurs when multiple copies of the first sequence of nucleotides and multiple copies of the second sequence of nucleotides are combined in a medium, and wherein duplicate copies of the bonded pair are discarded prior to the decoding. 7. The method of claim 1, wherein the first slot comprises a greater number of nucleotides than does the first token, and wherein the chemical bonding further comprises bonding a marker molecule to each nucleotide of the first slot that is not bonded to a nucleotide of the first token. 8. The method of claim 7, wherein the marker molecule is a hydrocarbon that comprises an open bond that may bond with an oxygen atom of a phosphate group. 9. The method of claim 1, further comprising: the processor determining that the first token comprises an adjacent pair of duplicate substrings; the processor identifying a second token that, other than omitting one occurrence of the duplicate substrings, is identical to the first token; the processor translating the second token into a listing of a third sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a third nucleotide chain to a fourth nucleotide chain, wherein nucleotides of the third nucleotide chain are ordered in the third sequence, wherein nucleotides of the fourth nucleotide chain are ordered in the first sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the second token. 10. The method of claim 1, further comprising providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable program code in the computer system, wherein the computer-readable program code in combination with the computer system is configured to implement the translating, further translating, and decoding. 11. A computer program product, comprising a computer-readable hardware storage device having a computer-readable program code stored therein, said program code configured to be executed by a processor of a computer system to implement a method for natural-language processing based on DNA computing, the method comprising: the processor translating a grammatical rule of a natural language into a listing of a first sequence of nucleotides, wherein the grammatical rule comprises an ordered set of slots, and wherein each slot of the ordered set of slots is configured to be filled with a compatible token, and wherein a token is a string of characters comprised by a vocabulary of the natural language; the processor further translating a first token of the vocabulary into a listing of a second sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a first nucleotide chain to a second nucleotide chain, wherein nucleotides of the first nucleotide chain are ordered in the first sequence, wherein nucleotides of the second nucleotide chain are ordered in the second sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the first token. 12. The computer program product of claim 11, wherein an unfilled slot of the ordered set of slots is compatible with the first token if a first grammatical classification associated with the unfilled slot matches a second grammatical classification associated with the first token, and wherein the first grammatical classification and the second grammatical classification each identifies a characteristic selected from a group comprising: a part of speech, a sentence, a clause, a syntactical classification, a semantic classification, and combinations thereof. 13. The computer program product of claim 11, wherein the vocabulary comprises natural-language text entered by a user. 14. The computer program product of claim 11, wherein the vocabulary comprises a dictionary of words comprised by the natural language. 15. The computer program product of claim 11, wherein the first slot comprises a greater number of nucleotides than does the first token, and wherein the chemical bonding further comprises bonding a marker molecule to each nucleotide of the first slot that is not bonded to a nucleotide of the first token. 16. The computer program product of claim 11, further comprising: the processor determining that the first token comprises an adjacent pair of duplicate substrings; the processor identifying a second token that, other than omitting one occurrence of the duplicate substrings, is identical to the first token; the processor translating the second token into a listing of a third sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a third nucleotide chain to a fourth nucleotide chain, wherein nucleotides of the third nucleotide chain are ordered in the third sequence, wherein nucleotides of the fourth nucleotide chain are ordered in the first sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the second token. 17. A computer system comprising a processor, a memory coupled to said processor, and a computer-readable hardware storage device coupled to said processor, said storage device containing program code configured to be run by said processor via the memory to implement a method for natural-language processing based on DNA computing, the method comprising: the processor translating a grammatical rule of a natural language into a listing of a first sequence of nucleotides, wherein the grammatical rule comprises an ordered set of slots, and wherein each slot of the ordered set of slots is configured to be filled with a compatible token, and wherein a token is a string of characters comprised by a vocabulary of the natural language; the processor further translating a first token of the vocabulary into a listing of a second sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a first nucleotide chain to a second nucleotide chain, wherein nucleotides of the first nucleotide chain are ordered in the first sequence, wherein nucleotides of the second nucleotide chain are ordered in the second sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the first token. 18. The computer system of claim 17, wherein an unfilled slot of the ordered set of slots is compatible with the first token if a first grammatical classification associated with the unfilled slot matches a second grammatical classification associated with the first token, and wherein the first grammatical classification and the second grammatical classification each identifies a characteristic selected from a group comprising: a part of speech, a sentence, a clause, a syntactical classification, a semantic classification, and combinations thereof. 19. The computer system of claim 17, wherein the first slot comprises a greater number of nucleotides than does the first token, and wherein the chemical bonding further comprises bonding a marker molecule to each nucleotide of the first slot that is not bonded to a nucleotide of the first token. 20. The computer system of claim 17, further comprising: the processor determining that the first token comprises an adjacent pair of duplicate substrings; the processor identifying a second token that, other than omitting one occurrence of the duplicate substrings, is identical to the first token; the processor translating the second token into a listing of a third sequence of nucleotides; the processor decoding information represented by a bonded pair of nucleotide sequences, wherein the bonded pair was formed by a chemical bonding of a third nucleotide chain to a fourth nucleotide chain, wherein nucleotides of the third nucleotide chain are ordered in the third sequence, wherein nucleotides of the fourth nucleotide chain are ordered in the first sequence, and wherein the decoded information represents a data structure formed by filling a first slot of the ordered set of slots with the second token.