COMPUTING DEVICE AND METHOD FOR COMPARING TEXT DATA

• US 20120259618A1
• Filed: 12/30/2011
• Published: 10/11/2012
• Est. Priority Date: 04/06/2011
• Status: Abandoned Application

• Current Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Original Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Inventors: LEE, CHUNG-I, LIN, HAI-HONG, XIE, DE-YI, TAO, SHUAI-JUN, YI, ZHI-QIANG, LUO, AN-SHENG, JIANG, WEI
• Application Number:
  US13/340,705
• Publication Number:
  US 20120259618A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/194 Calculation of difference between files

Abstract

A method for comparing text data reads two patent documents comprising varying text sections. The method compares characters of a first text section in a first patent document with a corresponding second text section in a second patent document, and acquires a same sub-character string that has a maximum matching length and matching positions of the first and second text sections. The method marks characters before the matching positions of the first and second text sections as different characters. The method displays a comparison result list of the comparison between the first patent document and the second patent document on a display device.

Claims

1. A method being processed by a processor of a computing device, the method comprising:

(a) comparing characters of a first text section in a first patent document with a corresponding second text section in a second patent document, and acquiring a same sub-character string that has a maximum matching length and matching positions of the first and second text sections, and marking characters before the matching positions of the first and second text sections as different characters; and

(b) displaying a comparison result list of the comparison between the first patent document and the second patent document on a display device.

2. The method as claimed in claim 1, wherein the step (a) comprises:

(a1) extracting the first text section recorded as a character string A from the first patent document, and extracting the corresponding second text section recorded as a character string B from the second patent document, and recording a character string C and a character string D which are both NULL;

(a2) matching characters of the character string A in the character string B in response that both of the lengths of the character string A and the character string B are greater than zero, and acquiring the same sub-character string that has the maximum matching length and matching positions of the character string A and the character string B;

(a3) marking the characters before the matching position of the character string A and the characters before the matching position of the character string B as different characters, in response that at least one of the matching positions of the character string A and the character string B is not less than zero;

(a4) acquiring a new character string A1, a new character string B1, a new character string C1 and a new character string D1 according to the maximum matching length and the matching positions of the character string A and the character string B, then returning to the step (a2); and

(a5) marking all of the characters in the character string A as different characters, and removing the different characters in the character string A to the character string C, and/or marking all of the characters in the character string B as different characters, and removing the different characters in the character string B to the character string D, in response that the length of at least one of the character string A and the character string B is zero, or the matching positions of the character string A and the character string B are both less than zero.

3. The method as claimed in claim 2, wherein the new character string A1 is the characters that follow the matched characters in the character string A, and the new character string B1 is the characters that follow the matched characters in the character string B, and the new character string C1 is the character string C adding the different characters and the matched characters in the character string A, and the new character string D1 is the character string D adding the different characters and the matched characters in the character string B.

4. The method as claimed in claim 1, wherein the comparison result list is displayed through a web page.

5. A non-transitory storage medium storing a set of instructions, the set of instructions capable of being executed by a processor to perform a method for comparing text data, the method comprising:

(a) comparing characters of a first text section in a first patent document with a corresponding second text section in a second patent document, and acquiring a same sub-character string that has a maximum matching length and matching positions of the first and second text sections, and marking characters before the matching positions of the first and second text sections as different characters; and

(b) displaying a comparison result list of the comparison between the first patent document and the second patent document on a display device.

6. The non-transitory storage medium as claimed in claim 5, wherein the step (a) comprises:

(a1) extracting the first text section recorded as a character string A from the first patent document, and extracting the corresponding second text section recorded as a character string B from the second patent document, and recording a character string C and a character string D which are both NULL;

(a2) matching characters of the character string A in the character string B in response that both of the lengths of the character string A and the character string B are greater than zero, and acquiring the same sub-character string that has the maximum matching length and matching positions of the character string A and the character string B;

(a3) marking the characters before the matching position of the character string A and the characters before the matching position of the character string B as different characters, in response that at least one of the matching positions of the character string A and the character string B is not less than zero;

(a4) acquiring a new character string A1, a new character string B1, a new character string C1 and a new character string D1 according to the maximum matching length and the matching positions of the character string A and the character string B, then returning to the step (a2); and

(a5) marking all of the characters in the character string A as different characters, and removing the different characters in the character string A to the character string C, and/or marking all of the characters in the character string B as different characters, and removing the different characters in the character string B to the character string D, in response that the length of at least one of the character string A and the character string B is zero, or the matching positions of the character string A and the character string B are both less than zero.

7. The non-transitory storage medium as claimed in claim 6, wherein the new character string A1 is the characters that follow the matched characters in the character string A, and the new character string B1 is the characters that follow the matched characters in the character string B, and the new character string C1 is the character string C adding the different characters and the matched characters in the character string A, and the new character string D1 is the character string D adding the different characters and the matched characters in the character string B.

8. The non-transitory storage medium as claimed in claim 5, wherein the comparison result list is displayed through a web page.

9. A computing device, the computing device comprising:

a storage unit;

at least one processor; and

one or more programs stored in the storage unit, executable by the at least one processor, the one or more programs comprising;

a comparison module operable to compare characters of a first text section in a first patent document with a corresponding second text section in a second patent document, and acquire a same sub-character string that has a maximum matching length and matching positions of the first and second text sections, and mark characters before the matching positions of the first and second text sections as different characters; and

a display module operable to display a comparison result list of the comparison between the first patent document and the second patent documents on a display device.

10. The computing device as claimed in claim 9, wherein the comparison module further operable to:

extract the first text section recorded as a character string A from the first patent document, and extracting the corresponding second text section recorded as a character string B from the second patent document, and record a character string C and a character string D which are both NULL;

match characters of the character string A in the character string B in response that both of the lengths of the character string A and the character string B are greater than zero, and acquire the same sub-character string that has the maximum matching length and matching positions of the character string A and the character string B;

mark the characters before the matching position of the character string A and the characters before the matching position of the character string B as different characters, in response that at least one of the matching positions of the character string A and the character string B is not less than zero;

acquire a new character string A1, a new character string B1, a new character string C1 and a new character string D1 according to the maximum matching length and the matching positions of the character string A and the character string B; and

mark all of the characters in the character string A as different characters, and remove the different characters in the character string A to the character string C, and/or mark all of the characters in the character string B as different characters, and remove the different characters in the character string B to the character string D, in response that the length of at least one of the character string A and the character string B is zero, or the matching positions of the character string A and the character string B are both less than zero.

11. The computing device as claimed in claim 10, wherein the new character string A1 is the characters that follow the matched characters in the character string A, and the new character string B1 is the characters that follow the matched characters in the character string B, and the new character string C1 is the character string C adding the different characters and the matched characters in the character string A, and the new character string D1 is the character string D adding the different characters and the matched characters in the character string B.

12. The computing device as claimed in claim 9, wherein the comparison result list is displayed through a web page.