Information coding based on semantic data reasoning

Patent metadata

Field	Value
Publication number	US-9600771-B2
Application number	US-201213985761-A
Country	US
Kind code	B2
Filing date	Oct 31, 2012
Priority date	Oct 31, 2012
Publication date	Mar 21, 2017
Grant date	Mar 21, 2017

Abstract

Various embodiments of technologies for information coding based on semantic data reasoning are provided. In some examples, a process performs semantic reasoning on semantic sentences of a textual message to generate a code, and embeds the code in the textual message as additional information.

First claim

We claim:

1. A method, comprising:
pretreating a textual message that includes a plurality of semantic sentences suitable for use in generating a sequence of binary bits, with each bit of the sequence of binary bits corresponding to a respective one of the semantic sentences;
determining that a number of the plurality of semantic sentences in the textual message is of a sufficient number to carry a code, wherein the code includes one or more bits;
selecting a subset of the plurality of semantic sentences to carry the code;
embedding the code in the selected subset of the plurality of semantic sentences to generate a pattern of binary bits, wherein the pattern of binary bits corresponding to the selected subset of the plurality of semantic sentences matches a pattern of the one or more bits of the code; and
tagging the selected subset of the plurality of semantic sentences.

2. The method of claim 1 , wherein the pretreating a textual message comprises:
segmenting the textual message into the plurality of semantic sentences; and
analyzing the plurality of semantic sentences to generate the sequence of binary bits.

3. The method of claim 2 , wherein the analyzing the plurality of semantic sentences to generate a sequence of binary bits comprises:
generating a binary 0 when a concept conveyed by a respective one of the semantic sentences is false based on information in a knowledge base; and
generating a binary 1 when the concept conveyed by the respective one of the semantic sentences is true based on the information in the knowledge base.

4. The method of claim 3 , wherein the information in the knowledge base comprises private information.

5. The method of claim 1 , further comprising determining that a semantic richness of the textual message is sufficient to carry the code, by:
comparing the code to the sequence of binary bits; and
determining that the one or more bits of the code can be represented by a corresponding number of binary bits of the sequence of binary bits.

6. The method of claim 1 , wherein the tagging the subset of the plurality of semantic sentences comprises tagging the selected subset of the plurality of semantic sentences such that the binary bit corresponding to each of the tagged semantic sentences indicates a respective one of the bits of the code.

7. The method of claim 1 , wherein the tagging the selected subset of the plurality of semantic sentences comprises prefixing each of the subset of the plurality of semantic sentences with a label.

8. The method of claim 1 , further comprising:
transmitting the textual message with the code embedded therein.

9. The method of claim 8 , wherein the pretreating a textual message comprises:
pretreating the textual message using a knowledge base, and
wherein the transmitting the textual message comprises transmitting the textual message to a receiving party having a duplicate copy of the knowledge base.

10. A non-transitory computer-readable medium storing instructions that, when executed, cause one or more processor to perform operations comprising:
segmenting a textual message into a plurality of semantic sentences;
analyzing the plurality of semantic sentences to generate a sequence of binary bits, wherein each bit of the sequence of binary bits corresponds to a respective one of the plurality of semantic sentences;
determining that a number of the plurality of semantic sentences is suitable to carry a code, wherein the code includes one or more bits;
determining that semantic richness of the textual message is sufficient to carry the code;
selecting a subset of the plurality of semantic sentences to carry the code;
marking the selected subset of the plurality of semantic sentences to carry the code in the textual message; and
transmitting the textual message with the code embedded in the marked selected subset of the plurality of semantic sentences, wherein a pattern of the binary bits corresponding to the selected subset of the plurality of semantic sentences matches a pattern of the one or more bits of the code.

11. The non-transitory computer-readable medium of claim 10 , wherein the determining that semantic richness of the textual message is sufficient to carry the code comprises:
comparing the code to the sequence of binary bits; and
determining that the one or more bits of the code can be represented by a corresponding number of binary bits of the sequence of binary bits.

12. The non-transitory computer-readable medium of claim 10 , wherein the marking the selected subset of the plurality of semantic sentences comprises prefixing each of the subsets of the plurality of semantic sentences with a label.

13. The non-transitory computer-readable medium of claim 10 , wherein the analyzing the plurality of semantic sentences comprises:
analyzing the plurality of semantic sentences using a knowledge base, and
wherein the transmitting the textual message comprises transmitting the textual message to a receiving party having a duplicate copy of the knowledge base.

14. An apparatus, comprising:
a processor coupled to a memory storing executable components, the processor operable to execute or facilitate execution of one or more of the executable components, the executable components comprising:
a first component configured to segment a textual message into a plurality of semantic sentences;
a second component configured to analyze the plurality of semantic sentences to generate a sequence of binary bits, with each bit of the sequence of binary bits corresponding to a respective one of the semantic sentences;
a third component configured to determine that the textual message is suitable to carry a code, wherein the code includes one or more bits;
a fourth component configured to mark a subset of the plurality of semantic sentences to carry the code in the textual message in response to the third component determining that the textual message is suitable to carry the code; and
a fifth component configured to transmit the textual message with the code embedded in the marked subset of the plurality of semantic sentences, wherein a pattern of the binary bits corresponding to the marked subset of the plurality of semantic sentences matches a pattern of the one or more bits of the code.

15. The apparatus of claim 14 , wherein the second component is configured to analyze the plurality of semantic sentences to generate a sequence of binary bits by performing operations comprising:
generating a binary 0 when a concept conveyed by a respective one of the semantic sentences is false based on information in a knowledge base; and
generating a binary 1 when the concept conveyed by the respective one of the semantic sentences is true based on the information in the knowledge base.

16. The apparatus of claim 15 , wherein the information in the knowledge base comprises private information.

17. The apparatus of claim 14 , wherein the third component is configured to determine that the textual message is suitable to carry code that includes one or more bits by performing operations comprising:
determining that a length of the textual message is suitable to carry the code; and
determining that semantic richness of the textual message is sufficient to carry the code.

18. The apparatus of claim 17 , wherein the third component is configured to determine that semantic richness of the textual message is sufficient to carry the code by performing operations comprising:
comparing the code to the sequence of binary bits; and
determining that the one or more bits of

Assignees

• Empire Technology Dev Llc

Inventors

• Li Daqi
• Fang Jun

Classifications

• G06N5/022 Primary

  Knowledge engineering; Knowledge acquisition · CPC title