Lossy text source coding by word length

Patent metadata

Field	Value
Publication number	US-10361980-B2
Application number	US-201715846593-A
Country	US
Kind code	B2
Filing date	Dec 19, 2017
Priority date	Sep 25, 2015
Publication date	Jul 23, 2019
Grant date	Jul 23, 2019

Abstract

According to one embodiment, a method for lossy data compression is provided. The method may also include determining a length and a plurality of bounding characters associated with each data item within the data message. The method may further include encoding each data item within the data message by replacing each data item with the determined length and the determined plurality of bounding characters. The method may also include transmitting the data message to a recipient.

First claim

What is claimed is:

1. A processor-implemented method for lossy data compression, the method comprising:
determining a length and a plurality of bounding characters associated with each data item within a data message;
encoding each data item within the data message, simultaneously, by replacing each data item with the determined length and the determined plurality of bounding characters; and
transmitting the data message to a recipient.

2. The method of claim 1 , wherein the plurality of bounding characters associated with each data item includes at least one of a first character of the data item and a last character of the data item.

3. The method of claim 1 , wherein reconstructing the transmitted data message further comprises:
creating a list of unencoded candidate data items based on the determined length and the determined plurality of bounding characters associated with an encoded data item;
determining an unencoded data item on the list of unencoded candidate data items that corresponds to the encoded data item within the transmitted data message; and
replacing the encoded data item with the determined unencoded data item.

4. The method of claim 3 , wherein determining an unencoded data item includes at least one of implementing natural language algorithms to determine the unencoded data item and implementing user selection of the unencoded data item from the list of unencoded candidate data items.

5. The method of claim 1 , wherein reconstructing the transmitted data message includes implementing a dialogue system.

6. The method of claim 1 , wherein transmitting the data message to a recipient includes establishing a handshake between a sender and the recipient.

7. The method of claim 1 , further comprising:
performing entropy encoding on each encoded data item within the data message.

8. The method of claim 1 , further comprising:
reconstructing the transmitted data message.

9. A computer system for lossy data compression, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage medium, and program instructions stored on at least one of the one or more tangible storage medium for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising:
determining a length and a plurality of bounding characters associated with each data item within a data message;
encoding each data item within the data message, simultaneously, by replacing each data item with the determined length and the determined plurality of bounding characters; and
transmitting the data message to a recipient.

10. The computer system of claim 9 , wherein the plurality of bounding characters associated with each data item includes at least one of a first character of the data item and a last character of the data item.

11. The computer system of claim 9 , wherein reconstructing the transmitted data message further comprises:
creating a list of unencoded candidate data items based on the determined length and the determined plurality of bounding characters associated with an encoded data item;
determining an unencoded data item on the list of unencoded candidate data items that corresponds to the encoded data item within the transmitted data message; and
replacing the encoded data item with the determined unencoded data item.

12. The computer system of claim 11 , wherein determining an unencoded data item includes at least one of implementing natural language algorithms to determine the unencoded data item and implementing user selection of the unencoded data item from the list of unencoded candidate data items.

13. The computer system of claim 9 , wherein reconstructing the transmitted data message includes implementing a dialogue system.

14. The computer system of claim 9 , wherein transmitting the data message to a recipient includes establishing a handshake between a sender and the recipient.

15. The computer system of claim 9 , further comprising:
performing entropy encoding on each encoded data item within the data message.

16. The computer system of claim 9 , further comprising:
reconstructing the transmitted data message.

17. A computer program product for lossy data compression, the computer program product comprising:
one or more computer-readable tangible storage medium and program instructions stored on at least one of the one or more tangible storage medium, the program instructions executable by a processor, the program instructions comprising:
program instructions to determine a length and a plurality of bounding characters associated with each data item within the data message;
program instructions to encode each data item within the data message, simultaneously, by replacing each data item with the determined length and the determined plurality of bounding characters; and
program instructions to transmit the data message to a recipient.

18. The computer program product of claim 17 , wherein the plurality of bounding characters associated with each data item includes at least one of a first character of the data item and a last character of the data item.

19. The computer program product of claim 17 , wherein reconstructing the transmitted data message further comprises:
program instructions to create a list of unencoded candidate data items based on the determined length and the determined plurality of bounding characters associated with an encoded data item;
program instructions to determine an unencoded data item on the list of unencoded candidate data items that corresponds to the encoded data item within the transmitted data message; and
program instructions to replace the encoded data item with the determined unencoded data item.

20. The computer program product of claim 19 , wherein determining an unencoded data item includes at least one of implementing natural language algorithms to determine the unencoded data item and implementing user selection of the unencoded data item from the list of unencoded candidate data items.

Assignees

• IBM

Inventors

• Hunt Hamish C
• Lincoln Nicholas K
• Poole Christopher J
• Woolley Mark A

Classifications

• H03M7/30

  Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction · CPC title

• H04L69/04

  Protocols for data compression, e.g. ROHC · CPC title

• G06F16/1744

  using compression, e.g. sparse files · CPC title

• H04L51/063 Primary

  Content adaptation, e.g. replacement of unsuitable content · CPC title