Summary text tagging method and apparatus, device and computer storage medium thereof

Abstract

To provide a tagging method of a summary text, apparatus, device and storage medium capable of quickly acquiring a corresponding position of the summary text in an original text.SOLUTION: A method includes the steps of: executing first matching processing on a first part having a first number of characters in a summary text and an original text to acquire a first matching result, and an original text; when the first matching result indicates that the original text includes no text matching the first part, selecting a second part having the second number of characters in the summary text from the first part, and performing second matching processing with the original text to acquire a second matching result; and tagging correspondence between the characters of the summary text and the original text based on the first matching result and the second matching result.SELECTED DRAWING: Figure 2

Description

[Technical field]

[0001] The present disclosure relates to the field of text processing based on artificial intelligence technology, and in particular to a method for tagging a summary text, an apparatus for tagging a summary text, a device for tagging a summary text, and a computer storage medium. [Background technology]

[0002] Natural language processing (NLP) is one of the important application fields of artificial intelligence technology. Natural language processing enables computers to read text like humans, understand the meaning in the text, and complete specific applications such as machine translation, automatic question answering, information retrieval, sentiment analysis, automatic text summarization, etc. In natural language processing, text summary extraction performs advanced generalization and abstraction on text with clear meaning to generate a summary of the text. A text summary extraction system based on a deep neural network can realize the extraction of a text summary that is independent of the specific content and text length of the text. A natural language processing system based on a deep neural network usually receives the original text of the summary to be extracted, and then directly outputs the extracted summary text. However, it is difficult for a user to identify its position in the original text from the directly output summary text. For example, if a user wants to read the relevant part of the original text in detail based on the content of the summary text, the longer the original text, the more difficult it is to identify the relevant part. Summary of the Invention [Problem to be solved by the invention]

[0003] In order to intuitively show the user the corresponding position of the summary text in the original text, the summary text and the original text need to be compared and matched character by character, and when the summary text and the original text are long, such a matching process takes a very long time. The original text may have multiple matching positions for a character or character string in the summary text, and it is necessary to determine the optimal position from among the multiple matching positions. In addition, the summary text includes generated characters, and it is necessary to determine whether the generated characters should be matched with the original text.

[0004] In view of the above problems, the present disclosure provides a method for tagging a summary text, an apparatus for tagging a summary text, a device for tagging a summary text, and a computer storage medium. [Means for solving the problem]

[0005] According to one aspect of the present disclosure, there is provided a method for tagging a summary text, the summary text being generated based on an original text, the method for tagging the summary text comprising the steps of: performing a first matching process on a first portion of the summary text having a first number of characters and the original text to obtain a first matching result; if the first matching result indicates that there is no text in the original text that matches the first portion, selecting a second portion of the summary text having a second number of characters from the first portion, and performing a second matching process with the original text to obtain a second matching result; and tagging correspondences between characters of the summary text and the original text based on the first matching result and the second matching result.

[0006] In addition, according to one embodiment of the present disclosure, the method for tagging summary text further includes a step of repeatedly performing multiple cycles of the first matching process and the second matching process until all of the summary text is matched, wherein the first number of first matching processes in one cycle of the multiple cycles is the same as the first number of first matching processes in a previous cycle.

[0007] Furthermore, according to the method for tagging summary text in one aspect of the present disclosure, the first number is determined by the length of the sentence of the summary text in which the first portion is located.

[0008] Furthermore, according to a method for tagging summary text in one aspect of the present disclosure, the step of tagging the correspondence between the characters of the summary text and the original text based on the first matching result and the second matching result includes, when the first matching result or the second matching result indicates that there are multiple matching positions in the original text that match the first portion or the second portion, determining an optimal matching position from the multiple matching positions based on the similarity between the original text at the multiple matching positions and adjacent portions of the first portion or the second portion.

[0009] In addition, according to one aspect of the present disclosure, the method for tagging summary text further includes a step of determining whether generated characters of a predetermined length in the summary text have practical meaning, and a step of not performing the first matching process and the second matching process on the generated characters that have no practical meaning.

[0010] According to another aspect of the present disclosure, there is provided a tagging device for a summary text, the summary text being generated based on an original text, the tagging device for the summary text including: a first matching unit that performs a first matching process on a first portion of the summary text having a first number of characters and the original text to obtain a first matching result; a second matching unit that, when the first matching result indicates that there is no text in the original text that matches the first portion, selects a second portion of the summary text having a second number of characters from the first portion, and performs a second matching process with the original text to obtain a second matching result; and a tagging unit that tags correspondence between characters of the summary text and the original text based on the first matching result and the second matching result.

[0011] In addition, according to another aspect of the present disclosure, in a summary text tagging device, the first matching unit and the second matching unit each repeatedly execute multiple cycles of the first matching process and the second matching process until all of the summary text is matched, and wherein the first number of first matching processes in one cycle among the multiple cycles is the same as the first number of first matching processes in a previous cycle.

[0012] In addition, according to a summary text tagging device in another aspect of the present disclosure, the first number is determined by the length of the sentence of the summary text in which the first portion is located.

[0013] In addition, according to another aspect of the present disclosure, in a summary text tagging device, when the first matching result or the second matching result indicates that there are multiple matching positions in the original text that match the first part or the second part, the tagging unit determines an optimal matching position from the multiple matching positions based on the similarity between the original text at the multiple matching positions and adjacent parts of the first part or the second part.

[0014] In addition, according to another aspect of the present disclosure, in the summary text tagging device, the first matching unit and the second matching unit determine whether or not the generated characters of a predetermined length in the summary text have practical meaning, and do not perform the first matching process and the second matching process on the generated characters that have no practical meaning.

[0015] According to yet another aspect of the present disclosure, there is provided a summary text tagging device, comprising a memory for storing computer readable instructions and a processor for executing the computer readable instructions such that the summary text tagging device performs the summary text tagging method described above.

[0016] According to a further aspect of the present disclosure, there is provided a computer storage medium for storing computer readable instructions which, when executed by a computer, cause the computer to perform the method for tagging summary text as described above.

[0017] As will be described in detail below, according to the summary text tagging method, summary text tagging apparatus, summary text tagging device, and computer storage medium of the present disclosure, in the process of matching the summary text with the original text, there is no need to perform a character-by-character matching process, but instead, different parts of the variable-length summary text are matched with the original text, thereby improving the processing speed of matching and tagging. If the original text has multiple positions that can be matched with the summary text, the optimal position from the multiple positions is tagged as the matching result. In addition, for generated characters of a certain length in the summary text, whether or not to perform matching processing is determined based on whether or not they have practical meaning, thereby avoiding unnecessary matching processing and further improving the speed of the matching processing. The summary text tagging method of the present disclosure allows a user to quickly and intuitively know the corresponding position of the summary text in the original text, resulting in a better reading experience.

[0018] It is to be understood that both the foregoing general description and the following detailed description are exemplary and are intended to provide further explanation of the technology for which protection is sought. [Brief description of the drawings]

[0019] The above and other objects, features, and advantages of the present disclosure will become more apparent by describing the embodiments of the present disclosure in more detail with reference to the drawings. The drawings are used to provide a further understanding of the embodiments of the present disclosure, constitute a part of the specification, and are used to explain the present disclosure together with the embodiments of the present disclosure, and do not constitute limitations on the present disclosure. In the drawings, the same reference numerals generally represent the same components or steps. [Figure 1] FIG. 2 is a schematic diagram outlining an application scenario of the method for tagging summary text according to an embodiment of the present disclosure; [Diagram 2] 1 is a flow chart illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 3A] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 3B] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 4] 4 is a flow chart further illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 5A] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 5B] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 5C] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 5D] FIG. 2 is a schematic diagram illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 6A] FIG. 2 is a schematic diagram further illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 6B] FIG. 2 is a schematic diagram further illustrating a method for tagging summary text according to an embodiment of the present disclosure. [Figure 7] FIG. 2 is a block diagram illustrating a summary text tagging apparatus according to an embodiment of the present disclosure. [Figure 8] FIG. 2 is a hardware block diagram illustrating a summary text tagging device according to an embodiment of the present disclosure. [Figure 9] FIG. 2 is a schematic diagram illustrating a computer-readable storage medium according to an embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0020] In order to make the objectives, technical solutions and advantages of the present disclosure clearer, exemplary embodiments according to the present disclosure are described in detail below with reference to the drawings. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, and are not all of the embodiments of the present disclosure. It should be understood that the present disclosure is not limited by the exemplary embodiments described herein.

[0021] First, with reference to FIG. 1, an application scenario of the method for tagging a summary text according to an embodiment of the present disclosure will be described.

[0022] Fig. 1 is a schematic diagram outlining an application scenario of a method for tagging a summary text according to an embodiment of the present disclosure. As shown in Fig. 1, the method for tagging a summary text according to an embodiment of the present disclosure can be applied to a natural language processing system 10. A natural language processing device 100 is disposed in the natural language processing system 10. The natural language processing device 100 performs data communication with user devices 102a to 102c of users 101a to 101c, respectively, via a communication network 103.

[0023] The natural language processing device 100 includes, but is not limited to, a server device having a large-capacity data processing function and a large-capacity data storage function, such as a search engine server and a content providing server. The user devices 102a to 102c include, but are not limited to, a mobile terminal or a fixed terminal having a data processing function, such as a notebook computer, a desktop computer, a smartphone, and a tablet computer. The communication network 103 includes, but is not limited to, the Internet, IPTV network, Wireless Fidelity (Wi-Fi) network, Wireless Local Area Network (WLAN), Local Area Network (LAN) and / or Metropolitan Area Network (MAN), etc., arranged according to Transmission Control Protocol and Internet Protocol (TCP / IP), User Datagram Protocol (UDP), Hypertext Transfer Protocol (HTTP) and / or File Transfer Protocol (FTP), etc.

[0024] In the embodiment of the present disclosure, the natural language processing system 10 is, for example, a summary text generation system. For example, when a news service provider provides news information, whether it provides single news or aggregated news, a user may not want to read the full text or many related news, but may want to see a summary. The natural language processing system 10 as a summary text generation system can summarize the entire news into a news summary text with a clear title and a few sentences of synopsis through the semantic analysis of the entire page. When a user sees the news summary text, the user expects the natural language processing system 10 to be able to tag the specific location of the news summary text in the original text if the user wants to read the corresponding part of the original text in more detail according to the content of the summary text.

[0025] In an embodiment of the present disclosure, the natural language processing apparatus 100 is, for example, a summary text generation apparatus. The natural language processing apparatus 100 receives a summary text generation request submitted by the user devices 102a to 102c via a communication network 103. The natural language processing apparatus 100 automatically extracts and generates a summary text based on a semantic analysis of a full page, and provides the generated summary text to the users 101a to 101c.

[0026] As will be described in detail below, the method of tagging a summary text of the present disclosure implemented in the natural language processing system 10 does not need to perform a character-by-character matching process in the process of matching the summary text with the original text, but instead matches different parts of the summary text of variable length with the original text, thereby improving the speed of the matching and tagging process. If the original text has multiple positions that can be matched with the summary text, the optimal position from the multiple positions is tagged as the matching result. In addition, for generated characters of a certain length in the summary text, whether or not to perform a matching process is determined depending on whether or not they have a practical meaning, thereby avoiding unnecessary matching processes and further improving the speed of the matching process. The method of tagging a summary text of the present disclosure allows a user to quickly and intuitively know the corresponding position of the summary text in the original text, resulting in a better reading experience.

[0027] Hereinafter, the method for tagging a summary text according to an embodiment of the present disclosure will be described with reference to Figures 2 to 3B. Figure 2 is a flow chart showing the method for tagging a summary text according to an embodiment of the present disclosure. Figure 3 is a schematic diagram showing the method for tagging a summary text according to an embodiment of the present disclosure.

[0028] As shown in FIG. 2, the method for tagging summary text according to an embodiment of the present disclosure includes the following steps.

[0029] In step S201, a first matching process is performed on a first portion of the summary text having a first number of characters and an original text to obtain a first matching result. In one embodiment of the present disclosure, the summary text is generated based on the original text. Different from matching the summary text with the original text character by character, a method of partially matching the summary text is used.

[0030] For example, as shown in Figure 3A, the original text is W1W2W3W5W6W9W7, and the generated summary text is W3W5W9W7, where W represents one character.

[0031] As shown in FIG. 3B, in the method for tagging summary text according to an embodiment of the present disclosure, a first portion of the summary text having a first number of characters is taken as the text to be matched, and a first matching process is performed with the original text, that is, the first matching process is performed between a first portion of the summary text having three characters, W3W5W9, and the original text, W1W2W3W5W6W9W7.

[0032] Returning to FIG. 2, in step S202, it is determined whether or not the first matching has been successful in the first matching process.

[0033] If the result of step S202 is "Yes", i.e., if the first matching is successful, the process proceeds to step S204 to tag the correspondence between the characters (first portion) of the summary text and the original text based on the first matching result. If the result of step S202 is "No", i.e., if the first matching is unsuccessful, the process proceeds to step S203.

[0034] In step S203, a second portion having a second number of characters in the summary text is selected from the first portion, and a second matching process with the original text is performed to obtain a second matching result.

[0035] As shown in Fig. 3B, when a first matching process is performed on a first portion W3W5W9 having three characters in the summary text and the original text W1W2W3W5W6W9W7, the first matching fails because there is no portion in the original text W1W2W3W5W6W9W7 that matches with the first portion W3W5W9. A second portion W3W5 having a second number of characters in the summary text is selected from the first portion W3W5W9, and a second matching process with the original text is performed to obtain a second matching result. The second matching result indicates that there is a portion in the original text that matches with the second portion W3W5.

[0036] Returning to Fig. 2, after step S203, the process proceeds to step S204, in which the correspondence between the characters of the summary text and the original text is tagged based on the first matching result and the second matching result.

[0037] As will be described below with reference to FIG. 4, if the summary text includes multiple first portions, processing returns to repeat the matching process until all characters of the summary text have been matched.

[0038] As shown in Fig. 3B, after the first matching process and the second matching process in the first cycle, W9W7 remains in the summary text to be matched. In the first matching process in the second cycle, the first matching process is executed on a first portion W9W7 having two characters in the summary text and the original text W1W2W3W5W6W9W7, and matching is successful. As will be described later with reference to Figs. 4 to 5D, the character length of the first portion in the first matching process in the second cycle may be set to the same as the character length of the first portion in the previous first matching process, or may be determined based on the length of the sentence of the summary text in which the first portion to be matched this time is located.

[0039] In the method for tagging a summary text according to an embodiment of the present disclosure described with reference to Figures 2 to 3B, a matching process is performed on different parts of a variable-length summary text and an original text, specifically, the matching of the example in Figures 3A and 3B is completed by three matching processes. If a character-by-character matching process is used for the same example, at least four matching processes are required. Therefore, the method for tagging a summary text according to an embodiment of the present disclosure can reduce the number of matching processes, thereby improving the speed of the matching and tagging processes.

[0040] Hereinafter, the method for tagging summary text according to an embodiment of the present disclosure will be further described with reference to Figures 4 to 5D. Figure 4 is a flow chart further illustrating the method for tagging summary text according to an embodiment of the present disclosure, and Figures 5A to 5D are schematic diagrams further illustrating the method for tagging summary text according to an embodiment of the present disclosure.

[0041] Steps S401 to S403 shown in Fig. 4 are the same as steps S201 to S203 shown in Fig. 2, and the overlapping descriptions are omitted here. After step S403, the process proceeds to step S404. In step S404, it is determined whether there are any characters of the summary text that have not been matched.

[0042] If the result of step S404 is "yes", i.e. there are still unmatched summary text characters, the process returns to step S401 to perform partial summary text matching again. If the result of step S404 is "no", i.e. there are no unmatched summary text characters, the process proceeds to step S405 to tag the correspondence between the summary text characters and the original text based on the first matching result and the second matching result.

[0043] 5A and 5B show an example in which the character length of the first portion in the first matching process of the second cycle is the same as the character length of the first portion in the previous first matching process.

[0044] As shown in FIG. 5A, the original text is W1W2W3W5W6W9W7W8, and the generated summary text is W3W5W9W7W8, where W represents one character.

[0045] As shown in Fig. 5B, when a first matching process is performed on a first portion W3W5W9 having three characters in the summary text and an original text W1W2W3W5W6W9W7W8, the first matching fails because there is no portion in the original text W1W2W3W5W6W9W7W8 that matches with the first portion W3W5W9. A second portion W3W5 having a second number of characters in the summary text is selected from the first portion W3W5W9, and a second matching process with the original text is performed to obtain a second matching result. The second matching result indicates that there is a portion in the original text that matches with the second portion W3W5.

[0046] As shown in Fig. 5B, after the first and second matching processes in the first cycle, W9W7W8 remains in the summary text to be matched. In the first matching process in the second cycle, when the first matching process is performed on the first portion W9W7W8 having three characters in the summary text and the original text W1W2W3W5W6W9W7W8, matching is successful. That is, the character length of the first portion in the first matching process in the second cycle is the same as the character length of the first portion in the previous first matching process.

[0047] 5C and 5D show an embodiment in which the character length of the first portion in the first matching process is based on the length of the sentence of the summary text in which the first portion to be matched this time is located.

[0048] As shown in FIG. 5C, the original text is W1W2W3W5W6W9W7W8, and the generated summary text is W2W3.W6W9W7W8, where W represents one character.

[0049] As shown in FIG. 5D, when a first matching process is performed on a first portion W2W3 having two characters in the summary text based on the sentence length of the summary text and the original text W1W2W3W5W6W9W7W8, the first matching is successful because the original text W1W2W3W5W6W9W7W8 contains a portion that matches the first portion W2W3.

[0050] As shown in Fig. 5D, after the first matching process of the first cycle, there is still W6W9W7W8 left in the summary text that needs to be matched. In the first matching process of the second cycle, the first matching process is performed on the first part W6W9W7W8 having four characters in the summary text based on the sentence length of the summary text and the original text W1W2W3W5W6W9W7W8, and the matching is successful.

[0051] 6A and 6B are schematic diagrams further illustrating a method for tagging summary text according to an embodiment of the present disclosure.

[0052] Specifically, Fig. 6A shows an original text, and Fig. 6B shows a summary text generated from the original text. As shown in Figs. 6A and 6B, the original text contains multiple "Olympic Games" that match with the "Olympic Games" in the summary text through a matching process.

[0053] The method for tagging a summary text according to an embodiment of the present disclosure further considers the similarity between the original text and the adjacent parts of the first part or the second part at the multiple matching positions. As shown in Figure 6B, the adjacent part of "Olympic Games" in the summary text is "started more than 2000 years ago", and among many "Olympic Games" in the original text, there is one adjacent part that is the most similar. Therefore, the most similar matching text in the original text is selected as the best matching position, as shown by the boxes in Figures 6A and 6B.

[0054] In addition, the method for tagging a summary text according to an embodiment of the present disclosure determines whether or not a generated character of a predetermined length in the summary text has practical meaning, and does not perform the first matching process and the second matching process on the generated character that has no practical meaning.

[0055] Specifically, as shown in Figure 6B, the summary text includes the generated characters "dewa". Whether or not the generated characters have a practical meaning can be determined based on the part of speech. In this case, the generated characters "dewa" are not a noun and have no practical meaning, so there is no need to perform a matching process with the original text for the generated characters "dewa" that have no practical meaning.

[0056] In the method for tagging a summary text according to an embodiment of the present disclosure described with reference to Figures 6A and 6B, when there are multiple positions in the original text that match the summary text, the most suitable position from the multiple positions can be tagged as the matching result. In addition, for generated characters of a certain length in the summary text, whether or not to perform matching processing is determined depending on whether or not they have practical meaning, thereby avoiding unnecessary matching processing and further improving the speed of the matching processing.

[0057] 7 is a block diagram showing a tagging device for summary text according to an embodiment of the present disclosure. As shown in FIG. 7, the tagging device for summary text 700 according to an embodiment of the present disclosure includes a first matching unit 701, a second matching unit 702 and a tagging unit 703. Those skilled in the art should understand that these unit modules can be implemented in various ways, such as only hardware, only software, or a combination thereof, and the present disclosure is not limited thereto.

[0058] The first matching unit 701 performs a first matching process on a first portion of the summary text having a first number of characters and the original text to obtain a first matching result.

[0059] When the first matching result indicates that there is no text in the original text that matches the first portion, the second matching unit 702 selects a second portion from the first portion, the second portion having a second number of characters in the summary text, and performs a second matching process with the original text to obtain a second matching result.

[0060] The tagging unit 703 tags the correspondence between the characters of the summary text and the original text based on the first matching result and the second matching result.

[0061] The first matching unit 701 and the second matching unit 702 repeatedly perform multiple cycles of the first matching process and the second matching process, respectively, until all of the summary text is matched, where the first number of first matching processes in one cycle of the multiple cycles is the same as the first number of first matching processes in a previous cycle. The first number is determined by a length of the sentence of the summary text in which the first portion is located. If the first matching result or the second matching result indicates that there are multiple matching positions in the original text that match the first portion or the second portion, the tagging unit 703 determines an optimal matching position from the multiple matching positions based on a similarity between the original text at the multiple matching positions and an adjacent portion of the first portion or the second portion. The first matching unit 701 and the second matching unit 702 determine whether the generated characters have a practical meaning for a predetermined length of generated characters in the summary text, and do not perform the first matching process and the second matching process for the generated characters that do not have a practical meaning.

[0062] The block diagrams used in the description of the above embodiments show functional blocks. These functional blocks (structural units) are realized by any combination of hardware and / or software. The means for realizing each functional block is not particularly limited. That is, each functional block may be realized by one device that is physically and / or logically coupled, or may be realized by directly and / or indirectly (e.g., wired and / or wirelessly) connecting two or more devices that are physically and / or logically separated.

[0063] For example, the summary text tagging device according to an embodiment of the present disclosure may function as a computer that executes the processing of the text processing method of the present disclosure. Fig. 8 is a hardware block diagram showing a summary text tagging device according to an embodiment of the present disclosure. As shown in Fig. 8, the summary text tagging device 800 may be physically configured as a computer device including a processor 1001, a memory 1002, a storage device 1003, a communication device 1004, an input device 1005, an output device 1006, a bus 1007, etc.

[0064] In the following description, the term "apparatus" may be replaced with a circuit, a device, a unit, etc. The hardware structure of the summary text tagging device 600 may be configured to include one or more of the devices shown in the figure, or may be configured to exclude some of the devices.

[0065] For example, although only one processor 1001 is shown in the figure, multiple processors may be provided. Further, processing may be performed by one processor, or by one or more processors simultaneously, sequentially, or in other manners. Additionally, processor 1001 may be implemented by one or more chips.

[0066] Each function of the summary text tagging device 800 is realized, for example, by loading a specified software (program) onto hardware such as a processor 1001 and a memory 1002, which causes the processor 1001 to perform calculations and control communications via a communication device 1004 and the reading and / or writing of data in the memory 1002 and the storage device 1003.

[0067] The processor 1001, for example, runs an operating system to control the entire computer. The processor 1001 may be configured as a central processing unit (CPU) including an interface with peripheral devices, a control device, an arithmetic unit, a register, and the like.

[0068] Moreover, the processor 1001 reads out programs (program codes), software modules, data, etc. from the storage device 1003 and / or the communication device 1004 into the memory 1002, and executes various processes according to the programs. As the programs, those that cause a computer to execute at least a part of the operations described in the above embodiments are used.

[0069] The memory 1002 is a computer-readable recording medium, and may be composed of at least one of, for example, a read only memory (ROM), a programmable read only memory (EPROM), an electrically programmable read only memory (EEPROM), a random access memory (RAM), and other suitable storage media. The memory 1002 may be called a register, a cache, a main memory, etc. The memory 1002 may store an executable program (program code), a software module, etc. for implementing a wireless communication method according to one embodiment of the present disclosure.

[0070] The storage device 1003 is a computer-readable recording medium and may be comprised of at least one of, for example, a flexible disk, a floppy disk, a magneto-optical disk (e.g., a compact disc (CD-ROM), a digital versatile disc, a Blu-ray disc), a removable disk, a hard drive, a smart card, a flash memory device (e.g., a card, a stick, a key driver), a magnetic strip, a database, a server, and other suitable storage media. The storage device 1003 may also be referred to as an auxiliary storage device.

[0071] The communication device 1004 is hardware (transmitting / receiving device) for communicating between computers via a wired and / or wireless network, and is also called, for example, a network device, a network controller, a network card, or a communication module.

[0072] The input device 1005 is an input device (e.g., a keyboard, a mouse, a microphone, a switch, a button, a sensor, etc.) that receives an input from the outside. The output device 1006 is an output device (e.g., a display, a speaker, a light emitting diode (LED) lamp, etc.) that outputs to the outside. The input device 1005 and the output device 1006 may be integrated into one structure (e.g., a touch panel).

[0073] Furthermore, each device such as the processor 1001 and the memory 1002 is connected via a bus 1007 for communicating information. The bus 1007 may be configured as a single bus, or may be configured as different buses between the devices.

[0074] The summary text tagging device 800 may also include hardware such as a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device (PLD), and a field programmable gate array (FPGA), and may realize some or all of the functional blocks through the hardware. For example, the processor 1001 may be installed by at least one of these pieces of hardware.

[0075] Software shall be construed broadly to mean commands, command sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, steps, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.

[0076] Software, commands, information, etc. may also be transmitted or received via a transmission medium. For example, if the software is transmitted from a website, server, or other remote source using wired technologies (such as coaxial cable, optical cable, twisted pair, Digital Subscriber Line (DSL)), and / or wireless technologies (such as infrared, microwave, etc.), these wired and / or wireless technologies are included within the definition of transmission media.

[0077] FIG. 9 is a schematic diagram illustrating a computer-readable storage medium according to an embodiment of the present disclosure. As shown in FIG. 9, a computer-readable storage medium 900 according to an embodiment of the present disclosure stores computer program instructions 901. When the computer program instructions 901 are executed by a processor, the computer-readable storage medium performs the above-mentioned method for tagging summary text. The computer-readable storage medium may include, but is not limited to, a volatile memory and / or a non-volatile memory. The volatile memory may include, for example, a random access memory (RAM) and / or a cache memory (cache). The non-volatile memory may include, for example, a read-only memory (ROM), a hard disk, a flash memory, an optical disk, a magnetic disk, etc.

[0078] The method, apparatus, and device for tagging a summary text according to the present disclosure have been described above with reference to the drawings. The method for tagging a summary text according to the present disclosure does not need to perform a character-by-character matching process in the process of matching the summary text with the original text, and instead matches different parts of a variable-length summary text with the original text, thereby improving the speed of the matching and tagging process. When the original text has multiple positions that match the summary text, the optimal position from the multiple positions is tagged as the matching result. In addition, for generated characters of a predetermined length in the summary text, whether or not to perform a matching process is determined depending on whether or not the characters have a practical meaning, thereby avoiding unnecessary matching processes and further improving the speed of the matching process. The method for tagging a summary text according to the present disclosure allows a user to intuitively know the corresponding position of the summary text in the original text, and obtains a better reading experience.

[0079] Each aspect / embodiment described herein may be used alone or in combination, and may be used interchangeably in the implementation. In addition, the processing steps, sequences, flow charts, etc. of each aspect / embodiment described herein may be changed in order unless inconsistent. For example, with respect to the methods described herein, various step units are given in an exemplary order, but are not limited to the particular order given.

[0080] In addition, "based on" as used herein does not mean "based only on" unless clearly stated in another paragraph. In other words, the expression "based on" means both "based only on" and "based at least on."

[0081] As used herein, any reference to an element using a designation such as "first," "second," etc., is not intended to generally limit the quantity or order of those elements. These designations are used herein as a convenient method of distinguishing between two or more elements. Thus, a reference to a first and a second element does not imply that only two elements may be employed or that the first element must precede the second element.

[0082] To the extent that the terms "including," "comprising," and variations thereof are used herein in the specification or claims, these terms are intended to be inclusive, similar to the term "comprising." Further, the term "or" as used herein in the specification or claims is not intended to be an exclusive or.

[0083] Those skilled in the art will appreciate that the aspects of the present application may be described and described in any of several patentable categories or contexts, including a new and useful process, machine, manufacture, or combination of matter, or any combination thereof, or a new and useful improvement thereto. Accordingly, the aspects of the present application may be implemented entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. Any of the above hardware or software may be referred to as a "data block," "module," "initiator," "unit," "assembly," or "system." Additionally, the aspects of the present application may be embodied as a computer product provided on one or more computer-readable mediums, which may include computer-readable program code.

[0084] The present application has used certain words to describe the embodiments of the present application. For example, "one embodiment," "an embodiment," and / or "some embodiments" refer to a particular feature, structure, or characteristic associated with at least one embodiment of the present application. It should be emphasized and noted that "one embodiment" or "an embodiment" or "an alternative embodiment" referenced two or more times in different locations in this specification do not necessarily refer to the same embodiment. Also, some features, structures, or characteristics in one or more embodiments of the present application may be combined as appropriate.

[0085] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. It is also to be understood that terms as defined in ordinary dictionaries should be interpreted as having a meaning consistent with the meaning in the context of the relevant art, and should not be interpreted in an idealized or overly formalized sense unless expressly set forth herein.

[0086] Although the present invention has been described in detail above, it is clear to those skilled in the art that the present invention is not limited to the embodiments described in this specification. The present invention can be implemented in modified and altered forms without departing from the spirit and scope of the present invention as determined by the description of the claims. Therefore, the description in this specification is for illustrative purposes only and does not have any limiting meaning on the present invention.

Claims

1. A method for tagging a summary text by a summary text tagging device, comprising: the summary text is generated based on the original text; The method for tagging the summary text comprises: the summary text tagging device performs a first matching process on a first portion of the summary text having a first number of characters and the original text to obtain a first matching result; when the first matching result indicates that there is no text in the original text that matches the first portion, the summary text tagging device selects a second portion from the first portion of the summary text having a second number of characters, and performs a second matching process with the original text to obtain a second matching result; and tagging a correspondence between a character of the summary text and the original text based on the first matching result and the second matching result. A method for tagging abstract text.

2. The summary text tagging device further includes a step of repeatedly performing a plurality of cycles of the first matching process and the second matching process until all of the summary text is matched; wherein the first number of the first matching processes in one cycle among the plurality of cycles is the same as the first number of the first matching processes in a previous cycle.

2. The method of claim 1 for tagging abstract text.

3. the first number being determined by the length of the sentence of the summary text in which the first portion is located.

2. The method of claim 1 for tagging abstract text.

4. The step of tagging the correspondence between the characters of the summary text and the original text based on the first matching result and the second matching result in the summary text tagging device comprises: the summary text tagging device includes a step of, when the first matching result or the second matching result indicates that there are a plurality of matching positions in the original text that match the first portion or the second portion, determining an optimal matching position from the plurality of matching positions based on a similarity between the original text at the plurality of matching positions and an adjacent portion of the first portion or the second portion; A method for tagging a summary text according to any one of claims 1 to 3.

5. The tagging device for the summary text includes a step of determining whether or not a generated character of a predetermined length in the summary text has a practical meaning; the summary text tagging device further includes a step of not performing the first matching process and the second matching process on the generated characters that have no practical meaning. A method for tagging a summary text according to any one of claims 1 to 3.

6. A tagging device for a summary text generated based on an original text, comprising: a first matching unit for performing a first matching process between a first portion of the summary text having a first number of characters and the original text to obtain a first matching result; a second matching unit for selecting a second portion of the summary text having a second number of characters from the first portion when the first matching result indicates that there is no text in the original text that matches the first portion, and performing a second matching process with the original text to obtain a second matching result; a tagging unit for tagging a correspondence between a character of the summary text and the original text based on the first matching result and the second matching result. A summary text tagging device.

7. each of the first matching unit and the second matching unit repeatedly performs a plurality of cycles of the first matching process and the second matching process until all of the summary text is matched; the first number of first matching processes in one cycle of the plurality of cycles is the same as the first number of first matching processes in a previous cycle; 7. The apparatus for tagging abstract text according to claim 6.

8. the first number being determined by the length of the sentence of the summary text in which the first portion is located.

7. The apparatus for tagging abstract text according to claim 6.

9. when the first matching result or the second matching result indicates that there are a plurality of matching positions in the original text that match the first portion or the second portion, the tagging unit determines an optimal matching position from the plurality of matching positions based on a similarity between the original text at the plurality of matching positions and an adjacent portion of the first portion or the second portion; The summary text tagging device according to any one of claims 6 to 8.

10. The first matching unit and the second matching unit determine, for a predetermined length of generated characters in the summary text, whether the generated characters have a practical meaning; The first matching process and the second matching process are not performed on the generated characters that have no practical meaning. The summary text tagging device according to any one of claims 6 to 8.

11. a memory for storing computer readable instructions; a processor for executing the computer readable instructions to cause the summary text tagging device to perform the summary text tagging method according to any one of claims 1 to 5. A tagging device for summary text.

12. 1. A computer storage medium for storing computer readable instructions, comprising: The computer readable instructions, when executed by a computer, cause the computer to perform the method for tagging abstract text according to any one of claims 1 to 5. Computer storage media.

Images