Reformatting multiple paragraphs of text using the formatting of a sample object by creating multiple candidate combinations and selecting a closest match

• US 10,241,974 B2
• Filed: 01/08/2018
• Issued: 03/26/2019
• Est. Priority Date: 04/28/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sun, Xingzhi, Xu, Lin H., Yu, Yi Q.
• Primary Examiner(s): Paula, Cesar B
• Assistant Examiner(s): Norris, Benjamn J
• Application Number:
  US15/864,046
• Publication Number:
  US 20180129632A1
• Time in Patent Office: 442 Days
• CPC Class Codes: G06F 40/103 Formatting, i.e. changing of presentation of documents automatic justification G06F40/189; automatic line break hyphenation G06F40/191
• CPC Class Codes: G06F 40/16 Automatic learning of transformation rules, e.g. from examples
• CPC Class Codes: G06F 40/166 Editing, e.g. inserting or deleting
• CPC Class Codes: G06F 40/186 Templates
• CPC Class Codes: G06F 40/194 Calculation of difference between files
• CPC Class Codes: G06F 40/30 Semantic analysis

Abstract

The invention relates to electronic document processing. Embodiments of the present invention relate to a method and apparatus for copying a text format pattern. In one embodiment of the present invention there is a method for copying a text format pattern, including: receiving a selection of a sample object from a user, the sample object including multiple sample paragraphs of which at least two sample paragraphs have different format patterns; receiving a format copying instruction of from the user, the format copying instruction indicating reformatting a target object with the format pattern of the sample object, where the target object contains multiple target paragraphs; determining a corresponding relationship of the format pattern of the sample paragraphs with the target paragraphs; and applying the format pattern of the sample paragraphs to the target paragraphs in accordance with the corresponding relationship.

Claims

1. A computer system for reformatting a plurality of target paragraphs with a format pattern of a plurality of sample paragraphs, the computer system comprising one or more computer processors, one or more computer-readable storage media, and program instructions stored on the one or more computer-readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:

program instructions to generate a sample combination by dividing the plurality of sample paragraphs into sample groups according to their order and format pattern, each sample group includes adjacent sample paragraphs of the same format pattern;

program instructions to generate a plurality of different candidate combinations by assigning the plurality of target paragraphs to the sample groups, wherein each of the plurality of candidate combinations comprises a different combination of target paragraphs and sample groups, and each of the plurality of target paragraphs is assigned to only one sample group for each of the plurality of candidate combinations;

program instructions to select two or more preferred candidate combinations from the plurality of candidate combinations based on a degree of similarity between the sample combination and each of the plurality of candidate combinations;

program instructions to select a single matching combination from the two or more preferred candidate combinations; and

program instructions to apply the format pattern of the plurality of sample paragraphs to the plurality of target paragraphs in accordance with the single matching combination.

2. The computer system of claim 1, wherein the plurality of sample paragraphs are arranged in a sequential order and each sample paragraph comprises a position in that sequential order, wherein the plurality of target paragraphs are arranged in a sequential order and each target paragraph comprises a position in that sequential order, further comprising:

program instructions to compare the format pattern of sample paragraphs and target paragraphs with the same position.

3. The computer system of claim 1, wherein the number of sample groups is less than or equal to the number of sample paragraphs, and the number of sample groups is less than or equal to the number of target paragraphs.

4. The computer system of claim 1, further comprising:

program instructions to compare a positional relationship between the sample paragraphs to a positional relationship between the target paragraphs.

5. The computer system of claim 1, further comprising:

program instructions to conduct semantic analysis on the content of the sample paragraphs and the content of the target paragraphs to determine a relationship between the content of the sample paragraphs and the content of the target paragraphs.

6. The computer system of claim 1, wherein the sample object and the target object are from different electronic documents.

7. The computer system of claim 1, wherein the possible combinations are determined using the equation:

n=(N−

1)/[(M−

1)! (NM)!], where n is the number of possible combinations.

8. The computer system of claim 1, the content of the sample paragraph is textual and each of the sample paragraphs is separated by a pre-defined delimiters.

9. A computer system for reformatting a set of target paragraphs with a format pattern of a set of sample paragraphs, the computer system comprising one or more computer processors, one or more computer-readable storage media, and program instructions stored on the one or more computer-readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:

program instructions to generate a sample combination by dividing the set of sample paragraphs into sample groups according to their order and format pattern, each sample group includes adjacent sample paragraphs of the same format pattern;

program instructions to determine a plurality of all possible combinations of the set of target paragraphs and the sample groups, wherein each of the target paragraphs is assigned to only one sample group for each possible combination;

program instructions to calculate a degree of similarity between the sample combination and each of the possible combinations, the degree of similarity is the sum of the number of operations of removing a target paragraph from a sample group for each of the possible combinations and the number of operations of adding a target paragraph to a sample group for each of the possible combinations in order for each of the possible combination to match the sample combination;

program instructions to select two or more preferred combinations from the plurality of possible combinations based on the degree of similarity between the sample combination and each of the possible combinations, wherein the two or more preferred combinations comprises the smallest degree of similarity;

program instructions to select a matching combination from the two or more preferred candidate combinations, the single matching combination having the same combination of target paragraphs and sample groups as the sample combination; and

program instructions to apply the format pattern of the set of sample paragraphs to the set of target paragraphs based on the single matching combination.

10. The computer system of claim 9, wherein the plurality of sample paragraphs are arranged in a sequential order and each sample paragraph comprises a position in that sequential order, wherein the plurality of target paragraphs are arranged in a sequential order and each target paragraph comprises a position in that sequential order, further comprising:

program instructions to compare the format pattern of sample paragraphs and target paragraphs with the same position.

11. The computer system of claim 9, wherein the number of sample groups is less than or equal to the number of sample paragraphs, and the number of sample groups is less than or equal to the number of target paragraphs.

12. The computer system of claim 9, further comprising:

program instructions to compare a positional relationship between the sample paragraphs to a positional relationship between the target paragraphs.

13. The computer system of claim 9, further comprising:

program instructions to conduct semantic analysis on the content of the sample paragraphs and the content of the target paragraphs to determine a relationship between the content of the sample paragraphs and the content of the target paragraphs.

14. The computer system of claim 9, wherein the sample object and the target object are from different electronic documents.

15. The computer system of claim 9, wherein the possible combinations are determined using the equation:

n=(N−

1)/[(M−

1)! (NM)!], where n is the number of possible combinations.

16. The computer system of claim 9, the content of the sample paragraph is textual and each of the sample paragraphs is separated by a pre-defined delimiters.