Priority allocation method, reply rule matching method, device, electronic equipment and program product

Abstract

This disclosure discloses a priority allocation method, comprising: acquiring a set of data items having a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority; receiving a priority adjustment setting request for at least one data item in the data item set; setting a priority adjustment feature for at least one data item according to the priority adjustment setting request; and determining a final priority sequence based on the basic priority and the priority adjustment feature, wherein the relative order among multiple data items having the same priority adjustment feature is consistent with their relative order in the basic priority sequence. This disclosure also provides a priority allocation device, electronic device, and program product. The method disclosed in this disclosure achieves rapid priority adjustment while maintaining the original priority dependencies for rapid recovery after adjustment, significantly improving the flexibility of priority adjustment.

Description

Technical Field

[0001] This disclosure relates to the field of computer application technology, and in particular to priority allocation methods, knowledge base response rule matching methods, and related devices, electronic devices, and program products. Background Technology

[0002] Currently, in various AI matching scenarios, there is often a problem where a single input message is matched against multiple rules. In such cases, a priority matching mechanism is usually used to determine the final matching result.

[0003] However, existing priority matching mechanisms typically rely on setting a priority value for each rule independently and sorting them by value to determine the final matching result. When a rule's priority needs temporary adjustment, this mechanism can only check and modify the priority values ​​of that rule and other related rules one by one to ensure the correctness of the overall priority sequence. This adjustment method is not only cumbersome but also prone to introducing priority conflicts and errors.

[0004] Therefore, there is an urgent need for an improved priority management scheme that is simple in structure and highly flexible, in order to solve the problem of low flexibility in priority adjustment in multiple matching scenarios.

[0005] The background description is provided for the purpose of understanding the relevant technologies in this field and is not intended as an admission of prior art. Summary of the Invention

[0006] The embodiments disclosed herein aim to provide a priority allocation method and apparatus, electronic device and program product, which can mitigate or solve at least one of the aforementioned technical problems.

[0007] In a first aspect, embodiments of this disclosure provide a priority allocation method, which may include:

[0008] Obtain a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority;

[0009] Receive a request to adjust the priority setting of at least one data item in the data item set;

[0010] According to the priority setting request, a priority adjustment feature is set for the at least one data item; and

[0011] Based on the basic priority and the priority adjustment feature, a final priority sequence is determined, wherein the relative order among multiple data items having the same priority adjustment feature is consistent with their relative order in the basic priority sequence.

[0012] In a second aspect, embodiments of this disclosure provide a knowledge base response rule matching method, which may include:

[0013] Obtain keyword matching rule sets from multiple knowledge bases, each knowledge base corresponding to different response content. The keyword matching rule sets include multiple regular expressions used for text matching.

[0014] Based on a preset business processing order, a priority relationship is determined for each regular expression in the keyword matching rule set, and priority management is performed using the priority allocation method described in the first aspect; and

[0015] Obtain user input, and when the user input matches the regular expressions of multiple knowledge bases simultaneously, determine the final knowledge base to use for the response content based on the priority relationship.

[0016] In a third aspect, embodiments of this disclosure also provide a priority matching device, which may include:

[0017] The acquisition unit is configured to acquire a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority.

[0018] The receiving unit is configured to receive a request to adjust the priority setting of at least one data item in the data item set;

[0019] The setting unit is configured to set a priority adjustment feature for the at least one data item according to the priority setting request; and

[0020] The determining unit is configured to determine a final priority sequence based on the base priority and the priority adjustment feature, wherein the relative order among multiple data items having the same priority adjustment feature is consistent with their relative order in the base priority sequence.

[0021] In a fourth aspect, embodiments of this disclosure also provide a knowledge base response rule matching device, which may include:

[0022] The acquisition unit is configured to acquire a set of keyword matching rules for multiple knowledge bases, each knowledge base corresponding to different response content. The set of keyword matching rules includes multiple regular expressions for text matching.

[0023] The matching unit is configured to determine the priority relationship of each regular expression in the keyword matching rule set based on a preset business processing order, and to manage the priority using the priority allocation method described in the first aspect; and

[0024] The unit is configured to acquire user input, and when the user input matches regular expressions of multiple knowledge bases simultaneously, it determines the final knowledge base response content to be used based on the priority relationship.

[0025] In a fifth aspect, embodiments of this disclosure also provide an electronic device that may include: a processor and a memory storing a computer program, the processor being configured to implement the method as described in the first or second aspect when running the computer program.

[0026] In a sixth aspect, embodiments of this disclosure also provide a program product including a computer program, wherein the computer program, when executed by a processor, implements the method as described in the first or second aspect.

[0027] The method of this disclosure divides the priority setting of data items into two levels: basic priority and adjustment priority value. When data items have the same adjustment priority value, the relative order of the basic sequence between data items is maintained. This allows for rapid adjustment of priority without having to consider and modify the priority relationship between each data item individually when adjusting the priority of data items. At the same time, the original priority dependency relationship is maintained, thereby solving the technical problem of insufficient flexibility in adjusting the priority of data items in existing intelligent matching technologies.

[0028] Other optional features and technical effects of the embodiments of this disclosure are described in part below, and in part will be apparent from reading this document. Attached Figure Description

[0029] The embodiments of this disclosure will now be described in detail with reference to the accompanying drawings. The elements shown are not limited to the scale shown in the drawings, and the same or similar reference numerals in the drawings denote the same or similar elements, wherein:

[0030] Figure 1 One of the exemplary flowcharts of a priority allocation method according to an embodiment of the present disclosure is shown;

[0031] Figure 2 A second exemplary flowchart of a priority allocation method according to an embodiment of the present disclosure is shown;

[0032] Figure 3 A third exemplary flowchart of a priority allocation method according to an embodiment of the present disclosure is shown;

[0033] Figure 4 A fourth exemplary flowchart of a priority allocation method according to an embodiment of the present disclosure is shown;

[0034] Figure 5 Fifth exemplary flowchart of a priority allocation method according to an embodiment of the present disclosure is shown;

[0035] Figure 6 An exemplary flowchart of a knowledge base response rule matching method according to an embodiment of the present disclosure is shown;

[0036] Figure 7 An exemplary structural diagram of a priority allocation apparatus according to an embodiment of the present disclosure is shown;

[0037] Figure 8 An exemplary structural diagram of a knowledge base response rule matching apparatus according to an embodiment of the present disclosure is shown; and

[0038] Figure 9 An exemplary structural diagram of an electronic device capable of implementing the methods according to embodiments of the present disclosure is shown. Detailed Implementation

[0039] To make the objectives, technical solutions, and advantages of this disclosure clearer, the disclosure will be further described in detail below with reference to specific embodiments and accompanying drawings. Here, the illustrative embodiments and descriptions of this disclosure are used to explain this disclosure, but are not intended to limit this disclosure.

[0040] The term "comprising" and its variations as used herein signify open inclusion, i.e., "including but not limited to". Unless otherwise stated, the term "or" means "and / or". The term "based on" means "at least partially based on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least some embodiments". The terms "first", "second", etc., may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0041] In a priori matching scheme known to the inventor, a basic priority configuration is set for each intelligent matching business scenario, and the priority is dynamically adjusted based on different specific needs. However, in this scheme, if it is necessary to temporarily increase the response priority of a certain type of rule, the administrator first needs to identify a massive number of related rule entries in the system, and then adjust their priority values ​​one by one to ensure that these rules can be matched preferentially. In this process, it is necessary to consider adjusting the priority value of the target rule to an appropriate range, and also to carefully check and coordinate the priority settings of other rules to avoid priority conflicts or logical errors. In a specific example, the existing priority settings are: A: General questions (priority 1), B: Product consultation questions (priority 2), C: Holiday event questions (priority 3), D: Account questions (priority 4). When it is necessary to increase the priority of "Holiday event questions" during a holiday, the existing scheme requires manually adjusting the priority of holiday event questions to 1. In order to prevent priority conflicts caused by the same priority, it is also necessary to adjust the priority of general questions to 2 and the priority of product consultation to 3 accordingly. The steps are very cumbersome and prone to introducing priority conflicts.

[0042] In another priority matching scheme known to the inventor, multiple priority tables are combined to achieve complex matching priority management. Although this scheme has a certain degree of flexibility, the lack of priority dependencies between rule entries across priority tables makes it complex to temporarily adjust the priority of certain rules. It may even require the creation of a new priority set table or the simultaneous adjustment of the response priorities between multiple priority tables, making it difficult to guarantee the correctness of the adjusted priority sequence.

[0043] The inventors further realized that regardless of the approach used, temporarily adjusting the priority of certain rules required repeated, tedious adjustments to restore the original priority, making it impossible to quickly revert to the previous state. This shortcoming significantly hampered the flexibility of AI-related operations. The inventors also recognized that in current priority-based intelligent matching scenarios, especially those involving AI customer service and knowledge base response rules, hundreds or even thousands of rule entries are often involved. To accurately match user needs and respond, a priority mechanism is typically needed to handle multiple matching scenarios involving numerous rules. In such scenarios, the inability to flexibly adjust the matching priority of response rules in batches becomes particularly severe, greatly impacting the flexibility of knowledge base response operations.

[0044] Therefore, this disclosure provides a priority allocation method. The solution divides the priority settings of data items involved in intelligent matching scenarios into two levels: basic priority and adjustment priority. The adjustment priority enhances the basic priority without affecting the original relative priority order at the basic priority level. Data items with the same adjustment priority value maintain their relative priority order based on the basic priority level. This allows for rapid priority adjustment without individually considering and modifying the priority relationships between data items, while maintaining the original priority dependencies. This solves the technical problem of insufficient flexibility in priority adjustment in existing technologies. Furthermore, this disclosure proposes a knowledge base response rule intelligent matching method that can be combined with this priority allocation method, significantly improving the flexibility of knowledge base adjustments in different scenarios and providing a more efficient and flexible knowledge base response rule matching management solution.

[0045] In this embodiment of the disclosure, the data item set includes multiple data items (Data Items) in the matching scenario that can be managed for matching priority. The data item is the smallest object for priority matching and management. Each data item can be independently identified and its matching priority can be confirmed. The data items include, but are not limited to, keyword rules, regular expressions, matching rules, etc.

[0046] In some embodiments of this disclosure, such as Figure 1 As shown, a priority allocation method is provided. This method can be widely applied in business scenarios with priority matching. In some business scenarios, the priority allocation method provided in this embodiment can be executed by systems including but not limited to artificial intelligence customer service systems, intelligent risk control engines, intelligent transaction monitoring platforms, portfolio optimization systems, intelligent credit approval systems, and anti-fraud systems. Figure 1 The method may include at least S110 to S140.

[0047] S110: Obtain a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority.

[0048] In this embodiment of the disclosure, the data item set may include multiple data items, each of which may have a different basic priority (in some examples, the priority is represented by a numerical value). The sequence of data item priority order determined based on the basic priorities of the multiple data items may be referred to as the basic priority sequence. It should be understood that, in this embodiment of the disclosure, the basic priority sequence should be interpreted broadly, that is, it also includes the basic priority sequence determined by sorting the basic priority values ​​in ascending or descending order.

[0049] In a specific example of this disclosure, the six data items included in the data item set 1 and the basic priority values ​​of the data items can be represented as A:1, B:2, C:3, D:4, E:5, and F:6, respectively. Thus, the basic priority sequence determined by sorting the multiple data items based on their basic priority values ​​can be represented as: "A->B->C->D->E->F".

[0050] S120: Receive a request to adjust the priority setting of at least one data item in the data item set.

[0051] In this embodiment of the disclosure, one or more priority setting requests may be received to adjust the priority of at least one data item in the data item set.

[0052] In some embodiments of this disclosure, the request content of the priority setting adjustment request may include, but is not limited to, the identifier of the data item to be adjusted, priority adjustment features, etc.

[0053] In some embodiments of this disclosure, the priority adjustment features include, but are not limited to, priority adjustment flags or priority adjustment level values. In one example, the priority adjustment flag may include an upgrade flag and a downgrade flag. In yet another example, the priority adjustment level value may also include an upgrade priority value and a downgrade priority value, which will be described in detail below.

[0054] In some embodiments of this disclosure, a priority setting request can be used to implement a single data item priority increase adjustment or a data item priority decrease adjustment.

[0055] In one example, the adjustment priority setting request may include an upgrade priority setting request, wherein the upgrade priority setting request is used to request an increase in priority for at least one data item. In a specific example, referring to the specific example in 110 above, the content of the received upgrade priority setting request 1 is: "{"dataItem":"E,F","adjustFeature":"H"}", where the value of "dataItem" indicates that the data items targeted by the adjustment request are E and F, and the value of "adjustFeature" indicates that an upgrade flag "H" is requested to be added to data items E and F.

[0056] It should be understood that the upgrade markers in the above embodiments and the embodiments described below are merely examples. In other embodiments, other forms of upgrade / downgrade markers may be preset, and this disclosure does not limit them.

[0057] In yet another example, the priority setting adjustment request may include a priority downgrade setting request, wherein the priority downgrade setting request is used to request a priority reduction adjustment for at least one data item. In a specific example, referring to the specific example in 110 above, the content of the received priority downgrade setting request 2 is: "{"dataItem":"C,D","adjustFeature":"L"}", where the value of "dataItem" indicates that the adjustment request targets data items C and D, and the value of "adjustFeature" indicates that a downgrade flag "L" is requested to be added to data items C and D.

[0058] As previously stated, multiple priority setting adjustment requests can be received in this embodiment. It should be understood that, in this embodiment, for each data item, the requested priority adjustment method should be either an upgrade or a downgrade. In other words, when multiple priority setting adjustment requests are received, the data items requested for priority upgrade adjustment in the multiple priority setting requests are different from the data items requested for priority downgrade adjustment. In a specific embodiment, referring to the foregoing specific embodiments, for example, an upgrade priority setting request 1 and a downgrade priority setting request 2 can be received, where request 1 requests priority upgrade adjustment for data items E and F, and request 2 requests priority downgrade adjustment for data items C and D.

[0059] In other embodiments of this disclosure, a priority setting request may also be used to simultaneously perform priority increase adjustment on at least one data item and priority decrease adjustment on at least another data item.

[0060] In yet another specific example of this disclosure, referring to the specific example in 110 above, the content of the received priority setting adjustment request 3 is: "{"dataItem":"B,C","adjustFeature":"H"},{"dataItem":"D,E","adjustFeature":"L"}". Unlike the previous specific example, in the same request 3, while requesting the addition of the upgrade flag "H" to data items B and C, it also requests the addition of the downgrade flag "L" to data items D and E.

[0061] S130: Based on the priority setting request, set the priority adjustment feature for at least one data item.

[0062] In this embodiment of the disclosure, when setting a priority adjustment feature for at least one data item, the priority adjustment feature can be set on the data item without modifying its basic priority. In other words, setting the priority adjustment feature does not change the basic priority of the plurality of data items.

[0063] S140: Determine the final priority sequence based on the basic priority and priority adjustment features.

[0064] In this embodiment of the disclosure, the data items in the set of data items with the set priority adjustment features still maintain the original priority dependency relationship. As an explanation, the relative order between multiple data items with the same priority adjustment features is consistent with their relative order in the basic priority sequence.

[0065] The priority allocation method of the present disclosure will be further explained and described below with reference to several embodiments.

[0066] As previously described, in some embodiments of this disclosure, the priority adjustment feature may include a priority adjustment flag, which may include an upgrade flag and a downgrade flag. In one example, the upgrade flag may be preset to "H" and the downgrade flag to "L".

[0067] In this embodiment, when multiple data items have the same priority adjustment flag, the relative order between the multiple data items is consistent with their relative order in the basic priority sequence; when multiple data items have different priority adjustment flags, the relative order between the multiple data items is: data item with upgrade flag -> data item without priority adjustment flag -> data item with downgrade flag.

[0068] In some embodiments of this disclosure, the priority setting request may include an upgrade flag setting request. Accordingly, in some embodiments of this disclosure, reference is made to... Figure 2 The above 130 may include: S131: configuring an upgrade flag for at least one data item according to an upgrade priority setting request for at least one data item in the data item set.

[0069] In a specific example of this disclosure, referring to the specific examples in 110 and 120 above, the six data items included in the data item set 1 and the basic priority values ​​of the data items can be represented as A:1, B:2, C:3, D:4, E:5, F:6 respectively. According to the received upgrade priority setting request 1, the upgrade mark "H" is added to data items E and F. The six data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment features of the data items can be represented as A:1, B:2, C:3, D:4, E:5(H), F:6(H).

[0070] In this embodiment, reference continues. Figure 2The above 140 may include at least S141 to S143: S141: sorting multiple data items with upgrade tags according to the size of the basic priority; S142: placing data items with upgrade tags before untagged data items; S143: sorting untagged data items according to the basic priority.

[0071] It should be understood that S141, S142, and S143 above are only functional distinctions between the three steps, and do not imply that the three steps are arranged in a given order.

[0072] In a specific embodiment of this disclosure, referring to the specific example in section 131 above, for data items E and F with the upgrade marker "H", they are sorted according to their basic priority values ​​as "E->F"; data items E and F are arranged before unmarked data items A, B, C, and D; unmarked data items A, B, C, and D are sorted according to their basic priority values ​​as "A->B->C->D". Thus, the final priority sequence is determined to be "E->F->A->B->C->D".

[0073] In some embodiments of this disclosure, the priority setting request may further include a degradation flag setting request. Accordingly, in some embodiments of this disclosure, reference is made to... Figure 3 The above 130 may include: S131': configuring a degradation flag for at least one data item according to a degradation priority setting request for at least one data item in the data item set.

[0074] In a specific example of this disclosure, referring to the specific examples in 110 and 120 above, the six data items included in the data item set 1 and the basic priority values ​​of the data items can be represented as A:1, B:2, C:3, D:4, E:5, F:6 respectively. According to the received downgrade flag setting request 2, a downgrade flag "L" is added to data items C and D. The six data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment features of the data items can be represented as A:1, B:2, C:3(L), ​​D:4(L), E:5, F:6.

[0075] In this embodiment, reference continues. Figure 3 The above 140 may include at least S141' to S143': S141': sorting multiple data items with degradation labels according to the size of the basic priority; S142': placing the data items with degradation labels after the unlabeled data items; S143': sorting the unlabeled data items according to the basic priority.

[0076] In this embodiment, the descriptions of S131', S141' to S143' can be referred to the specific descriptions of S131, S141 to S143, the difference being that in 142', the data items with downgrade tags are placed after the untagged data items.

[0077] Following the previous specific embodiment, in yet another specific embodiment of this disclosure, for data items C and D with the downgrade marker "L", they are sorted according to their basic priority values ​​as "C->D"; data items C and D are arranged after unmarked data items A, B, E, and F; and unmarked data items A, B, E, and F are sorted according to their basic priority values ​​as "A->B->E->F". Thus, the final priority sequence is determined to be "A->B->E->F->C->D".

[0078] In some embodiments of this disclosure, multiple priority setting requests can be received. Accordingly, in some embodiments of this disclosure, setting priority adjustment features for at least one data item according to the priority setting request may include at least: setting an upgrade flag for a first data item according to an upgrade flag setting request for a first data item in the data item set; and setting a downgrade flag for a second data item according to a downgrade flag setting request for a second data item in the data item set.

[0079] In this embodiment, it should be understood that the first / second data item is used only to refer to one or more data items for which an upgrade / downgrade flag is requested to be set. In this embodiment, the first data item is different from the second data item.

[0080] In this embodiment, determining the final priority sequence based on the basic priority and priority adjustment features may include at least: sorting multiple first data items with upgrade tags according to the size of the basic priority; sorting multiple second data items with downgrade tags according to the size of the basic priority; placing the first data items with upgrade tags before the unmarked data items; placing the second data items with downgrade tags after the unmarked data items; and sorting the unmarked data items according to the basic priority.

[0081] In this embodiment, the description of the above steps can be referred to the description of S131, S131', S141~143, S141'~143', and will not be repeated here.

[0082] In other embodiments of this disclosure, as previously described, a priority setting request can also be used to simultaneously perform a priority increase adjustment on at least one data item and a priority decrease adjustment on at least another data item.

[0083] In a specific example of this disclosure, referring to the specific examples in 110 and 120 above, the six data items included in the data item set 1 and the basic priority values ​​of the data items can be represented as A:1, B:2, C:3, D:4, E:5, and F:6, respectively. According to the received downgrade priority setting request 3, upgrade marker "H" is added to data items B and C, and downgrade marker "L" is added to data items D and E. The six data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment features of the data items can be represented as A:1, B:2(H), C:3(H), D:4(L), E:5(L), and F:6.

[0084] In this embodiment, data items B and C with the upgrade marker "H" are sorted according to their basic priority values ​​as "B->C"; data items D and E with the downgrade marker "L" are sorted according to their basic priority values ​​as "D->E"; data items B and C are arranged before unmarked data items A and F; data items B and C are arranged after unmarked data items A and F; unmarked data items A and F are sorted according to their basic priority values ​​as "A->F". Therefore, the final priority sequence is determined as "B->C->A->F->D->E".

[0085] The method of this disclosure divides the priority setting of data items into two levels: basic priority and priority adjustment features. When data items have the same priority adjustment features, the relative order of the basic sequence between data items is maintained. This allows for rapid adjustment of priority without having to consider and modify the priority relationship between each data item individually when adjusting the priority of data items. At the same time, the original priority dependency relationship is maintained, thereby solving the technical problem of insufficient flexibility in priority adjustment in the prior art.

[0086] Meanwhile, in this embodiment of the disclosure, since the priority adjustment feature is independently attached to the data item and does not affect the relative order of the data item at the basic priority level, when it is necessary to restore the original priority order, it is only necessary to remove or partially remove the priority adjustment feature, and the relevant data items can be automatically restored to the priority order determined by the original basic priority sequence. There is no need to reset and recalculate the priority relationship between each data item, thereby realizing the rapid restoration of priority.

[0087] In other embodiments of this disclosure, as described above, the priority adjustment feature may further include adjusting priority values, which may include upgrade priority values ​​and downgrade priority values. In one example, the upgrade priority value may be preset to "H: Level Value" and the downgrade priority value to "L: Level Value". In some embodiments of this disclosure, the smaller the upgrade / downgrade priority value, the higher the upgrade / downgrade priority value; conversely, the larger the upgrade / downgrade priority value, the higher the upgrade / downgrade priority value. This disclosure does not impose any limitations on this.

[0088] In this embodiment, unlike the previous embodiment, the relative relationship between multiple data items that are set with upgrade priority values ​​(downgrade priority values) can be further determined by the value of their set upgrade priority values.

[0089] In some embodiments of this disclosure, reference is made to Figure 4 The above 130 may further include: S132: setting a corresponding upgrade priority value for at least one data item according to the upgrade priority setting request for at least one data item in the data item set.

[0090] In this embodiment, reference continues. Figure 4 The above 140 may further include S144 to S147: S144: Rank data items with lower upgrade priority values ​​before data items with higher upgrade priority values; S145: Sort multiple data items with the same upgrade priority value according to their basic priority; S146: Rank data items with upgrade priority values ​​before data items without upgrade priority values; S147: Sort marked data items without upgrade priority values ​​according to basic priority.

[0091] In this embodiment, for example, in S144 above, for multiple data items with set upgrade priority values, the relative order of the multiple data items can be determined according to the magnitude of their upgrade priority values. In a specific embodiment, the smaller the upgrade priority value, the higher the upgrade priority. The basic priority values ​​and upgrade priority values ​​set for data items A, B, and C can be represented as A:1 (H:2), B:2 (H:1), and C:3 (H:3). In this case, the relative priority order of the above data items can be determined as: B->A->C.

[0092] In this embodiment, the specific descriptions of S132, S145 to S147 can be referred to the specific descriptions of S131, S141 to S143 above. The difference is that what is set in S132, S145 to S147 is not an upgrade flag, but an upgrade priority value, which will not be repeated here.

[0093] In a specific example of this disclosure, according to the received upgrade priority setting request 4, an upgrade priority value "H:1" is added to data item B, and an upgrade priority value "H:2" is added to data items A and D. The six data items included in the adjusted data item set 1, as well as the basic priority values ​​and priority adjustment features of the data items, can be represented as A:1 (H:2), B:2 (H:1), C:3, D:4 (H:2), E:5, F:6.

[0094] In this embodiment, for data items A, B, and D with upgrade priority values, data item B (H: 1) is placed before data items A (H: 2) and D (H: 2); data items A: 1 and D: 4 are sorted according to their basic priority values ​​as A->D; data items A, B, and D with upgrade priority values ​​are placed before data items C, E, and F; and data items C, E, and F are sorted according to their basic priority values ​​as C->E->F. Therefore, the final priority sequence is determined as: "B->A->D->C->E->F".

[0095] In some embodiments of this disclosure, reference is made to Figure 5 The above 130 may further include: S132': setting a corresponding degradation priority value for at least one data item according to a degradation priority setting request for at least one data item in the data item set.

[0096] In this embodiment, reference Figure 5 The above 140 may further include S144' to S147': S144': arranging data items with lower downgrade priority values ​​after data items with higher downgrade priority values; S145': sorting multiple data items with the same downgrade priority value according to their basic priority; S146': arranging data items with downgrade priority values ​​after data items without downgrade priority values; S147': sorting marked data items without downgrade priority values ​​according to their basic priority.

[0097] In this embodiment, the specific descriptions of S132', S144' to S147' can be referred to the specific descriptions of S132, S144 to S147. The difference is that the priority values ​​set in S132', S144' to S147' are not upgrade priority values, but downgrade priority values. Data items with downgrade priority values ​​are ranked after data items without downgrade priority values, which will not be elaborated here.

[0098] In a specific example of this disclosure, according to the received downgrade priority setting request 5, an upgrade priority value "L:1" is added to data item B, and an upgrade priority value "L:2" is added to data items A and D. The six data items included in the adjusted data item set 1, as well as the basic priority values ​​and priority adjustment features of the data items, can be represented as A:1 (L:2), B:2 (L:1), C:3, D:4 (L:2), E:5, F:6.

[0099] In this embodiment, for data items A, B, and D with downgraded priority values, data item B (L:1) is placed after data items A (L:2) and D (L:2); data items A:1 and D:4 are sorted according to their basic priority values ​​as A->D; data items A, B, and D with downgraded priority values ​​are placed after data items C, E, and F; and data items C, E, and F are sorted according to their basic priority values ​​as C->E->F. Therefore, the final priority sequence is determined as: "C->E->F->A->D->B".

[0100] In some embodiments of this disclosure, multiple priority setting requests can be received. Accordingly, in some embodiments of this disclosure, setting priority adjustment features for at least one data item according to the priority setting request may include at least: setting an upgrade priority value for the first data item according to an upgrade priority setting request for a first data item in the data item set; and setting a downgrade priority value for the second data item according to a downgrade priority setting request for a second data item in the data item set.

[0101] In this embodiment, determining the final priority sequence based on basic priority and priority adjustment features may include: placing a first data item with a higher upgrade priority value before a first data item with a lower upgrade priority value; placing a second data item with a higher downgrade priority value after a second data item with a lower downgrade priority value; sorting multiple data items with the same priority value according to their basic priority; placing a first data item with an upgrade priority value before data items without any priority value; placing a second data item with a downgrade priority value after data items without any priority value; and sorting data items without any priority value according to their basic priority.

[0102] In this embodiment, the description of the above steps can be referred to the description of S132, S132', S144~147, S144'~147', and will not be repeated here.

[0103] In other embodiments of this disclosure, as previously described, a priority setting request can also be used to simultaneously perform a priority increase adjustment on at least one data item and a priority decrease adjustment on at least another data item.

[0104] In a specific example of this disclosure, according to the received downgrade priority setting request 6, an upgrade priority value "H:1" is added to data item B, an upgrade priority value "H:2" is added to data item C, an upgrade priority value "L:1" is added to data item D, and a downgrade priority value "L:2" is added to data item E. The six data items included in the adjusted data item set 1, as well as the basic priority values ​​and priority adjustment features of the data items, can be represented as A:1, B:2 (H:1), C:3 (H:2), D:4 (L:1), E:5 (L:2), and F:6.

[0105] In this embodiment, for data items B and C with upgrade priority values, data item B (H: 1) is placed before data item C (H: 2); for data items D and E with upgrade priority values, data item D (L: 1) is placed after data item E (L: 2); data items A and F are sorted according to their base priority values ​​as A->F; data items B and C with upgrade priority values ​​are placed before data items A and F; data items D and E with downgrade priority values ​​are placed after data items A and F. Therefore, the final priority sequence is determined as: "B->C->A->F->E->D".

[0106] The method of this disclosure further introduces a priority adjustment level value. In the priority setting of data items, a priority adjustment level value is introduced to adjust the priority adjustment layer. Among data items with the same priority adjustment level value, the relative order of the basic priority sequence is maintained. Among data items with different priority adjustment level values, the relative order of the data items is determined according to the numerical value of the priority adjustment level value, further enhancing the flexibility of priority adjustment. Furthermore, since the priorities in the method of this disclosure are dependent, when the basic priority of a data item is adjusted, all data items with priority dependencies on that data item will be automatically adjusted accordingly. This achieves the effect of quickly adjusting the overall priority relationship derived from it by adjusting the basic priority relationship. This design significantly reduces the complexity and maintenance cost of priority adjustment.

[0107] In some embodiments of this disclosure, a knowledge base response rule matching method is also provided. This method can be combined in a non-contradictory manner with the priority allocation method of any of the above embodiments of this disclosure. For example... Figure 6 As shown, the knowledge base response rule matching method may include at least S210 to S230 below.

[0108] S210: Obtain a set of keyword matching rules for multiple knowledge bases, with each knowledge base corresponding to different response content.

[0109] In this embodiment of the disclosure, the knowledge base is a structured knowledge cluster that stores multiple question-answer pairs for a specific scenario. In this embodiment, each question-answer pair in the knowledge base consists of a question corresponding to the business scenario of that knowledge base and a preset response. In one example, a complaint handling knowledge base can be used for intelligent customer service, where, for example, it stores a set of data items related to question-answer pairs concerning customer complaints and scheduled complaint resolution responses.

[0110] In some embodiments of this disclosure, the keywords include feature phrases used to identify input information (questions) and to match them with data items (answers) in a knowledge base. By way of explanation and not limitation, input information (such as user questions) may include sentences of varying lengths, in which case keywords within the sentences can help match appropriate data items (pre-defined responses). In a specific example, keywords in the complaint handling knowledge base may include "not received," "refund," and "complaint," among others.

[0111] In some embodiments of this disclosure, the keywords can be stored and matched in the form of matching rules to improve the flexibility and accuracy of data items (pre-defined responses) in the keyword matching knowledge base.

[0112] In some embodiments of this disclosure, the matching rules include, for example, regular expressions, which are combinations of multiple keywords according to specific rules. The keyword matching rule set may include multiple regular expressions for text matching. In a specific example, the regular expression for matching installation inquiries is "(how|how)(install|download)", and the regular expression for matching refund inquiries can be represented as "(not yet|not yet|not received)(received|paid)", etc.

[0113] In this embodiment, a set of keyword matching rules corresponding to multiple knowledge bases can be obtained. In this embodiment, when the input text successfully matches the keyword matching rule of a certain knowledge base in the keyword matching rule set, the system will return the corresponding response content from the matching knowledge base. In a specific example, when a user inputs "How do I install your APP?", the input text successfully matches the keyword matching rule "(how|how to).*(install|download)" in the APP installation knowledge base, and the system will return the APP installation steps guide from the preset APP installation knowledge base as the response content.

[0114] S220: Based on the preset business processing order, determine the priority relationship of each regular expression in the keyword matching rule set.

[0115] In this embodiment of the disclosure, the preset business processing order includes a predetermined expected knowledge base response order based on, but not limited to, business importance, urgency, and processing strategies. In a specific example, it is desirable to prioritize handling complaints related to customer satisfaction before handling inquiries related to routine procedures. In this case, the keyword matching rule corresponding to the complaint handling knowledge base can be set to high priority, while the keyword matching rule corresponding to the inquiry response database can be set to low priority.

[0116] In some embodiments of this disclosure, different basic priorities can be assigned to different keyword matching rules, thereby determining the priority relationship when the keyword matching rules are matched based on the basic priorities.

[0117] In some embodiments of this disclosure, the keyword matching rule set may include: a first type of regular expression for identifying user complaint intent; a second type of regular expression for identifying user product application status; and a third type of regular expression for identifying user installation guidance requirements. In this embodiment, the basic priority of the first type of regular expression is lower than the basic priority of the second type of regular expression, and the basic priority of the second type of regular expression is lower than the basic priority of the third type of regular expression. It should be understood that more types of regular expressions can be set in actual business processing, and the basic priority relationship between the regular expressions can also be adjusted accordingly; this disclosure does not impose any limitations on this.

[0118] In some embodiments of this disclosure, such as in S220, a priority allocation method as described in any of the above embodiments of this disclosure can be used to assign basic priorities to each keyword matching rule and to manage the priority relationships determined by each regular expression.

[0119] In this embodiment, the data item set in the priority allocation method of this disclosure may include the keyword matching rules in the knowledge base described in S220, and the aforementioned acquisition of the data item set with a basic priority sequence may include:

[0120] Obtain a set of keyword matching rules from the knowledge base, wherein each keyword matching rule in the set includes a regular expression for text matching; based on the business priority relationship between the keyword matching rules, assign a basic priority to each keyword matching rule in the set in sequence.

[0121] In some embodiments of this disclosure, a lower base priority value can be preset to indicate a higher priority. In this case, the base priority of the first type of regular expression can be set to be lower than the base priority of the second type of regular expression and the base priority of the third type of regular expression. In one specific embodiment, the base priority value of the first type of regular expression can be set to 1, the base priority value of the second type can be set to 2, and the base priority values ​​of the third type of regular expression can be set to 3.

[0122] S230: Obtain user input, and when the user input matches the regular expressions of multiple knowledge bases, determine the final knowledge base to use for the response based on the priority relationship.

[0123] In some embodiments of this disclosure, the priority relationship between multiple regular expressions can be determined, for example, based on the basic priority of the multiple regular expressions confirmed in the aforementioned S220.

[0124] In a specific embodiment of this disclosure, a user input is obtained: "Your service is terrible, when will my application be completed?" This user input simultaneously matches regular expression O1 (basic priority value 1) and regular expression O2 (basic priority value 2). Regular expression O1 is: "(complaint|dissatisfaction|question|poor service).*(request|processing)", and the preset response content of regular expression O1 is: "We are very sorry for the inconvenience caused to you, we will handle your problem immediately". Regular expression O2 is: "(application|processing).*(status|progress|how is it)", and the preset response content of regular expression O2 is: "You can check the application progress in the following ways". At this time, since the basic priority value (1) of regular expression O1 is higher than the basic priority value (2) of regular expression O2, the response content corresponding to regular expression O1 will be returned: "We are very sorry for the inconvenience caused to you, we will handle your problem immediately".

[0125] In some embodiments of this disclosure, the priority relationship can also be determined and managed by the priority adjustment features confirmed in the priority allocation method of the foregoing embodiments of this application.

[0126] Accordingly, in some embodiments of this disclosure, the knowledge base response rule matching method may further include: obtaining the text to be matched and performing a matching of the regular expressions in the keyword matching rule set with the text to be matched; when multiple regular expressions are detected to match the text to be matched at the same time: when there is a regular expression with priority adjustment feature among the multiple regular expressions, the final matching regular expression is selected according to the priority sequence rule.

[0127] In another specific embodiment of this disclosure, the user input is obtained as: "I haven't applied for a credit limit yet, nor have I installed your software." This user input simultaneously matches regular expression O3 (basic priority value 2) and regular expression O4 (basic priority value 1, upgrade flag H). Regular expression O3 is: "([still]|not at all|not at all)?[not yet]+have?((apply|process?|down)[pass this then you]|loan past|credit limit)". The default response content for regular expression O3 is: "Hello, regarding credit limit applications, we can help you apply online through the following methods." Regular expression O4 is: "[not yet]+have.*(install|download)(software|app)". The default response content for regular expression O4 is: "Hello, you only need to install our portal APP to quickly apply for a credit limit." Since regular expression O4 has the upgrade flag H, while regular expression O3 does not, the final response content corresponding to regular expression O4 will be returned as "Okay, you only need to install our portal APP to quickly apply for a credit limit."

[0128] This disclosure effectively solves the technical problem of unreasonable response content selection in traditional knowledge base systems under multiple matching scenarios by introducing the priority allocation method of this application embodiment into the knowledge base response rule matching. Furthermore, the solution of this disclosure supports flexible adjustment of the knowledge base response strategy based on basic priority values ​​and priority adjustment features according to actual business needs, significantly improving the service quality of the knowledge base in complex scenarios and providing a more efficient and flexible knowledge base response rule matching management solution.

[0129] In other embodiments of this disclosure, the length of the matching text fragment of the text to be matched may be further combined with the regular expression to determine the final knowledge base response content to be used.

[0130] In some embodiments of this disclosure, the knowledge base response rule matching method may further include: obtaining the text to be matched and performing a match between the regular expressions in the keyword matching rule set and the text to be matched; when multiple regular expressions are detected to match the text to be matched simultaneously: determining the final matching regular expression based on the length of the matching text segments of the multiple regular expressions and the text to be matched, and the priority order of each regular expression when there is a priority adjustment feature.

[0131] In another specific embodiment of this disclosure, the user input is obtained as: "I want to apply for a credit limit, but I haven't installed your software yet. I'd like to ask how to do it." This user input simultaneously matches regular expression O5 (basic priority value 2, upgrade priority value H: 1) and regular expression O6 (basic priority value 1, upgrade priority value H: 1). Regular expression O5 is: "(how|how to).*(install|download).*(software|application)". The preset response content for regular expression O5 is: "Hello, you can install our APP to conduct business by following these steps." The regular expression O6 is: "(application|processing).*(status|progress).(credit limit|credit)". The default response content of regular expression O6 is: "". Since regular expressions O5 and O6 both have an upgrade priority value H:1, and the matching text fragment of regular expression O5 is "how to install software", with a length of 6, while the matching text fragment of regular expression O6 is "apply for credit limit", with a length of 4, the final response content corresponding to regular expression O5 will be returned: "Okay, we can help you apply for credit limit online through the following methods".

[0132] The knowledge base response rule matching method disclosed herein, by further combining a judgment mechanism based on the length of the matched text fragment, can further distinguish the accuracy of the optimal matching result when the matching rule priorities are the same.

[0133] In some embodiments of this disclosure, such as Figure 7 As shown, a priority matching device 700 is also provided, which may include an acquisition unit 710, a receiving unit 720, a setting unit 730, and a determining unit 740.

[0134] The acquisition unit 710 is configured to acquire a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority.

[0135] The receiving unit 720 is configured to receive a request to adjust the priority setting of at least one data item in the data item set.

[0136] The setting unit 730 is configured to set a priority adjustment feature for at least one data item according to an adjustment priority setting request.

[0137] The determining unit 740 is configured to determine the final priority sequence based on the basic priority and priority adjustment features.

[0138] It should be understood that the priority matching device 700 in the embodiments of this disclosure is not limited to the above-described units / parts. The units / parts of the priority matching device 700 in the embodiments of this disclosure are combined with the units / parts of the knowledge base response rule matching device 800 described below in a non-contradictory manner to obtain new embodiments.

[0139] In some embodiments of this disclosure, such as Figure 8 As shown, a knowledge base reply rule matching device 800 is also provided, which may include an acquisition unit 810, a matching unit 820, and a determination unit 830.

[0140] The acquisition unit 810 is configured to acquire a set of keyword matching rules for multiple knowledge bases, each knowledge base corresponding to different response content, and the set of keyword matching rules includes multiple regular expressions for text matching.

[0141] The matching unit 820 is configured to determine the priority relationship of each regular expression in the keyword matching rule set based on a preset business processing order.

[0142] The determining unit 830 is configured to acquire user input, and when the user input simultaneously matches the regular expressions of multiple knowledge bases, determine the final knowledge base response content to be used based on the priority relationship.

[0143] It should be understood that the priority matching device 800 in the embodiments of this disclosure is not limited to the above-described units / parts. The units / parts of the priority matching device 800 in the embodiments of this disclosure are combined with the units / parts of the knowledge base response rule matching device 700 described above in a non-contradictory manner to obtain new embodiments.

[0144] In some embodiments of this disclosure, such as Figure 9 The diagram illustrates an electronic device 900 capable of implementing the methods of embodiments of the present disclosure. In some embodiments, it may include more or fewer electronic devices than illustrated. In some embodiments, it may be implemented using a single or multiple electronic devices. In some embodiments, it may be implemented using cloud-based or distributed electronic devices.

[0145] like Figure 9As shown, the electronic device 900 includes a processor 901, which can perform various appropriate operations and processes based on programs and / or data stored in read-only memory (ROM) 902 or programs and / or data loaded from storage portion 908 into random access memory (RAM) 903. The CPU 901 can be a multi-core processor or may contain multiple processors. In some embodiments, the processor 901 may include a general-purpose main processor and one or more special coprocessors, such as a graphics processing unit (GPU), a neural network processor (NPU), a digital signal processor (DSP), etc. Various programs and data required for the operation of the electronic device 900 are also stored in RAM 903. The CPU 901, ROM 902, and RAM 903 are interconnected via bus 904. An input / output (I / O) interface 905 is also connected to bus 904.

[0146] The processor and memory described above are used together to execute a program stored in the memory. When the program is executed by a computer, it can implement the steps or functions of the file transfer method described in the above embodiments.

[0147] The following components are connected to I / O interface 905: an input section 906 including a keyboard, mouse, touchscreen, etc.; an output section 907 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 908 including a hard disk, etc.; and a communication section 909 including a network interface card such as a LAN card, modem, etc. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to I / O interface 905 as needed. A removable medium 911, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 910 as needed so that computer programs read from it can be installed into storage section 908 as needed. Figure 9 The diagram only shows a portion of the components and does not imply that the computer system 900 only includes... Figure 9 The components shown.

[0148] In some embodiments, the electronic device 900 refers to a mobile terminal or computer, including mobile phones, vehicle terminals, smart TVs, etc. Taking a mobile phone as an example, the electronic device 900 also includes a touch screen display, external speakers, a gyroscope, a camera, a 4G / 5G antenna, and other device modules. The systems, devices, modules, or units described in the above embodiments can be implemented by a computer or its associated components.

[0149] Although not shown, in embodiments of this disclosure, a program product is provided, including a computer program that, when executed by a processor, implements the methods of any of the embodiments of this disclosure.

[0150] Although not shown, in embodiments of this disclosure, a storage medium is provided that stores a computer program configured to be executed to implement the methods of any of the embodiments of this disclosure.

[0151] The storage media in embodiments of this disclosure include articles that are permanent and non-permanent, removable and non-removable, capable of storing information by any method or technology. Examples of storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0152] The methods, programs, systems, apparatuses, etc., of the embodiments of this disclosure can be executed or implemented in a single or multiple networked computers, or practiced in a distributed computing environment. In the embodiments of this specification, in these distributed computing environments, tasks can be performed by remote processing devices connected via a communication network.

[0153] Those skilled in the art will understand that the embodiments described in this specification can be provided as methods, systems, or computer program products. Therefore, those skilled in the art will realize that the functional modules / units or controllers and related method steps described in the above embodiments can be implemented in software, hardware, or a combination of both.

[0154] Unless explicitly stated otherwise, the actions or steps of the methods or procedures described in the embodiments of this disclosure do not necessarily have to be performed in a specific order and can still achieve the desired results. In some implementations, multitasking and parallel processing are also possible or may be advantageous.

[0155] This document describes several embodiments of the present disclosure; however, for the sake of brevity, the descriptions of the embodiments are not exhaustive, and identical or similar features or portions between the embodiments may be omitted. In this document, "one embodiment," "some embodiments," "example," "specific example," or "some examples" refers to at least one embodiment or example applicable to the present disclosure, but not all embodiments. The above terms do not necessarily refer to the same embodiment or example. Without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples.

[0156] The exemplary systems and methods of this disclosure have been specifically shown and described with reference to the foregoing embodiments, and are merely examples of the best mode for implementing the systems and methods. Those skilled in the art will understand that various changes can be made to the embodiments of the systems and methods described herein without departing from the spirit and scope of this disclosure as defined in the appended claims when implementing the systems and / or methods.

Claims

1. A priority allocation method applied to an intelligent matching service scenario, characterized in that, include: Obtain a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority, and the data items include keyword rules; Receive a request to adjust the priority setting of at least one data item in the data item set; According to the priority setting request, a priority adjustment feature is set for the at least one data item, wherein the priority adjustment feature is set on the data item in a manner that does not modify the data item's base priority; and Based on the basic priority and the priority adjustment feature, the final priority sequence is determined, wherein the data items in the set of data items with the priority adjustment feature set still maintain the original priority dependency relationship, and the relative order among multiple data items with the same priority adjustment feature is consistent with their relative order in the basic priority sequence.

2. The priority allocation method according to claim 1, characterized by, The step of setting priority adjustment features for the at least one data item according to the priority setting request includes: setting an upgrade flag for the at least one data item according to the upgrade priority setting request for the at least one data item in the data item set; The step of determining the final priority sequence based on the basic priority and the priority adjustment features includes: Sort the multiple data items with the upgrade tag according to their basic priority. Data items with the upgrade tag will be ranked before untagged data items; and Sort the unlabeled data items according to their basic priority.

3. The priority allocation method of claim 1, wherein, The step of setting priority adjustment features for the at least one data item according to the priority setting request includes: setting a corresponding upgrade priority value for the at least one data item according to the upgrade priority setting request for the at least one data item in the data item set; The step of determining the final priority sequence based on the basic priority and the priority adjustment features includes: Data items with higher upgrade priority values ​​will be ranked before data items with lower upgrade priority values. Sort multiple data items with the same upgrade priority value according to their base priority. Data items with upgrade priority values ​​should be ranked before data items without upgrade priority values; and Data items that do not have an upgrade priority value are sorted according to their basic priority.

4. The priority allocation method of claim 1, wherein, The step of setting priority adjustment features for at least one data item according to the priority setting request includes: setting an upgrade flag for the first data item according to the upgrade priority setting request for the first data item in the data item set; and setting a downgrade flag for the second data item according to the downgrade priority setting request for the second data item in the data item set. The step of determining the final priority sequence based on the basic priority and the priority adjustment features includes: Sort the multiple first data items with the upgrade tag according to their basic priority. Sort the multiple second data items with the degradation flag according to their basic priority. The first data item with the upgrade tag is placed before the untagged data items; The second data item with the degradation tag will be placed after the untagged data item; and Sort the unlabeled data items according to their basic priority.

5. The priority allocation method according to claim 1, characterized in that, The step of setting priority adjustment features for at least one data item according to the priority setting request includes: setting an upgrade priority value for the first data item according to an upgrade priority setting request for the first data item in the data item set; and setting a downgrade priority value for the second data item according to a downgrade priority setting request for the second data item in the data item set. The step of determining the final priority sequence based on the basic priority and the priority adjustment features includes: The first data item with a higher upgrade priority value is placed before the first data item with a lower upgrade priority value. The second data item with the higher or lower priority value is placed after the second data item with the lower priority value. Sort multiple data items with the same priority value according to their underlying priority. The first data item with an upgrade priority value is placed before the data items without any priority value. The second data item with a downgraded priority value is placed after the data item with no priority value; and Sort data items that do not have any priority value according to the basic priority.

6. A knowledge base response rule matching method, characterized in that, include: Obtain keyword matching rule sets from multiple knowledge bases, each knowledge base corresponding to different response content. The keyword matching rule sets include multiple regular expressions used for text matching. Based on the preset business processing order, a priority relationship is determined for each regular expression in the keyword matching rule set, and priority management is performed using the priority allocation method described in any one of claims 1 to 5; as well as Obtain user input, and when the user input matches the regular expressions of multiple knowledge bases simultaneously, determine the final knowledge base to use for the response content based on the priority relationship.

7. The knowledge base response rule matching method according to claim 6, characterized in that, Also includes: Obtain the text to be matched and perform a match between the regular expression in the keyword matching rule set and the text to be matched; When multiple regular expressions are detected to simultaneously match the text to be matched: Based on the length of the matching text fragments of the multiple regular expressions and the text to be matched, and the priority order of each regular expression when there is a priority adjustment feature, the final matching regular expression is determined.

8. A priority matching device applied to intelligent matching business scenarios, characterized in that, include: The acquisition unit is configured to acquire a set of data items with a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority, and the data items include keyword rules. The receiving unit is configured to receive a request to adjust the priority setting of at least one data item in the data item set; The setting unit is configured to set a priority adjustment feature for the at least one data item according to the priority setting request, wherein the priority adjustment feature is set on the data item in a manner that does not modify the basic priority of the data item; as well as The determining unit is configured to determine the final priority sequence based on the basic priority and the priority adjustment feature, wherein the data items in the set of data items with the set priority adjustment feature still maintain the original priority dependency relationship, and the relative order between multiple data items with the same priority adjustment feature is consistent with their relative order in the basic priority sequence.

9. A knowledge base response rule matching device, characterized in that, include: The acquisition unit is configured to acquire a set of keyword matching rules for multiple knowledge bases, each knowledge base corresponding to different response content. The set of keyword matching rules includes multiple regular expressions for text matching. The matching unit is configured to determine the priority relationship of each regular expression in the keyword matching rule set based on a preset business processing order, and to perform priority management using the priority allocation method described in any one of claims 1 to 5. as well as The unit is configured to acquire user input, and when the user input matches regular expressions of multiple knowledge bases simultaneously, it determines the final knowledge base response content to be used based on the priority relationship.

10. An electronic device, characterized in that, include: A processor and a memory storing a computer program, the processor being configured to implement the method of any one of claims 1-7 when the computer program is executed.

11. A program product comprising a computer program, wherein, When the computer program is executed by a processor, it implements the method as described in any one of claims 1-7.

Images