WO2021207936A1

WO2021207936A1 - Text matching method and apparatus, electronic device, and storage medium

Info

Publication number: WO2021207936A1
Application number: PCT/CN2020/084762
Authority: WO
Inventors: 郭子亮
Original assignee: 深圳市欢太科技有限公司; Oppo广东移动通信有限公司
Priority date: 2020-04-14
Filing date: 2020-04-14
Publication date: 2021-10-21
Also published as: CN115004173A

Abstract

A text matching method and apparatus, an electronic device, and a storage medium. The text matching method comprises: obtaining text to be matched (S110); according to a pre-established keyword trie, performing matching on a keyword in the text (S120); when a keyword in the text is matched, querying a target position of the matched keyword in a preset index table, the preset index table comprising an index corresponding to at least one matching condition, and the matching condition comprising one or more keywords (S130); adding the matched keyword to the target position in a temporary index table, the temporary index table being an empty index table having an identical structure as the preset index table (S140); and according to the added keyword in the temporary index table, determining whether the text satisfies the matching condition (S150).

Description

Text matching method, device, electronic equipment and storage medium

Technical field

This application relates to the technical field of text processing, and more specifically, to a text matching method, device, electronic device, and storage medium.

Background technique

Natural language processing is an important research direction in the field of computer science and artificial intelligence. In the field of natural language processing, keyword matching is applied in various aspects, such as content review and intelligent customer service. In the keyword matching process, the matching of massive keywords needs to ensure the processing efficiency of the matching process to meet the needs of users.

Summary of the invention

In view of the foregoing problems, this application proposes a text matching method, device, electronic device, and storage medium.

In the first aspect, an embodiment of the present application provides a text matching method, the method includes: obtaining a text to be matched; matching the keywords in the text to be matched according to a dictionary tree of keywords that is built in advance; When the keyword in the text to be matched is matched, the target position of the matched keyword in the preset index table is queried, and the preset index table includes at least one index corresponding to the matching condition, and the matching condition includes one Or multiple keywords; adding the matched keywords to the target location in a temporary index table, where the temporary index table is a blank index table with the same structure as the preset index table; according to the The added keywords in the temporary index table determine whether the text to be matched meets the matching condition.

In a second aspect, an embodiment of the present application provides a text matching device, the device includes: a text acquisition module, a keyword matching module, a location query module, a keyword adding module, and a condition determination module, wherein the text acquisition module Used to obtain the text to be matched; the keyword matching module is used to match the keywords in the text to be matched according to a pre-built dictionary tree of keywords; the position query module is used to match the When searching for keywords in the text to be matched, query the target position of the matched keywords in a preset index table, the preset index table includes at least one index corresponding to a matching condition, and the matching condition includes one or more key Words; the keyword adding module is used to add the matched keywords to the target location in a temporary index table, the temporary index table being a blank index table with the same structure as the preset index table The condition determining module is used to determine whether the text to be matched meets the matching condition according to the keywords that have been added in the temporary index table.

In a third aspect, an embodiment of the present application provides an electronic device, including: one or more processors; a memory; one or more application programs, wherein the one or more application programs are stored in the memory and Is configured to be executed by the one or more processors, and the one or more programs are configured to execute the text matching method provided in the first aspect described above.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium stores program code, and the program code can be invoked by a processor to execute the text provided in the first aspect. Matching method.

The solution provided by this application is to obtain the text to be matched, according to the dictionary tree of the pre-built keywords, to match the keywords in the text to be matched, and when the keywords in the text to be matched are matched, query the matched keywords At the target position in the preset index table, the preset index table includes at least one index corresponding to the matching condition, and the matching condition includes one or more keywords, and then the matched keywords are added to the temporary index table. The target location, the temporary index table is a blank index table with the same structure as the preset index table, and then according to the added keywords in the temporary index table, it is determined whether the text to be matched meets the matching conditions, thereby realizing a dictionary tree combining keywords , And the index table formed by the matching conditions to match the text to be matched to determine whether the text to be matched meets the matching conditions, reduce the complexity of text matching, and improve the efficiency of text matching.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings that need to be used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

Fig. 1 shows a schematic diagram of a dictionary tree provided by an embodiment of the present application.

Fig. 2 shows a flowchart of a text matching method according to an embodiment of the present application.

Fig. 3 shows a schematic diagram of a dictionary tree provided by an embodiment of the present application.

FIG. 4 shows a schematic diagram of a preset index table provided by an embodiment of the present application.

Fig. 5 shows a schematic diagram of a temporary index table provided by an embodiment of the present application.

Fig. 6 shows a flowchart of a text matching method according to another embodiment of the present application.

FIG. 7 shows a state diagram of the temporary index table provided by another embodiment of the present application.

Fig. 8 shows another state diagram of the temporary index table provided by another embodiment of the present application.

FIG. 9 shows still another state diagram of the temporary index table provided by another embodiment of the present application.

Fig. 10 shows a flowchart of a text matching method according to another embodiment of the present application.

FIG. 11 shows a schematic diagram of a preset index table provided by another embodiment of the present application.

FIG. 12 shows a time-consuming schematic diagram of a text matching method provided by another embodiment of the present application.

Fig. 13 shows a block diagram of a text matching device according to an embodiment of the present application.

FIG. 14 is a block diagram of an electronic device for executing the text matching method according to an embodiment of the present application according to an embodiment of the present application.

Fig. 15 is a storage unit for storing or carrying the program code for implementing the text matching method according to the embodiment of the present application according to an embodiment of the present application.

Detailed ways

In order to enable those skilled in the art to better understand the solutions of the present application, the technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present application.

In the field of Natural Language Processing (NLP, Natural Language Processing), the task of keyword matching is widely used. For example, in the review of illegal content, the users’ comments or articles are matched against the illegal keywords to prevent the dissemination of a large number of illegal texts; in the intelligent customer service, keyword matching is performed on the customer’s question text to assist in decision-making scenarios. With the growth of the business, the capacity of the keyword library has rapidly expanded. When the number of keywords exceeds 50,000, it can be called a massive keyword, which means that there is often a need to match the massive keywords in the text. In the task of massive keyword matching, it is necessary to ensure the low time-consuming and flexibility of keyword matching at the same time, which is technically challenging.

In traditional keyword matching, keywords are usually matched through regular expressions and dictionary trees.

Among them, regular expressions use a single string to describe and match a series of strings that conform to a certain syntax rule. Due to the richness of matching syntax, regular expression matching has great flexibility. When there are a large number of keywords, the matching syntax of each keyword needs to be called cyclically. Example description: If there are the following keyword combinations: download...game, where "..." means any character. The matched text: "I plan to download A game", you can use the rule syntax: "Download\S+game" to match. If the text length of the text to be matched is n and the number of words in the keyword database is m, the time complexity of the regular expression matching the keyword database is: O(m*n), that is, for each keyword combination, you need to use every The regular expression corresponding to each keyword combination matches the text to be matched.

Dictionary tree, also known as word search tree, Trie tree, is a tree structure and a variant of hash tree. The dictionary tree can store keywords as a tree structure, and each node of the tree is a character. For example, keywords include: apple, application, regression, and return to China. The constructed dictionary tree is shown in Figure 1. In the algorithm that uses the dictionary tree to match keywords (Trie algorithm), it is necessary to traverse the text to be matched once. Traverse along the way and find the exact same string as in the dictionary tree, and get the flag bit of the last node, then the keyword is matched. If the text length of the text to be matched is n, the time complexity of the dictionary tree matching is O(n), that is, the dictionary tree needs to be used to traverse the text to be matched to complete the matching of the keywords in the text to be matched .

After long-term research, the inventor found that in the way of matching keywords through regular expressions, the matching time complexity is O(m*n), and the matching time is large in the scenario of massive keywords. In the way of matching keywords through a dictionary tree, the time complexity, regardless of the number of keywords, is O(n). However, the flexibility is low and it is only suitable for single word matching. For example, in the above example, words such as apple and application can only be matched individually, and two or more multi-word combinations cannot be completed (such as apple...application, "... ”Represents any character). In actual business, its use has limitations.

In response to the above problems, the inventor proposed the text matching method, device, electronic device, and storage medium provided by the embodiments of the present application, which can implement a dictionary tree combining keywords and an index table formed by matching conditions, and match the text to be matched to Determine whether the text to be matched meets the matching conditions, reduce the complexity of text matching, and improve the efficiency of text matching. Among them, the specific text matching method will be described in detail in the subsequent embodiments.

Please refer to FIG. 2, which shows a schematic flowchart of a text matching method provided by an embodiment of the present application. In a specific embodiment, the text matching method is applied to the text matching device 400 shown in FIG. 13 and the mobile terminal 100 equipped with the text matching device 400 (FIG. 14 ). The following will take a mobile terminal as an example to illustrate the specific process of this embodiment. Of course, it is understandable that the electronic device applied in this embodiment may be a server, a PC computer, a notebook computer, etc., which is not limited here. The process shown in FIG. 2 will be described in detail below, and the text matching method may specifically include the following steps:

Step S110: Obtain the text to be matched.

In the embodiment of the present application, the electronic device can obtain the text to be matched, that is, the text that needs to be determined whether it meets the matching condition. The text to be processed can be text extracted from web content, text extracted from chat content, text obtained by converting speech to text, text extracted from text images, etc., specific text Can not be used as a limit.

In some embodiments, the electronic device can obtain the text to be matched online, and the network obtains the text to be matched from other devices. For example, in an online publishing content review scenario, the electronic device can be a server, and can receive text content uploaded by other users, and match the conditions of keyword matching on the text content to complete the content review; another example In the scenario of intelligent customer service, the matching conditions of keywords can be matched on the question text sent by the user, and questions and answers can be conducted according to the matching results. Of course, the specific way of obtaining the text to be matched online may not be a limitation.

In some embodiments, the electronic device may also obtain the text to be matched from a locally stored file, that is, the text to be processed is pre-stored locally in the electronic device. For example, in a scenario where a teacher reviews homework, the teacher can store the text of the homework to be reviewed in an electronic device, and when it needs to be reviewed, read the text of the homework and perform keyword matching to complete the corresponding review work. Of course, the scene in which the electronic device obtains the text to be matched locally may not be a limitation.

In some embodiments, the length of the text and the number of characters in the text to be matched may not be limited. For example, the text to be matched may be a paragraph or a sentence.

Step S120: Match the keywords in the text to be matched according to the pre-built dictionary tree of keywords.

In the embodiment of the present application, a dictionary tree with keywords can be pre-built, and the dictionary tree can be stored in the electronic device. Among them, the keyword may be a keyword included in the matching condition, and the matching condition may be one or more. Each matching condition can be a single keyword or a combination of multiple keywords. It is understandable that the dictionary tree of keywords can include all keywords included in the matching conditions. For example, the matching condition can be "Keyword 1"; for another example, the matching condition can be "Keyword 1...Keyword 2", and "..." is any character. Of course, the above matching conditions are only examples, and the specific number of keywords in the matching conditions may not be limited.

In some embodiments, the dictionary tree of keywords may be created by an electronic device, and the dictionary tree of keywords may be stored locally, so that when the text to be matched needs to be processed, the dictionary tree is read locally.

In other embodiments, the dictionary tree of keywords can also be created by other devices (such as servers, etc.), and then sent to the electronic device by the other device, and then the electronic device stores it, so that it can be processed when the text to be matched is needed. When processing, read the dictionary tree from the local.

In still other embodiments, the electronic device may also obtain a dictionary tree of keywords from other devices (such as a server) in real time every time the text to be matched needs to be processed, and then cache the obtained dictionary tree for use in The processing of matching text this time.

Exemplarily, please refer to FIG. 3, which shows a schematic diagram of the dictionary tree provided by an embodiment of the present application. The matching conditions include: "court", "court...play", "national team...captain", "court" …Captain", all keywords corresponding to the matching conditions can include: "court", "national team", "captain" and "playing". Therefore, it can be set up to include "court", "national team", and "captain" And the dictionary tree of "playing ball".

In some embodiments, after obtaining the text to be matched, the electronic device may match the keywords in the text to be matched according to the dictionary tree of keywords established above. Specifically, the electronic device uses the dictionary tree matching algorithm to traverse the text to be matched using the dictionary tree. If the traversal along the way finds the exact same string as in the dictionary tree and obtains the flag bit of the last node, the keyword is matched.

Step S130: When a keyword in the text to be matched is matched, query the target position of the matched keyword in a preset index table, and the preset index table includes at least one index corresponding to the matching condition. The matching condition includes one or more keywords.

In the embodiment of the present application, a preset index table corresponding to the matching condition may also be created in advance, wherein the preset index table may include an index corresponding to each matching condition, and each index may include its corresponding index. The keywords in the matching conditions.

In some embodiments, the index may be row content or column content in a preset index table. When the index is the content of a column in the preset index table, the keywords in a column of the preset index table can constitute the matching condition corresponding to the index corresponding to the column; when the index is the row content in the preset index table, Then the keywords in a row of the preset index table can constitute the matching condition corresponding to the index corresponding to the row.

In some embodiments, in addition to the content of the index corresponding to each matching condition, the preset index table may also include other information, for example, it may also include the position of the keyword in each index in the preset index table. , The number of keywords in each index (that is, the number of keywords in the matching condition corresponding to the index), the index identification of each index, etc.

Exemplarily, please refer to FIG. 4, which shows a schematic diagram of a preset index table provided by an embodiment of the present application. The matching conditions include: "court", "court...playing", "national team...captain...playing", For "court... captain", "court... national team", the index mark can be included in the preset index table. In the preset index table, the index is the row content in the preset index table, and the preset index table includes each The index identifier of the index, the position identifier of the keyword in each index, and the number of keywords in each index, for example, the matching condition "court...playing", the corresponding index identifier in the preset index table is 2, row The content includes the keywords "court" and "playing", and the number of corresponding keywords is 2.

In some embodiments, the size (rows and columns) in the preset index table can be determined according to the number of matching conditions and the maximum number of keywords in the matching conditions. For example, as in the above example, if the matching conditions include 5, the preset index table includes 5 rows of content, and the maximum number of keywords is 3, then the preset index table includes 3 columns of content.

In the embodiment of the present application, when the electronic device matches the keyword in the text to be matched, it can query the target position of the matched keyword in the preset index table according to the preset index table, so that subsequent matching can be performed. The keywords are added to the temporary index table. For example, in the above example, when the keyword "court" is matched, the preset index table can be queried, and the query can find that "court" is located in the first position of index 1, index 2, index 4, and index 5, namely Location ID 1.

In some embodiments, the electronic device can query the target position of each keyword in the preset index table after searching all the keywords in the text to be matched; the electronic device can also query each keyword every time a keyword is found. Perform a query on the target position of the keyword in the preset index table.

Step S140: Add the matched keyword to the target location in a temporary index table, where the temporary index table is a blank index table with the same structure as the preset index table.

In the embodiment of the present application, after the electronic device obtains the target position of the matched keyword in the preset index table by querying, it may add the matched keyword to the target position in the temporary index table, so as to be based on the temporary index For the added keywords in the table, determine whether the text to be matched meets the matching conditions. The temporary index table corresponds to the preset index table. The temporary index table may be a blank index table with the same structure as the preset index table, wherein the number of rows and columns of the temporary index table and the preset index table may be the same, and Other parameter information included in the preset index table may also be the same. For example, please refer to Figure 5. Figure 5 is a temporary index table corresponding to the preset index table shown in Figure 4. The structure and information included in the two are the same. The difference from the preset index table is that the temporary index table The position of each keyword is empty.

Step S150: Determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In the embodiment of the present application, after the electronic device adds the matched keywords to the temporary index table, it can determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In some embodiments, whether the number of keywords in each index (row or column) in the temporary index table is the same as the number of keywords recorded in the index can be used to determine whether the matching condition corresponding to the index is satisfied. In other words, if they are the same, it means that the keyword of the index is included in the text to be matched, that is, the matching condition corresponding to the index is satisfied. Of course, you can also directly compare whether the keywords in the index in the temporary index table are the same as the keywords in the preset index table. If they are the same, it also means that the keyword of the index is included in the text to be matched, that is, the corresponding index is satisfied. Match conditions.

After determining whether the matching condition corresponding to the index is satisfied according to the keywords added in each index temporarily, the electronic device can obtain the matching condition that the text to be matched meets, so as to obtain the result of matching the matching condition of the text to be matched .

Through the text matching method provided by the embodiments of this application, the keywords in the text to be matched are determined through the dictionary tree, and then the matched keywords are added to the temporary index table according to the preset index table established in advance, and then only need to be based on The keywords added in the temporary index table can be used to determine whether the text to be matched meets the corresponding matching conditions. It is not necessary for each keyword combination to use the regular expression corresponding to each keyword combination to match the text to be matched. Effectively save the time of keyword matching and improve the efficiency of keyword matching.

Please refer to FIG. 6, which shows a schematic flowchart of a text matching method provided by another embodiment of the present application. This method is applied to the above-mentioned electronic equipment, and the process shown in FIG. 6 will be described in detail below. The text matching method may specifically include the following steps:

Step S210: Obtain the text to be matched.

Step S220: Match the keywords in the text to be matched according to the pre-built dictionary tree of keywords.

In the embodiment of the present application, step S210 and step S220 can refer to the content in the foregoing embodiment, which will not be repeated here.

Step S230: When a keyword in the text to be matched is matched according to the dictionary tree, query the target position of the currently matched keyword in a preset index table, and the preset index table includes at least one The index corresponding to the matching condition, where the matching condition includes one or more keywords.

In the embodiment of the present application, the electronic device may also query the target position of the currently matched keyword in the preset index table every time a keyword is found, so as to add the currently matched keyword to the temporary index surface. It is understandable that the target location may be one location or multiple locations, that is, when the keyword is in the index corresponding to multiple matching conditions, the target location is multiple locations, and when the keyword is in one match When the condition corresponds to the index, the target position is 1 position.

Step S240: Add the matched keyword to the target location in a temporary index table, where the temporary index table is a blank index table with the same structure as the preset index table.

In the embodiment of the present application, after the electronic device determines the target position of the currently matched keyword in the preset index table, it may add the currently matched keyword to the temporary index table according to the target position.

Step S250: Determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In the embodiment of the present application, after the currently matched keywords are added to the temporary index table, the matching conditions of the text to be matched can be determined according to the added keywords in the current temporary index table.

For example, the preset index table is shown in Figure 4, the temporary index table is shown in Figure 5, and the text to be matched is "coach, I want to go to the stadium to watch the national team play", then the first keyword matched is the stadium. Therefore, as shown in Figure 7, after the query finds that the position of the "court" in the

index identifiers

1, 2, 4, and 5 is identified as 1, it can be added to the indexes of the

index identifiers

1, 2, 4, and 5, respectively. The first position. At this time, you can determine the matching conditions that the text to be matched meets based on the keywords that have been added in the current temporary index table. For example, you can compare whether the current number of keywords in each index is with the total number of keywords in the index recorded The same, as in the above example, the number of keywords in the index of the

current index ID

1, 2, 4, and 5 are 1, 1, 0, 1, 1, respectively. At this time, only the number of keywords in the index corresponding to the index ID 1 The number of keywords in the index corresponding to index ID 1 in the preset index table is the same, so it is currently determined that the text to be matched meets the matching condition corresponding to the index corresponding to index ID 1, that is, "court".

Step S260: Repeat the steps of matching the keywords in the text to be matched according to the dictionary tree based on the pre-established keywords, until determining all the keywords according to the added keywords in the temporary index table. The step of describing whether the text to be matched satisfies the matching condition, until all the keywords existing in the text to be matched are added to the temporary index table, determine according to the keywords that have been added in the temporary index table Whether the to-be-matched text meets the matching condition.

In the embodiment of the present application, since each keyword in the text to be matched is matched, after the keyword is added to the preset index table, it is determined whether the matching condition is satisfied. There may be other keywords in the text to be matched, so you can continue to perform keyword matching to add the matched keywords to the temporary index table, and then proceed according to the added keywords in the temporary index table. Determine whether the text to be matched meets the corresponding matching conditions. Thus, the electronic device may repeatedly perform step S230 to step S250. When the dictionary tree is used to traverse the text to be matched, all keywords are determined, and the last matched keyword is added to the temporary index table, and based on the added keywords in the temporary index table, determine whether the text to be matched is After the corresponding matching condition is satisfied, the process can be ended, so that the result of matching the text to be matched with the matching condition can be obtained.

Exemplarily, as in the above example, the text to be matched is "coach, I want to go to the stadium to watch the national team play", and the second keyword matched is "national team". Therefore, as shown in Figure 8, in It is found that the position identification of "national team" in the index of index identification 3 is 1, and after the position identification of index identification 5 is 2, the "national team" can be added to the index of index identification 2 respectively. The first position, and the second position in the index of index identification 5. At this time, you can determine the matching conditions that the text to be matched meets based on the keywords that have been added in the current temporary index table. For example, you can compare whether the current number of keywords in each index is with the total number of keywords in the index recorded The same, as in the above example, the number of keywords in the index of the

current index ID

1, 2, 4, and 5 are 1, 1, 1, 1, and 2, respectively. At this time, there is the number of keywords in the index corresponding to the index ID 1. The number of keywords in the index corresponding to index ID 1 in the preset index table is the same. Therefore, it is currently determined that the text to be matched meets the matching condition corresponding to the index corresponding to index ID 1, that is, "court", and index ID 5 corresponds to The number of keywords in the index is the same as the number of keywords in the index corresponding to index mark 5 in the preset index table. Therefore, it can be determined that the text to be matched meets the matching condition corresponding to the index corresponding to index mark 5, that is, "court …national team".

In the same way, the third keyword matched is "playing". Therefore, as shown in Figure 9, the position of "playing" in the index of index identifier 2 is identified as 2, and in the index of index identifier 3. After the position of is marked as 3, "playing" can be added to the second position in the index of index mark 3 and the third position in the index of index mark 3 respectively. At this time, you can determine the matching conditions that the text to be matched meets based on the keywords that have been added in the current temporary index table. For example, you can compare whether the current number of keywords in each index is with the total number of keywords in the index recorded The same, as in the above example, the number of keywords in the index of the

current index identification

1, 2, 4, and 5 are 1, 2, 2, 1, and 2, respectively. At this time, the keyword in the index corresponding to the index identification 1 can be determined The number of is the same as the number of keywords in the index corresponding to index ID 1 in the preset index table, and the number of keywords in the index corresponding to index ID 2 is the same as the number of keywords in the index corresponding to index ID 2 in the preset index table , And the number of keywords in the index corresponding to index identifier 5 is the same as the number of keywords in the index corresponding to index identifier 5 in the preset index table, so it is currently determined that the text to be matched meets the matching corresponding to the index corresponding to index identifier 1. The condition, namely "court", satisfies the matching condition corresponding to the index corresponding to index mark 2, namely "court...playing", and satisfies the matching condition corresponding to the index corresponding to index mark 5, namely "court...national team".

In some embodiments, in the process of repeatedly performing step S230 to step S250, the electronic device may also perform a corresponding index corresponding to the matching condition from the temporary index table after determining the matching condition that the text to be matched meets each time. Processing, to avoid that after adding the next keyword, the keyword added in the index will be judged, and the processing time will be wasted. Therefore, before repeating steps S230 to S250, the text matching method may further include: if it is determined that the text to be matched meets the matching condition corresponding to the specified index, performing preset processing on the specified index in the temporary index table, and preset Processing is used to indicate that the matching condition corresponding to the specified index has been matched. Among them, the specified index is any index. After performing preset processing on the specified index, when the electronic device subsequently processes the next matched keyword, that is, after adding the next keyword, it will no longer judge the keywords added in the index, so It further saves the time of text matching and improves the efficiency of keyword matching.

As an implementation manner, the electronic device performs preset processing on the specified index in the temporary index table, which may be to delete the row or column corresponding to the specified index from the temporary index table; as another implementation manner, the electronic device The preset processing of the designated index in the index table may be to mark the row or column corresponding to the designated index in the temporary index table. Of course, the specific preset processing is not limited. The preset processing only needs to make the electronic device not process the specified index in the temporary index table when processing the next matched keyword. Improve the efficiency of keyword matching.

In some embodiments, after the electronic device uses the dictionary tree to traverse the text to be matched, it determines all keywords, and adds the last matched keyword to the temporary index table, and according to the added value in the temporary index table Keywords: After determining all the matching conditions that the text to be matched meets, you can also output all the matching conditions that the text to be matched meets, so that the user can understand the result of matching the matching conditions of the text to be matched this time, that is, the keyword matching result. For example, all the matching conditions that are met can be displayed, or voice playback can be performed, which is not limited here.

According to the text matching method provided in the embodiments of this application, the keywords in the text to be matched are determined through the dictionary tree, and then according to the preset index table established in advance, after each keyword is matched, the keyword is added to the temporary Index table, and then only need to add keywords in the temporary index table to determine whether the text to be matched meets the corresponding matching conditions, and then repeat the execution to add the keywords that are matched each time to the temporary index table, and then determine Whether the text to be matched meets the corresponding matching conditions, the matching conditions that the entire text to be matched meets can be determined at last. It is not necessary for each keyword combination to use the regular expression corresponding to each keyword combination to match the text to be matched. Effectively save the time of keyword matching and improve the efficiency of keyword matching.

Please refer to FIG. 10, which shows a schematic flowchart of a text matching method provided by another embodiment of the present application. This method is applied to the above-mentioned electronic device. The following will describe the process shown in FIG. 10 in detail. The text matching method may specifically include the following steps:

Step S310: Obtain keywords in each matching condition.

In the embodiment of the present application, the electronic device may obtain the keywords in the matching condition to construct a dictionary tree in advance. Among them, there may be multiple matching conditions, and the electronic device may obtain keywords in each matching condition.

In some embodiments, the electronic device may obtain the matching condition from other devices, or obtain the matching condition input by the user. When the obtained matching condition is a matching condition that only includes keywords, the electronic device can directly obtain the keywords in the matching condition; when the obtained matching condition is in text form, the electronic device can segment the matching condition and determine Find the keywords in the matching condition. For example, if the matching condition is: playing on the court, the keywords can be determined as "court" and "playing".

Step S320: Construct a dictionary tree according to the keywords.

In the embodiment of the present application, after obtaining the keywords in each matching condition, the electronic device can construct a dictionary tree. Specifically, the electronic device can determine the first node of each branch in the dictionary tree according to the first word of the keyword, and then connect other words in the keyword as a node to the first node in turn, thereby constructing a keyword Dictionary tree. After the electronic device constructs the dictionary tree of the keywords, it can store the dictionary tree.

Step S330: According to the keywords in each matching condition, an index is generated and added to the initial index table to obtain the preset index table.

In the embodiment of the present application, the electronic device may also construct a preset index table in advance according to the keywords in each matching condition.

In some implementations, the electronic device may add the keywords in each matching condition to a row or column in the initial index table to obtain a preset index table, where the row or column of each matching condition corresponds to the matching condition. index. It is understandable that the initial index table may be a blank index table, and the number of rows and columns in the initial table may be unlimited, but the minimum requirements required by the matching conditions should be met.

Further, after the electronic device adds the keyword in each matching condition to a row or column in the initial index table, it can also delete the position where the keyword does not exist in the initial index table, so as to obtain the final preset index surface. As shown in Figure 11, the rows and columns in the preset index table only include the positions where keywords exist, so that the preset index table is concise, which not only saves space, but also improves the addition of electronic equipment in the temporary index table. The keywords to determine whether the text to be matched meets the matching conditions.

In some embodiments, the electronic device may also record the position of the keyword of each index in the preset index table and the number of keywords of each index. For example, in the preset index table shown in FIG. 11, each index The location identifiers of the keywords and the number of keywords are recorded in the preset index table, so that the electronic device can use the preset index table to process the matched keywords more quickly.

Step S340: Obtain the text to be matched.

Step S350: Match the keywords in the text to be matched according to the pre-built dictionary tree of keywords.

Step S360: When a keyword in the text to be matched is matched, query the target position of the matched keyword in a preset index table, where the preset index table includes at least one index corresponding to the matching condition, and The matching condition includes one or more keywords.

Step S370: Add the matched keyword to the target position in a temporary index table, where the temporary index table is a blank index table with the same structure as the preset index table.

Step S380: Determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In the embodiment of the present application, the electronic device may query all keywords in the text to be matched, query the target position of each keyword in the preset index table, and then perform steps S370 and S380 to determine the to-be-matched The matching condition that the text satisfies. As described in the previous embodiment, the electronic device may also perform steps S370 and S380 each time a keyword is matched, until the last matched keyword is added to the preset index table, and the matching condition is determined .

In some embodiments, the electronic device determining whether the text to be matched meets the matching condition according to the added keywords in the temporary index table may include:

The added keywords in each index of the temporary index table are compared with the keywords of the corresponding index in the preset index table; according to the comparison result, it is determined whether the text to be matched meets the matching condition.

As a way, the electronic device can obtain the number of keywords added in each index of the temporary index table, and then compare the number of keywords added in each index with the keywords of the corresponding index in the preset index table. The number is compared; if the number of keywords added in the target index is the same as the number of keywords in the target index in the preset index table, it is determined that the text to be matched meets the matching conditions corresponding to the target index, and the target index is a temporary index table Any index in. If the number of added keywords in no index is the same as the number of keywords in the same index in the preset index table, it is determined that the text to be matched does not satisfy any matching condition. It is understandable that because the structure of the temporary index table is the same as the structure of the preset index table, and each matched keyword is added at the same position as the keyword in the preset index table, the key to be added in any index When the number of words is the same as the number of keywords in the index in the preset index table, it means that the keyword of the index is included in the text to be matched, that is, the matching condition corresponding to the index is satisfied.

As another way, the electronic device can also compare whether the keywords that have been added in each index are the same as the keywords of the corresponding index in the preset index table; if the keywords that have been added in the target index are the same as those in the preset index table If the keywords of the target index are the same, it is determined that the text to be matched meets the matching condition corresponding to the target index, and the target index is any index in the temporary index table. If there is no keyword that has been added in any index that is the same as the keyword of the same index in the preset index table, it is determined that the text to be matched does not satisfy any matching condition. It is understandable that if the keyword added in any index is the same as the keyword in the index in the preset index table, it means that the keyword of the index is included in the text to be matched, that is, the matching condition corresponding to the index is satisfied.

In some embodiments, because the preset index table may not have positions other than the positions of the keywords in the index, for example, in the preset index table as shown in FIG. 10, rows in the preset index table Only the positions where keywords exist are included in the sum column. Therefore, the electronic device can determine whether there is a space in each index, that is, according to the keywords that have been added in the temporary index table, determine whether there is a space in the row or column corresponding to each index in the temporary index table; if the target index corresponds to There is no vacant position in the row or column, it means that the row or column corresponding to the target index in the temporary index table is filled. Therefore, the keyword of the target index is included in the text to be matched, so that it can be determined that the text to be matched satisfies The matching condition corresponding to the target index, the target index is any index in the temporary index table. By using the space to determine whether the text to be matched meets the matching condition corresponding to the corresponding index, since it only needs to determine whether the free position is 0, the efficiency of keyword matching of the text can be further improved.

The following exemplarily describes the improvement in matching efficiency brought about by the text matching method provided in the embodiments of the present application. If the number of combined keywords is m and the length of the matched text is n, the time complexity of the regular expression (re) matching keyword library is still O(m*n), the text matching method provided in the embodiment of the application The time complexity of is O(n), but the Trie algorithm cannot directly match compound words. The time complexity of the co-Trie algorithm is O(n)+O(mp), where p is the average word frequency in the lexicon. For a general scenario, p is much smaller than m. In theory, the text matching method provided by the embodiment of the present application takes less time than the regular expression matching method, and is close to the dictionary tree algorithm. FIG. 12 shows an experimental result diagram of a time-consuming comparison experiment between the text matching method and the regular expression matching method provided by the embodiment of the present application, where the string length of the matched text is 200. It can be found from FIG. 12 that as the number of keywords increases, the time-consuming of the text matching method provided in the embodiments of this application is basically unchanged, while the time-consuming of the regular expression matching method increases with the increase of the number of keywords. In addition, in the matching of a large number of keywords, the time-consuming of the text matching method provided in the embodiment of the present application is significantly lower than that of the regular expression matching method.

Please refer to FIG. 13, which shows a structural block diagram of a text matching apparatus 400 provided by an embodiment of the present application. The text matching device 400 uses the aforementioned electronic equipment. The text matching device 400 includes: a text acquisition module 410, a keyword matching module 420, a location query module 430, a keyword adding module 440, and a condition determining module 450. Wherein, the text acquisition module 410 is used to obtain the text to be matched; the keyword matching module 420 is used to match the keywords in the text to be matched according to a pre-built dictionary tree of keywords; the position The query module 430 is configured to query the target position of the matched keyword in a preset index table when the keyword in the text to be matched is matched, and the preset index table includes at least one index corresponding to the matching condition, The matching condition includes one or more keywords; the keyword adding module 440 is configured to add the matched keywords to the target position in the temporary index table, and the temporary index table is the same as the A blank index table with the same structure of the preset index table; the condition determining module 450 is configured to determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In some embodiments, the preset index table includes multiple indexes corresponding to matching conditions. The condition determination module 450 may include: a comparison unit and a first determination unit. Wherein, the comparing unit is used to compare the added keywords in each index of the temporary index table with the keywords of the corresponding index in the preset index table; the first determining unit is used to determine according to the comparison result Whether the to-be-matched text meets the matching condition.

As an implementation manner, the comparison unit may include: a quantity acquisition subunit and a quantity comparison subunit. Wherein, the quantity obtaining subunit is used to obtain the quantity of the added keywords in each index of the temporary index table; the quantity comparison subunit is used to compare the quantity of the added keywords in each index with the The number of keywords in the corresponding index in the preset index table is compared.

In this embodiment, the first determining unit may be specifically configured to: if the number of added keywords in the target index is the same as the number of keywords in the target index in the preset index table, determine the to-be-matched The text satisfies the matching condition corresponding to the target index, and the target index is any index in the temporary index table.

As another implementation manner, the comparison unit may include: a keyword comparison subunit. The keyword comparison subunit is used to compare whether the added keyword in each index is the same as the keyword of the corresponding index in the preset index table.

In this embodiment, the first determining unit may be specifically configured to: if the keyword added in the target index is the same as the keyword of the target index in the preset index table, determine that the text to be matched satisfies all According to the matching condition corresponding to the target index, the target index is any index in the temporary index table.

In some other implementation manners, the preset index table includes a plurality of indexes corresponding to matching conditions, and there is no other than the position of the keyword in the index in the preset index table and the temporary index table. Location. The condition determination module 450 may include: a position determination unit and a second determination unit. Wherein, the position determining unit is used to determine whether there is a free position in the row or column corresponding to each index in the temporary index table according to the keywords that have been added in the temporary index table; the second determining unit is used to determine if the target index If there is no free position in the corresponding row or column, it is determined that the text to be matched meets the matching condition corresponding to the target index, and the target index is any index in the temporary index table.

In some embodiments, the location query module 430 may be specifically configured to: when a keyword in the text to be matched is matched according to the dictionary tree, query the currently matched keyword in the preset index table target location.

In this embodiment, the text matching device 400 may further include: a repeated execution module. The repeat execution module is configured to: repeat the step of matching the keywords in the text to be matched according to the dictionary tree based on the pre-established keywords to the keywords that have been added in the temporary index table. , The step of determining whether the text to be matched satisfies the matching condition, until all the keywords in the text to be matched are added to the temporary index table, according to the added key in the temporary index table Word, determine whether the text to be matched meets the matching condition.

In this embodiment, the text matching device 400 may further include: an index processing module. The index processing module is configured to repeatedly execute the step of matching the keywords in the text to be matched according to the dictionary tree based on the pre-established keywords to the steps that have been added in the temporary index table according to the Keywords, before the step of determining whether the text to be matched meets the matching condition, if it is determined that the text to be matched meets the matching condition corresponding to the specified index, the specified index in the temporary index table is pre-prepared Assuming processing, the preset processing is used to indicate that the matching condition corresponding to the specified index has been matched.

As a way, the index processing module may be specifically configured to delete the row or column corresponding to the specified index from the temporary index table.

As another way, the index processing module may also be specifically configured to mark the row or column corresponding to the specified index in the temporary index table.

In some embodiments, the location query module 430 may also be specifically configured to: after matching all the keywords in the text to be matched, query for each keyword in the preset index table. Target location in.

In some embodiments, the text matching device 400 may further include: an output module. The output module is configured to output all the matching conditions satisfied by the text to be matched after determining whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.

In some embodiments, the text matching device 400 may further include: a keyword acquisition module and an index generation module. The keyword obtaining module is used to obtain the keywords in each matching condition when the keywords in the text to be matched are matched, and the keywords matched by the query are before the target position in the preset index table; The module is used to generate an index according to the keywords in each matching condition and add it to the initial index table to obtain the preset index table.

In this embodiment, the index generation module may be specifically configured to: add keywords in each matching condition to a row or a column in the initial index table to obtain the preset index table, wherein each matching condition The row or column is the index corresponding to the matching condition.

Further, the index generation module may also be used to delete positions where no keywords exist in the initial index table.

In some embodiments, the text matching device 400 may further include: an index recording module. The index recording module is used to generate an index according to the keywords in each matching condition and add it to the initial index table, and after obtaining the preset index table, record the key of each index in the preset index table The position of the word and the number of keywords in each index.

In some embodiments, the text matching device 400 may further include: a keyword acquisition module and a dictionary tree construction module. The keyword acquisition module is used to construct a dictionary tree based on the keywords before matching the keywords in the text to be matched according to the dictionary tree based on the pre-built keywords.

Those skilled in the art can clearly understand that, for the convenience and conciseness of the description, the specific working process of the device and module described above can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, the coupling between the modules may be electrical, mechanical or other forms of coupling.

In addition, each functional module in each embodiment of the present application may be integrated into one processing module, or each module may exist alone physically, or two or more modules may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware or software functional modules.

In summary, the solution provided by this application obtains the text to be matched, and matches the keywords in the text to be matched according to the dictionary tree of the pre-built keywords. When the keywords in the text to be matched are matched, the query The matched keyword is at the target position in the preset index table, the preset index table includes at least one index corresponding to the matching condition, and the matching condition includes one or more keywords, and then the matched keywords are added to the temporary The target location in the index table, the temporary index table is a blank index table with the same structure as the preset index table, and then according to the added keywords in the temporary index table, it is determined whether the text to be matched meets the matching conditions, thereby realizing the combination The dictionary tree of keywords and the index table formed by the matching conditions match the text to be matched to determine whether the text to be matched meets the matching conditions, reduce the complexity of text matching, and improve the efficiency of text matching.

Please refer to FIG. 14, which shows a structural block diagram of an electronic device provided by an embodiment of the present application. The electronic device 100 may be an electronic device capable of running application programs, such as a server, a PC computer, a notebook computer, and a mobile terminal. The electronic device 100 in this application may include one or more of the following components: a processor 110, a memory 120, and one or more application programs. One or more application programs may be stored in the memory 120 and configured to be Or multiple processors 110 execute, and one or more programs are configured to execute the method described in the foregoing method embodiment.

The processor 110 may include one or more processing cores. The processor 110 uses various interfaces and lines to connect various parts of the entire electronic device 100, and executes by running or executing instructions, programs, code sets, or instruction sets stored in the memory 120, and calling data stored in the memory 120. Various functions and processing data of the electronic device 100. Optionally, the processor 110 may adopt at least one of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). A kind of hardware form to realize. The processor 110 may be integrated with one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), a modem, and the like. Among them, the CPU mainly processes the operating system, user interface, and application programs; the GPU is used for rendering and drawing of display content; the modem is used for processing wireless communication. It is understandable that the above-mentioned modem may not be integrated into the processor 110, but may be implemented by a communication chip alone.

The memory 120 may include random access memory (RAM) or read-only memory (Read-Only Memory). The memory 120 may be used to store instructions, programs, codes, code sets or instruction sets. The memory 120 may include a program storage area and a data storage area, where the program storage area may store instructions for implementing an operating system and instructions for implementing at least one function (such as touch function, sound playback function, image playback function, etc.) , Instructions used to implement the following various method embodiments, etc. The storage data area can also store data (such as phone book, audio and video data, chat record data) created by the electronic device 100 during use.

Please refer to FIG. 15, which shows a structural block diagram of a computer-readable storage medium provided by an embodiment of the present application. The computer-readable medium 800 stores program code, and the program code can be invoked by a processor to execute the method described in the foregoing method embodiment.

The computer-readable storage medium 800 may be an electronic memory such as flash memory, EEPROM (Electrically Erasable Programmable Read Only Memory), EPROM, hard disk, or ROM. Optionally, the computer-readable storage medium 800 includes a non-transitory computer-readable storage medium. The computer-readable storage medium 800 has storage space for the program code 810 for executing any method steps in the above-mentioned methods. These program codes can be read from or written into one or more computer program products. The program code 810 may be compressed in a suitable form, for example.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the application, not to limit them; although the application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The technical solutions recorded in the foregoing embodiments are modified, or some of the technical features are equivalently replaced; these modifications or replacements do not drive the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

A text matching method, characterized in that the method includes:

Get the text to be matched;

Match the keywords in the text to be matched according to the pre-built dictionary tree of keywords;

When a keyword in the text to be matched is matched, the target position of the matched keyword in a preset index table is queried, and the preset index table includes at least one index corresponding to a matching condition, and the matching condition includes One or more keywords;

Adding the matched keyword to the target location in a temporary index table, where the temporary index table is a blank index table with the same structure as the preset index table;

According to the added keywords in the temporary index table, it is determined whether the text to be matched meets the matching condition.
The method according to claim 1, wherein the preset index table includes a plurality of indexes corresponding to matching conditions, and the determining whether the text to be matched is determined according to the keywords that have been added in the temporary index table Satisfying the matching conditions includes:

Comparing the added keywords in each index of the temporary index table with the keywords of the corresponding index in the preset index table;

According to the comparison result, it is determined whether the text to be matched satisfies the matching condition.
The method according to claim 2, wherein the comparing the added keywords in each index of the temporary index table with the keywords of the corresponding index in the preset index table comprises:

Acquiring the number of added keywords in each index of the temporary index table;

Comparing the number of added keywords in each index with the number of keywords in the corresponding index in the preset index table;

The determining whether the text to be matched meets the matching condition according to the comparison result includes:

If the number of keywords added in the target index is the same as the number of keywords of the target index in the preset index table, it is determined that the text to be matched meets the matching condition corresponding to the target index, and the target index Is any index in the temporary index table.
The method according to claim 2, wherein the comparing the added keywords in each index with the keywords of the corresponding index in the preset index table comprises:

Compare whether the added keywords in each index are the same as the keywords of the corresponding index in the preset index table;

The determining whether the text to be matched meets the matching condition according to the comparison result includes:

If the added keyword in the target index is the same as the keyword of the target index in the preset index table, it is determined that the text to be matched meets the matching condition corresponding to the target index, and the target index is the Any index in the temporary index table.
The method according to claim 1, wherein the preset index table includes a plurality of indexes corresponding to matching conditions, and the preset index table and the temporary index table do not have a key except the index. For the remaining positions other than the position of the word, the determining whether the text to be matched meets the matching condition according to the added keywords in the temporary index table includes:

According to the added keywords in the temporary index table, determine whether there is a spare position in the row or column corresponding to each index in the temporary index table;

If there is no vacant position in the row or column corresponding to the target index, it is determined that the text to be matched meets the matching condition corresponding to the target index, and the target index is any index in the temporary index table.
The method according to any one of claims 1 to 5, wherein when the keyword in the text to be matched is matched, query the target position of the matched keyword in a preset index table, include:

When a keyword in the text to be matched is matched according to the dictionary tree, the target position of the currently matched keyword in the preset index table is queried.
The method according to claim 6, wherein after the determining whether the text to be matched meets the matching condition according to the keywords that have been added in the temporary index table, the method further comprises:

Repeat the steps of matching the keywords in the text to be matched based on the pre-built dictionary tree of keywords to the step of determining the to-be-matched keywords based on the added keywords in the temporary index table The step of whether the text satisfies the matching condition, until all the keywords existing in the text to be matched are added to the temporary index table, determine the to-be-matched keywords according to the added keywords in the temporary index table Whether the matched text satisfies the matching condition.
The method according to claim 7, characterized in that the step of matching the keywords in the text to be matched is performed repeatedly in the dictionary tree based on the pre-established keywords, until the step of matching the keywords in the text to be matched is repeated until the Before the step of determining whether the text to be matched satisfies the matching condition for the keywords that have been added in the temporary index table, the method further includes:

If it is determined that the text to be matched meets the matching condition corresponding to the specified index, perform preset processing on the specified index in the temporary index table, and the preset processing is used to indicate the matching condition corresponding to the specified index Has been matched.
The method according to claim 8, wherein the performing preset processing on the designated index in the temporary index table comprises:

The row or column corresponding to the specified index is deleted from the temporary index table.
The method according to claim 8, wherein the performing preset processing on the designated index in the temporary index table comprises:

Mark the row or column corresponding to the specified index in the temporary index table.
The method according to any one of claims 1 to 5, wherein when the keyword in the text to be matched is matched, query the target position of the matched keyword in a preset index table, include:

When all keywords in the text to be matched are matched, the target position of each keyword in all the keywords in the preset index table is queried.
The method according to any one of claims 1-11, wherein after determining whether the text to be matched satisfies the matching condition according to the keywords that have been added in the temporary index table, the method further include:

Output all matching conditions satisfied by the text to be matched.
The method according to any one of claims 1-12, wherein when the keyword in the text to be matched is matched, the query that the matched keyword is before the target position in the preset index table, The method also includes:

Get the keywords in each matching condition;

According to the keywords in each matching condition, an index is generated and added to the initial index table to obtain the preset index table.
The method according to claim 13, wherein the generating an index according to the keywords in each matching condition and adding it to the initial index table to obtain the preset index table comprises:

The keywords in each matching condition are added to a row or a column in the initial index table to obtain the preset index table, where the row or column where each matching condition is located serves as the index corresponding to the matching condition.
The method according to claim 14, characterized in that, after the keyword in each matching condition is added to a row or a column in the initial index table, the method further comprises:

Delete the position where the keyword does not exist in the initial index table.
The method according to any one of claims 13-15, wherein after said generating an index according to the keywords in each matching condition and adding it to the initial index table, after obtaining the preset index table, The method also includes:

The position of the keyword of each index in the preset index table and the number of keywords of each index are recorded.
The method according to any one of claims 1-16, characterized in that, before matching the keywords in the text to be matched according to the pre-built dictionary tree of keywords, the method further comprises :

Get the keywords in each matching condition;

According to the keywords, a dictionary tree is constructed.
A text matching device, characterized in that the device includes: a text acquisition module, a keyword matching module, a location query module, a keyword adding module, and a condition determination module, wherein,

The text obtaining module is used to obtain the text to be matched;

The keyword matching module is used to match the keywords in the text to be matched according to a pre-built dictionary tree of keywords;

The location query module is used to query the target location of the matched keyword in a preset index table when the keyword in the text to be matched is matched, and the preset index table includes at least one matching condition corresponding Index, the matching condition includes one or more keywords;

The keyword adding module is configured to add the matched keyword to the target position in a temporary index table, the temporary index table being a blank index table with the same structure as the preset index table;

The condition determination module is configured to determine whether the text to be matched meets the matching condition according to the added keywords in the temporary index table.
An electronic device, characterized in that it comprises:

One or more processors;

Memory

One or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs are configured to execute such as The method of any one of claims 1-17.
A computer-readable storage medium, wherein the computer-readable storage medium stores program code, and the program code can be called by a processor to execute the method according to any one of claims 1-17 .