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

By dividing priority into two levels: basic and adjustment, and keeping the relative order of foundations unchanged during adjustment, the problem of inflexible priority adjustment in the existing technology has been solved, rapid adjustment and recovery have been achieved, and business flexibility in scenarios such as artificial intelligence customer service has been improved.

CN120541276AActive Publication Date: 2025-08-26BEIJING BAIRONG RUIBO TECH CO LTD
View PDF 19 Cites 0 Cited by

Patent Information

Application Number
CN202510675715.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-05-23
Publication Date
2025-08-26
Estimated Expiration
2045-05-23

AI Technical Summary

Technical Problem

The existing priority matching mechanism is not flexible enough in multiple matching scenarios, resulting in cumbersome operations and easy introduction of priority conflicts and errors. Especially in intelligent matching scenarios such as artificial intelligence customer service that involves knowledge base reply rules, it is impossible to quickly adjust and restore the priority order.

Method used

The priority setting of data items is divided into two levels: basic priority and adjustment priority. By keeping the basic relative order between data items unchanged when adjusting priority, and introducing priority adjustment features or values, quickly adjusting and restoring priority order.

Benefits of technology

It realizes rapid adjustment and recovery of priority in multiple matching scenarios, improves business flexibility and accuracy, and reduces operational complexity and conflict risks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120541276A_ABST
    Figure CN120541276A_ABST
Patent Text Reader

Abstract

The invention discloses a priority distribution method, which comprises the following steps: acquiring a data item set with a basic priority sequence, each data item in the basic priority sequence having different basic priorities; receiving an adjustment priority setting request for at least one data item in the data item set; setting a priority adjustment feature for the at least one data item according to the priority adjustment setting request; a final priority sequence is determined based on the base priority and the priority adjustment features, where the relative order among the plurality of data items having the same priority adjustment features is consistent with its relative order in the base priority sequence. The invention further provides a priority distribution device, electronic equipment and a program product. According to the method disclosed by the invention, the rapid adjustment of the priority is realized, meanwhile, the original priority dependency relationship can be maintained so as to facilitate rapid recovery after adjustment, and the flexibility of priority adjustment is remarkably improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of computer application technology, and in particular to a priority allocation method, a knowledge base reply rule matching method, and related devices, electronic devices, and program products. Background Art

[0002] Currently, in various AI matching scenarios, one piece of input information often matches multiple rules at the same time. At this time, a priority matching mechanism is usually used to determine the final matching result.

[0003] However, existing priority matching mechanisms typically rely on setting a single priority value for each rule and then sorting them by value to determine the final matching result. This mechanism, when temporarily adjusting the priority of a rule, requires checking and modifying 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 priority conflicts and errors.

[0004] Therefore, there is an urgent need for an improved priority management solution with a simple structure and high flexibility to solve the problem of low flexibility in priority adjustment in multiple matching scenarios.

[0005] The content of this background technology description is only for facilitating understanding of the relevant technology in this field and is not regarded as an admission of the prior art. Summary of the Invention

[0006] The embodiments of the present disclosure aim to provide a priority allocation method and apparatus, an electronic device, and a program product, which can alleviate or solve at least one of the technical problems mentioned above.

[0007] In a first aspect, an embodiment of the present disclosure provides a priority allocation method, which may include:

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

[0009] receiving a request for adjusting priority setting for at least one data item in the set of data items;

[0010] setting a priority adjustment feature for the at least one data item according to the priority adjustment setting request; and

[0011] A final priority sequence is determined based on the basic priority and the priority adjustment feature, wherein the relative order between multiple data items with the same priority adjustment feature is consistent with their relative order in the basic priority sequence.

[0012] In a second aspect, an embodiment of the present disclosure provides a knowledge base reply rule matching method, which may include:

[0013] Obtaining a keyword matching rule set for multiple knowledge bases, each knowledge base corresponding to different reply content, the keyword matching rule set including multiple regular expressions for text matching;

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

[0015] User input is obtained, and when the user input hits regular expressions of multiple knowledge bases at the same time, the knowledge base reply content to be finally used is determined according to the priority relationship.

[0016] In a third aspect, an embodiment of the present disclosure further provides a priority matching device, which may include:

[0017] An acquiring unit configured to acquire a set of data items having a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority;

[0018] a receiving unit configured to receive a request for adjusting the priority setting of at least one data item in the set of data items;

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

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

[0021] In a fourth aspect, an embodiment of the present disclosure further provides a knowledge base reply rule matching device, which may include:

[0022] an acquisition unit configured to acquire a keyword matching rule set of a plurality of knowledge bases, each knowledge base corresponding to different reply content, the keyword matching rule set including a plurality of regular expressions for text matching;

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

[0024] The determination unit is configured to obtain user input and, when the user input hits regular expressions of multiple knowledge bases at the same time, determine the knowledge base reply content to be finally used according to the priority relationship.

[0025] In a fifth aspect, an embodiment of the present disclosure further provides an electronic device, which may include: a processor and a memory storing a computer program, wherein the processor is configured to implement the method described in the first aspect or the second aspect when running the computer program.

[0026] In a sixth aspect, an embodiment of the present disclosure further provides a program product, comprising a computer program, wherein when the computer program is executed by a processor, the method as described in the first aspect or the second aspect is implemented.

[0027] The method of the embodiment of the present disclosure divides the priority setting of data items into two levels: basic priority and adjusted priority value, and maintains the relative order of the basic sequence between data items when they have the same adjusted priority value. When adjusting the priority of data items, there is no need to consider and modify the priority relationship between each data item one by one, so that the priority can be quickly adjusted while maintaining the original priority dependency relationship, thereby solving the technical problem of insufficient flexibility in data item priority adjustment in existing intelligent matching technologies.

[0028] Other optional features and technical effects of the embodiments of the present disclosure are partially described below, and partially can be understood by reading this document. BRIEF DESCRIPTION OF THE DRAWINGS

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

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

[0031] Figure 2 FIG2 shows a second exemplary flow chart of a priority allocation method according to an embodiment of the present disclosure;

[0032] Figure 3 FIG3 shows a third exemplary flow chart of a priority allocation method according to an embodiment of the present disclosure;

[0033] Figure 4 FIG4 shows a fourth exemplary flow chart of a priority allocation method according to an embodiment of the present disclosure;

[0034] Figure 5 FIG5 shows a fifth exemplary flow chart of a priority allocation method according to an embodiment of the present disclosure;

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

[0036] Figure 7 shows an exemplary structural diagram of a priority allocation device according to an embodiment of the present disclosure;

[0037] Figure 8 An exemplary structural diagram of a knowledge base reply rule matching device 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 method according to an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0039] In order to make the purpose, technical solutions and advantages of the present disclosure more clearly understood, the present disclosure is further described in detail below in conjunction with specific embodiments and drawings. Here, the illustrative embodiments of the present disclosure and their descriptions are used to explain the present disclosure, but are not intended to limit the present disclosure.

[0040] As used herein, the term "including" and its variations represent open inclusion, i.e., "including but not limited to." Unless otherwise stated, the term "or" means "and / or." The term "based on" means "based at least in part on." The terms "an example embodiment" and "an embodiment" mean "at least one example embodiment." The term "another embodiment" means "at least one 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 priority matching solution known to the inventor, a basic priority configuration is set for each smart matching business scenario, and on this basis, dynamic priority adjustments are made according to different specific needs. However, in this solution, if it is necessary to temporarily increase the response priority of a certain type of rule, the manager first needs to identify the 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 first. 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 issues (priority 1), B: Product consultation issues (priority 2), C: Holiday event issues (priority 3), D: Account issues (priority 4). When the priority of "holiday event issues" needs to be increased during the holidays, the existing solution needs to manually adjust the priority of the holiday event issues to 1. In order to prevent priority conflicts caused by the same priority, it is also necessary to adjust the priority of general issues to 2 and the priority of product consultation to 3. The steps are very cumbersome and easily introduce priority conflicts.

[0042] In another priority matching scheme known to the inventor, a combination of multiple priority tables is used to implement complex matching priority management. Although this scheme has certain flexibility, due to the lack of priority dependencies between rule entries across priority tables, the operation is complicated when the priority of certain rules needs to be temporarily adjusted. It may even be necessary to create a new priority set table, or adjust the response priorities between multiple priority tables at the same time. The correctness of the adjusted priority sequence is difficult to guarantee.

[0043] The inventors further realized that no matter which of the above solutions is used, after temporarily adjusting the priority of certain rules, if you want to restore the priority before the adjustment, you need to repeat the tedious adjustment again, and it is impossible to quickly restore the priority before the adjustment. This defect greatly affects the flexibility of artificial intelligence-related businesses. The inventors also further realized that in the current priority-based intelligent matching scenarios, especially in scenarios involving knowledge base reply rules such as artificial intelligence customer service, hundreds or thousands of rule entries are often involved. In order to accurately match user needs and respond, it is usually necessary to introduce a priority mechanism to handle multiple matching situations involving a large number of matching rules. In this scenario, the problem of not being able to flexibly adjust the matching priority of reply rules in batches becomes particularly serious, greatly affecting the flexibility of the knowledge base reply business.

[0044] Therefore, the embodiment of the present disclosure provides a priority allocation method. The solution of the embodiment of the present disclosure divides the priority setting of data items involved in intelligent matching scenarios into two levels: basic priority and adjustment priority. The adjustment priority is used to enhance the priority adjustment of the basic priority without affecting the relative priority order of the original basic priority level. The data items with the same adjustment priority value maintain the relative priority order based on the basic priority level, and when adjusting the priority of the data item, there is no need to consider and modify the priority relationship between each data item one by one, so that the priority can be quickly adjusted. At the same time, because the original priority dependency can be maintained, the technical problem of insufficient flexibility of priority adjustment in the prior art is solved. The embodiment of the present disclosure further proposes a knowledge base response rule intelligent matching method that can be combined with this priority allocation method, which significantly improves the adjustment flexibility of the knowledge base when facing different scenarios, and provides a more efficient and flexible knowledge base response rule matching management solution.

[0045] In an embodiment of the present disclosure, the data item set includes multiple data items (Data Item) that can be managed for matching priority in a matching scenario, wherein the data item is the smallest object for priority matching and management, and each data item can be independently identified and the 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 the present disclosure, Figure 1 As shown, a priority allocation method is provided, which can be widely used in business scenarios configured with priority matching. In some business scenarios, the priority allocation method provided in this embodiment can be executed by, 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, anti-fraud systems, etc. Figure 1 The method may include at least S110 to S140.

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

[0048] In the embodiment of the present disclosure, the data item set may include multiple data items, wherein the multiple data items may respectively have different basic priorities (in some examples, the priorities are represented by numerical values), and the data item priority order sequence determined based on the basic priorities of the multiple data items may be referred to as a basic priority sequence. It should be understood that in the embodiment of the present disclosure, the basic priority sequence should be interpreted in a broad sense, that is, it also covers the basic priority sequence determined by sorting the basic priority values ​​in ascending or descending order.

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

[0050] S120: Receive a request for adjusting the priority level of at least one data item in the data item set.

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

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

[0053] In some embodiments of the present 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 flags may include an upgrade flag and a downgrade flag. In another example, the priority adjustment level values ​​may also include an upgrade priority value and a downgrade priority value, which will be described in detail below.

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

[0055] In one example, the priority adjustment request may include an upgrade priority setting request, wherein the upgrade priority setting request is used to request that the priority of at least one data item be adjusted to increase. In a specific example, referring to the specific example in 110 above, the request content of the received upgrade priority setting request 1 is: "{"dataItem":"E,F","adjustFeature":"H"}", wherein 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 the upgrade mark "H" is requested to be added to the data items E and F.

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

[0057] In another example, the priority adjustment request may include a priority downgrade request, wherein the priority downgrade request is used to request that the priority of at least one data item be adjusted to a lower level. In a specific example, referring to the specific example in 110 above, the request content of the received priority downgrade request 2 is: "{"dataItem":"C,D","adjustFeature":"L"}", wherein the value of "dataItem" indicates that the data items targeted by the adjustment request are C and D, and the value of "adjustFeature" indicates that a downgrade mark "L" is requested to be added to the data items C and D.

[0058] As mentioned above, in the embodiment of the present disclosure, multiple priority adjustment setting requests may be received. It should be understood that in this embodiment, for each data item, the priority adjustment method requested should be one of upgrading or downgrading. In other words, in the case of receiving multiple priority adjustment setting requests, the data items requested for priority upgrading by the multiple priority adjustment setting requests are different from the data items requested for priority reduction. In a specific embodiment, with reference to the aforementioned specific embodiment, for example, a priority upgrade setting request 1 and a priority downgrade setting request 2 may be received, and the data items requested for priority upgrading by request 1 are E and F, and the data items requested for priority reduction by request 2 are C and D.

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

[0060] In another specific example of the present disclosure, referring to the specific example in the aforementioned 110, the request content of the received priority adjustment setting request 3 is: "{"dataItem":"B,C","adjustFeature":"H"},{"dataItem":"D,E","adjustFeature":"L"}". The difference from the previous specific example is that the same request 3 requests to add an upgrade mark "H" to data items B and C, and also requests to add a downgrade mark "L" to data items D and E.

[0061] S130: Setting a priority adjustment feature for at least one data item according to the priority adjustment setting request.

[0062] In an embodiment of the present disclosure, when setting a priority adjustment feature for at least one data item, the priority adjustment feature can be set on the data item in a manner that does not modify the basic priority of the data item. In other words, setting the priority adjustment feature does not change the basic priorities of the multiple data items.

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

[0064] In the embodiment of the present disclosure, the data items in the data item set with the priority adjustment feature still maintain the original priority dependency. For explanation, the relative order between multiple data items with the same priority adjustment feature remains consistent with their relative order in the basic priority sequence.

[0065] The priority allocation method of the embodiment of the present disclosure will be further explained and described below in conjunction with multiple embodiments.

[0066] As mentioned above, in some embodiments of the present 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 are set with the same priority adjustment mark, the relative order between the multiple data items remains consistent with their relative order in the basic priority sequence; when multiple data items are set with different priority adjustment marks, the relative order between the multiple data items is: data items with upgrade marks -> data items without priority adjustment marks -> data items with downgrade marks.

[0068] In some embodiments of the present disclosure, the adjustment priority setting request may include an upgrade flag setting request. Figure 2 , the above 130 may include: S131: configuring an upgrade mark 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 the present disclosure, with reference 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 respectively expressed as A: 1, B: 2, C: 3, D: 4, E: 5, F: 6, and according to the received upgrade priority setting request 1, the upgrade mark "H" is added to the 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 characteristics of the data items can be expressed as A: 1, B: 2, C: 3, D: 4, E: 5 (H), F: 6 (H).

[0070] In this embodiment, continue to refer to Figure 2The above 140 may at least include S141 to S143: S141: sorting multiple data items with upgrade marks according to the size of basic priority; S142: arranging data items with upgrade marks before unmarked data items; S143: sorting unmarked data items according to basic priority.

[0071] It should be understood that the above S141, S142, and S143 are merely 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 the present disclosure, referring to the specific example in 131 above, data items E and F with the upgrade mark "H" are sorted according to their basic priority values ​​as "E->F". Data items E and F are placed 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 as "E->F->A->B->C->D".

[0073] In some embodiments of the present disclosure, the adjustment priority setting request may further include a demotion flag setting request. Figure 3 , the above 130 may include: S131′: configuring a degradation mark 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 the present disclosure, with reference 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 respectively expressed as A: 1, B: 2, C: 3, D: 4, E: 5, F: 6, and the demotion mark "L" is added to the data items C and D according to the received demotion mark setting request 2. The six data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment characteristics of the data items can be expressed as A: 1, B: 2, C: 3 (L), D: 4 (L), E: 5, F: 6.

[0075] In this embodiment, continue to refer to Figure 3 , the above 140 may at least include S141'~S143': S141': sorting multiple data items with degradation marks according to the size of basic priority; S142': arranging the data items with degradation marks after the unmarked data items; S143': sorting the unmarked data items according to the basic priority.

[0076] In this embodiment, the description of S131', S141' to S143' can refer to the specific description of S131, S141 to S143, except that, in 142', the data items with degradation marks are arranged after the unmarked data items.

[0077] Continuing from the previous embodiment, in another embodiment of the present disclosure, data items C and D with the downgraded flag "L" are sorted according to their basic priority values ​​as "C->D." Data items C and D are placed after unmarked data items A, B, E, and F. 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 as "A->B->E->F->C->D."

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

[0079] In this embodiment, it should be understood that the first / second data item is only used 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, the final priority sequence is determined based on the basic priority and the priority adjustment feature, which may at least include: sorting multiple first data items with upgrade marks according to the size of the basic priority; sorting multiple second data items with downgrade marks according to the size of the basic priority; arranging the first data items with upgrade marks before the unmarked data items; arranging the second data items with downgrade marks 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 refer to the description of S131, S131', S141-143, S141'-143', and will not be repeated here.

[0082] In other embodiments of the present disclosure, as described above, a certain priority setting adjustment request may also be used to simultaneously increase the priority of at least one data item and decrease the priority of at least another data item.

[0083] In a specific example of the present disclosure, with reference 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 respectively expressed as A: 1, B: 2, C: 3, D: 4, E: 5, F: 6. According to the received downgrade priority setting request 3, the upgrade mark "H" is added to the data items B and C, and the downgrade mark "L" is added to the 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 characteristics of the data items can be expressed as A: 1, B: 2 (H), C: 3 (H), D: 4 (L), E: 5 (L), F: 6.

[0084] In this embodiment, data items B and C with the upgrade mark "H" are sorted according to their basic priority values ​​as "B->C"; data items D and E with the downgrade mark "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; and unmarked data items A and F are sorted according to their basic priority values ​​as "A->F". Thus, the final priority sequence is determined as "B->C->A->F->D->E".

[0085] The method of the embodiment of the present disclosure divides the priority setting of data items into two levels: basic priority and priority adjustment characteristics, and maintains the relative order of the basic sequences between data items when they have the same priority adjustment characteristics. When adjusting the priority of data items, there is no need to consider and modify the priority relationship between each data item one by one, so that the priority can be quickly adjusted while maintaining the original priority dependency, thereby solving the technical problem of insufficient flexibility in priority adjustment in the prior art.

[0086] At the same time, in the embodiment of the present disclosure, since the priority adjustment feature is independently attached to the data item and does not affect the relative order of the data items 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, without the need to re-set and calculate the priority relationship between the data items, thereby achieving rapid recovery of the priority.

[0087] In other embodiments of the present disclosure, as described above, the priority adjustment feature may further include adjusting a priority value, and the adjusted priority value may include an upgrade priority value and a downgrade priority value. In one example, for example, the upgrade priority value may be preset as "H: level value" and the downgrade priority value may be preset as "L: level value". In some embodiments of the present disclosure, a smaller value of the upgrade / downgrade priority value may be set to represent a higher upgrade / downgrade priority value, and a larger value of the upgrade / downgrade priority value may be set to represent a higher upgrade / downgrade priority value, and the present disclosure does not impose any restrictions on this.

[0088] In this embodiment, unlike the aforementioned embodiment, among multiple data items set with upgrade priority values ​​(downgrade priority values), the relative relationship between the multiple data items can be further determined by the numerical values ​​of the upgrade priority values ​​set thereto.

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

[0090] In this embodiment, continue to refer to Figure 4 , the above 140 may also include S144 to S147: S144: sorting data items with lower upgrade priority values ​​before data items with higher upgrade priority values; S145: sorting multiple data items with the same upgrade priority value according to the size of their basic priority; S146: sorting data items with upgrade priority values ​​before data items without upgrade priority values; S147: sorting marked data items without upgrade priority values ​​according to the basic priority.

[0091] In this embodiment, for example, in S144 above, for multiple data items with upgrade priority values, the data items may be ranked relative to each other based on the numerical values ​​of their upgrade priority values. In one specific embodiment, the smaller the numerical value of the upgrade priority value, the higher the upgrade priority. For example, the basic priority values ​​and upgrade priority values ​​of data items A, B, and C may be represented as A:1 (H:2), B:2 (H:1), and C:3 (H:3). In this case, the relative priority ranking of the data items may be determined as: B->A->C.

[0092] In this embodiment, the specific description of the above S132, S145~S147 can refer to the specific description of the above 131, 141~143. The difference is that what is set in the above S132, S145~S147 is not an upgrade mark, but an upgrade priority value, which will not be repeated here.

[0093] In a specific example of the present disclosure, according to the received upgrade priority setting request 4, the upgrade priority value "H:1" is added to the data item B, and the upgrade priority value "H:2" is added to the data items A and D. The 6 data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment characteristics of the data items can be expressed 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 upgraded priority values, data item B (H:1) is sorted before data items A (H:2) and D (H:2); data items A:1 and D:4 are sorted A->D based on their base priority values; data items A, B, and D with upgraded priority values ​​are sorted before data items C, E, and F; and data items C, E, and F are sorted C->E->F based on their base priority values. Thus, the final priority sequence is determined as: "B->A->D->C->E->F."

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

[0096] In this embodiment, reference Figure 5 , the above 140 may also include S144'~S147': S144': sort the data items with lower degraded priority values ​​after the data items with higher degraded priority values; S145': sort the multiple data items with the same degraded priority value according to the size of their basic priority; S146': sort the data items with degraded priority values ​​after the data items without degraded priority values; S147': sort the marked data items without degraded priority values ​​according to the basic priority.

[0097] In this embodiment, the specific description of the above S132', S144'~S147' can refer to the specific description of the above S132, S144~S147, the difference is that what is set in the above S132', S144'~S147' is not an upgrade priority value, but a downgrade priority value. Data items with downgraded priority values ​​are arranged after data items without downgraded priority values, which will not be repeated here.

[0098] In a specific example of the present disclosure, according to the received downgrade priority setting request 5, the upgraded priority value "L: 1" is added to the data item B, and the upgraded priority value "L: 2" is added to the data items A and D. The 6 data items included in the adjusted data item set 1 and the basic priority values ​​and priority adjustment characteristics of the data items can be expressed 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 sorted after data items A (L:2) and D (L:2); data items A:1 and D:4 are sorted A->D based on their base priority values; data items A, B, and D with downgraded priority values ​​are sorted after data items C, E, and F; and data items C, E, and F are sorted C->E->F based on their base priority values. Thus, the final priority sequence is determined as: "C->E->F->A->D->B".

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

[0101] In this embodiment, the final priority sequence is determined based on the basic priority and priority adjustment characteristics, which may include: placing a first data item with a higher upgraded priority value before a first data item with a lower upgraded priority value; placing a second data item with a higher downgraded priority value after a second data item with a lower downgraded priority value; sorting multiple data items with the same priority value according to the size of their basic priorities; placing a first data item with an upgraded priority value before a data item without any priority value; placing a second data item with a downgraded priority value after a data item without any priority value; and sorting data items without any priority value according to the basic priority.

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

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

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

[0105] In this embodiment, for data items B and C with upgraded priority values, data item B (H: 1) is sorted before data item C (H: 2); for data items D and E with upgraded priority values, data item D (L: 1) is sorted after data item E: 5 (L: 2); data items A and F are sorted A->F according to the size of their basic priority values; data items B and C with upgraded priority values ​​are sorted before data items A and F; data items D and E with downgraded priority values ​​are sorted after data items A and F. Thus, the final priority sequence is determined as: "B->C->A->F->E->D".

[0106] The method of the embodiment of the present disclosure further introduces a priority adjustment level value, and further introduces a priority adjustment level value level in the priority setting of the data item. The relative order of the basic priority sequence is maintained between data items with the same priority adjustment level value, and the relative order of data items with different priority adjustment level values ​​is determined according to the numerical value of the priority adjustment level value, thereby further enhancing the flexibility of priority adjustment. And because the priority in the method of the embodiment of the present disclosure has a dependency relationship, when the basic priority of a data item is adjusted, all data items that have a priority dependency relationship with the data item will be automatically adjusted accordingly, thereby achieving the effect of quickly adjusting the overall priority relationship derived therefrom by adjusting the basic priority relationship. This design significantly reduces the complexity and maintenance cost of priority adjustment.

[0107] In some embodiments of the present disclosure, a knowledge base reply rule matching method is further provided, and the knowledge base reply rule matching method can be combined with the priority allocation method of any of the above embodiments of the present disclosure in a non-contradictory manner. Figure 6 As shown, the knowledge base reply rule matching method may at least include the following S210 to S230.

[0108] S210: Obtain keyword matching rule sets for multiple knowledge bases, each knowledge base corresponding to different reply content.

[0109] In the disclosed embodiments, the knowledge base is a structured knowledge cluster that can store multiple question-answer pairs for a specific scenario. In this embodiment, each question-answer pair in the knowledge base is a question and a predefined response corresponding to the business scenario of the knowledge base. In one example, a complaint handling knowledge base can be used for intelligent customer service, storing, for example, a collection of data items related to question-answer pairs related to customer complaints and predefined complaint resolution responses.

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

[0111] In some embodiments of the present disclosure, the keywords may be stored and matched in the form of matching rules to improve the flexibility and accuracy of keyword matching with data items (predetermined responses) in a knowledge base.

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

[0113] In an embodiment of the present disclosure, 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 knowledge base in the keyword matching rule set, the system will return the corresponding reply content in the matched knowledge base. In a specific example, when the user inputs "How do I install your APP?", the input text successfully matches the keyword matching rule "(how|how).*(install|download)" of the APP installation knowledge base, and the system will return the APP installation step instructions in the preset APP installation knowledge base as the reply content.

[0114] S220: Determine a priority relationship for each regular expression in the keyword matching rule set based on a preset business processing order.

[0115] In the disclosed embodiments, the preset business processing sequence includes, but is not limited to, a predetermined expected knowledge base response sequence based on business importance, urgency, and processing strategy. In one specific example, in business processing, it is desired to prioritize complaint issues related to customer satisfaction over consultation issues related to routine processes. In this case, the keyword matching rules corresponding to the complaint handling knowledge base can be set to a high priority, while the keyword matching rules corresponding to the consultation response database can be set to a low priority.

[0116] In some embodiments of the present disclosure, different basic priorities may be assigned to different keyword matching rules, so that the priority relationship of the keyword matching rules during matching may be determined according to the basic priorities.

[0117] In some embodiments of the present disclosure, the keyword matching rule set may include: a first type of regular expression for identifying user complaint intentions; 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 categories of regular expressions can be set in actual business processing, and the basic priority relationship between the regular expressions can also be adjusted accordingly, and the present disclosure does not impose any restrictions on this.

[0118] In some embodiments of the present disclosure, for example, in S220, a priority assignment method as described in any of the above embodiments of the present disclosure may be used to assign a basic priority to each keyword matching rule, and manage the priority relationship determined by each regular expression.

[0119] In this embodiment, the data item set in the priority assignment method of the embodiment of the present disclosure may include the keyword matching rule in the knowledge base described in S220. The aforementioned acquisition of the data item set having the basic priority sequence may include:

[0120] A keyword matching rule set is obtained from a knowledge base, wherein each keyword matching rule in the keyword matching rule set includes a regular expression for text matching; and a basic priority is sequentially assigned to each keyword matching rule in the keyword matching rule set based on a business priority relationship between the keyword matching rules.

[0121] In some embodiments of the present disclosure, the smaller the value of the basic priority, the higher the priority. In this case, the basic priority of the first category of regular expressions can be set to be lower than the basic priority of the second category of regular expressions and the basic priority of the third category of regular expressions. In a specific embodiment, the basic priority value of the first category of regular expressions can be set to 1, the basic priority value of the second category can be set to 2, and the basic priority value of the third category of regular expressions can be set to 3.

[0122] S230: Obtain user input, and when the user input hits regular expressions of multiple knowledge bases at the same time, determine the knowledge base reply content to be finally used according to the priority relationship.

[0123] In some embodiments of the present disclosure, the priority relationship between the multiple regular expressions may be determined according to the basic priorities of the multiple regular expressions confirmed in the aforementioned S220, for example.

[0124] In a specific embodiment of the present disclosure, a user input is obtained: "Your service is too poor. When will the business I applied for be completed?" The user input hits both regular expression O1 (basic priority value 1) and regular expression O2 (basic priority value 2), wherein regular expression O1 is: "(complaint|dissatisfaction|question|poor service).*(request|processing)", and the preset reply content of regular expression O1 is: "We are very sorry for the inconvenience. We will deal with your problem immediately." Regular expression O2 is: "(application|processing).*(status|progress|how it goes)", and the preset reply 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 reply content corresponding to regular expression O1 will eventually be returned: "We are very sorry for the inconvenience. We will deal with your problem immediately."

[0125] In some embodiments of the present disclosure, the priority relationship may also be confirmed and managed by the priority adjustment feature confirmed in the priority allocation method of the aforementioned embodiment of the present application.

[0126] Accordingly, in some embodiments of the present disclosure, the knowledge base reply rule matching method may further include: obtaining the text to be matched and performing matching between the regular expression 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 at the same time: when there is a regular expression with a priority adjustment feature among the multiple regular expressions, the final matching regular expression is selected according to the priority sequence determination rule.

[0127] In another specific embodiment of the present disclosure, user input is obtained: "I have not applied for a credit line, nor have I installed your software." The user input simultaneously hits regular expression O3 (basic priority value 2) and regular expression O4 (basic priority value 1, upgrade mark H), wherein regular expression O3 is: "([yet]|at all|at all)? [Not yet]+have? ((apply for|process?|download)[have you ever]|borrowed|credit line)", and the preset reply content of regular expression O3 is: "Hello, regarding loan line application, we can apply online for you through the following methods", and regular expression O4 is: "[Not yet]+have.*(install|download)(software|app)", and the preset reply content of regular expression O4 is: "Hello, you only need to install our portal APP to quickly apply for a credit line", and at this time, since regular expression O4 has the upgrade mark H and regular expression O3 does not have the upgrade mark, the reply content corresponding to regular expression O4 will be returned in the end: "Okay, you only need to install our portal APP to quickly apply for a credit line."

[0128] This disclosure effectively solves the technical problem of unreasonable response content selection in traditional knowledge base systems in multiple matching scenarios by introducing the priority allocation method of the present application embodiment into the knowledge base response rule matching. The disclosed solution also supports flexible adjustment of the knowledge base response strategy based on the basic priority value and priority adjustment characteristics 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 the present disclosure, the final knowledge base reply content may be determined by further combining the regular expression with the length of the matching text segment of the text to be matched.

[0130] In some embodiments of the present disclosure, the knowledge base reply rule matching method may also include: obtaining the text to be matched and executing the matching of the regular expression 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: determining the final matching regular expression 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.

[0131] In another specific embodiment of the present disclosure, a user input is obtained: "I want to apply for a credit limit, but I haven't installed your software yet. I would like to ask how to do it." The user input simultaneously hits the regular expression O5 (basic priority value 2, upgrade priority value H: 1) and the regular expression O6 (basic priority value 1, upgrade priority value H: 1). Among them, the regular expression O5 is: "(how|how).*(install|download).*(software|application)", and the preset reply content of the regular expression O5 is: "Hello, you can follow the steps below to install our APP for business Service processing", regular expression O6 is: "(application|processing).*(status|progress).(quota|credit)", the preset reply content of regular expression O6 is: "", at this time, since regular expressions O5 and O6 both have the upgrade priority value H: 1, and the matching text fragment entered by the user for regular expression O5 is "how to install software", with a length of 6, and the matching text fragment entered by the user for regular expression O6 is "apply for quota", with a length of 4, the reply content corresponding to regular expression O5 will eventually be returned: "OK, regarding the quota application, we can apply for you online through the following methods."

[0132] The knowledge base reply rule matching method disclosed in the present invention can further distinguish the accuracy of the optimal matching result when the matching rule priorities are the same by further combining the judgment mechanism based on the length of the matching text fragment.

[0133] In some embodiments of the present disclosure, Figure 7 As shown, a priority matching device 700 is further provided, which may include an acquiring unit 710 , a receiving unit 720 , a setting unit 730 and a determining unit 740 .

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

[0135] The receiving unit 720 is configured to receive a request for adjusting 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 a priority adjustment setting request.

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

[0138] It should be understood that in the embodiment of the present disclosure, the priority matching device 700 is not limited to the above-mentioned units / parts. The units / parts of the priority matching device 700 of the embodiment of the present 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 a new embodiment.

[0139] In some embodiments of the present disclosure, 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 from a plurality of knowledge bases, each knowledge base corresponding to different reply content, and the set of keyword matching rules includes a plurality of regular expressions for text matching.

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

[0142] The determining unit 830 is configured to obtain user input, and when the user input hits regular expressions of multiple knowledge bases at the same time, determine the knowledge base reply content to be finally used according to the priority relationship.

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

[0144] In some embodiments of the present disclosure, Figure 9 , a schematic diagram of an electronic device 900 that can implement the method of the disclosed embodiment is provided. In some embodiments, more or fewer electronic devices may be included than shown. In some embodiments, the method can be implemented using a single or multiple electronic devices. In some embodiments, the method can 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 according to the programs and / or data stored in the read-only memory (ROM) 902 or the programs and / or data loaded from the storage part 908 into the random access memory (RAM) 903. CPU 901 can be a multi-core processor or can include multiple processors. In some embodiments, the processor 901 can 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. In RAM 903, various programs and data required for the operation of the electronic device 900 are also stored. CPU 901, ROM 902 and RAM 903 are connected to each other via a bus 904. Input / output (I / O) interface 905 is also connected to bus 904.

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

[0147] The following components are connected to the I / O interface 905: an input section 906 including a keyboard, a mouse, a touch screen, and the like; an output section 907 including devices such as a cathode ray tube (CRT), a liquid crystal display (LCD), and a speaker; a storage section 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card or a modem. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as needed. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, and the like, is installed in the drive 910 as needed, so that computer programs read therefrom can be installed into the storage section 908 as needed. Figure 9 Only some components are shown schematically, which does not mean that the computer system 900 only includes Figure 9 Components shown.

[0148] In some embodiments, the electronic device 900 refers to a mobile terminal or computer, including a mobile phone, an in-vehicle terminal, a smart TV, etc. Taking a mobile phone as an example, the electronic device 900 also includes a touch screen display, an external speaker, 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 an embodiment of the present disclosure, a program product is provided, including a computer program, which implements any method of the embodiments of the present disclosure when executed by a processor.

[0150] Although not shown, in an embodiment of the present disclosure, a storage medium is provided, wherein the storage medium stores a computer program, and the computer program is configured to implement any method of the embodiments of the present disclosure when executed.

[0151] Storage media in embodiments of the present disclosure include permanent and non-permanent, removable and non-removable items that can be used to store information using 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 technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.

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

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

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

[0155] In this document, multiple embodiments of the present disclosure are described, but for the sake of brevity, the description of each embodiment is not exhaustive, and the same or similar features or parts between the various embodiments may be omitted. In this document, "one embodiment", "some embodiments", "example", "specific example", or "some examples" are intended to apply to at least one embodiment or example according to the present disclosure, rather than all embodiments. The above terms do not necessarily mean to refer to the same embodiment or example. Those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, unless they are contradictory.

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

Claims

1. A priority allocation method, characterized in that: include: Acquire 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 request for adjusting priority setting for at least one data item in the set of data items; setting a priority adjustment feature for the at least one data item according to the priority adjustment setting request; as well as A final priority sequence is determined based on the basic priority and the priority adjustment feature, wherein the relative order between 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 in that: The setting of a priority adjustment feature for the at least one data item according to the priority adjustment setting request includes: setting an upgrade flag for the at least one data item according to the upgrade priority setting request for at least one data item in the set of data items; The determining of a final priority sequence based on the basic priority and the priority adjustment feature includes: sorting the plurality of data items having the upgrade mark according to the size of the basic priority; sorting the data items with the upgrade mark before the unmarked data items; and Sort the unlabeled data items by base priority.

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

4. The priority allocation method according to claim 1, characterized in that: The setting of a priority adjustment feature for the at least one data item according to the priority adjustment setting request includes: setting an upgrade flag for a first data item in the data item set according to an upgrade priority setting request for the first data item; and setting a downgrade flag for a second data item in the data item set according to a downgrade priority setting request for the second data item; The determining of a final priority sequence based on the basic priority and the priority adjustment feature includes: sorting the plurality of first data items having the upgrade mark according to the size of the basic priority; sorting the plurality of second data items having the degradation marks according to the size of the basic priority; arranging the first data item with the upgrade mark before the unmarked data item; sorting the second data item having the downgraded mark after the unmarked data item; and Sort the unlabeled data items by base priority.

5. The priority allocation method according to claim 1, characterized in that: The setting of a priority adjustment feature for the at least one data item according to the priority adjustment setting request includes: setting an upgrade priority value for a first data item in the data item set according to an upgrade priority setting request for the first data item; and setting a downgrade priority value for a second data item in the data item set according to a downgrade priority setting request for the second data item; The determining of a final priority sequence based on the basic priority and the priority adjustment feature includes: sorting a first data item having a higher upgrade priority value before a first data item having a lower upgrade priority value; sorting the second data item having the higher degraded priority value behind the second data item having the lower degraded priority value; Sort multiple data items with the same priority value according to the size of their basic priority; sorting a first data item having an upgraded priority value before a data item having no priority value; sorting the second data item having the downgraded priority value after the data item having no priority value; and Data items that do not have any priority value are sorted according to the base priority.

6. A knowledge base reply rule matching method, characterized in that: include: Obtaining a keyword matching rule set for multiple knowledge bases, each knowledge base corresponding to different reply content, the keyword matching rule set including multiple regular expressions for text matching; Based on a preset business processing order, determining a priority relationship for each regular expression in the keyword matching rule set, and adopting the priority allocation method described in any one of claims 1 to 5 to perform priority management; as well as User input is obtained, and when the user input hits regular expressions of multiple knowledge bases at the same time, the knowledge base reply content to be finally used is determined according to the priority relationship.

7. The knowledge base reply rule matching method according to claim 6, characterized in that: Also includes: Obtaining a text to be matched and performing a match between a regular expression in the keyword matching rule set and the text to be matched; When it is detected that multiple regular expressions simultaneously match the text to be matched: A final matching regular expression is determined based on the lengths of matching text segments between the multiple regular expressions and the text to be matched, and the priority order of each regular expression when a priority adjustment feature exists.

8. A priority matching device, characterized in that: include: An acquiring unit configured to acquire a set of data items having a basic priority sequence, wherein each data item in the basic priority sequence has a different basic priority; a receiving unit configured to receive a request for adjusting the priority setting of at least one data item in the set of data items; a setting unit configured to set a priority adjustment feature for the at least one data item according to the priority adjustment setting request; as well as The determining unit is configured to determine a final priority sequence based on the basic priority and the priority adjustment feature, wherein 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 reply rule matching device, characterized in that: include: an acquisition unit configured to acquire a keyword matching rule set of a plurality of knowledge bases, each knowledge base corresponding to different reply content, the keyword matching rule set including a plurality of regular expressions for text matching; a matching unit configured to determine a priority relationship for 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 according to any one of claims 1 to 5; as well as The determination unit is configured to obtain user input and, when the user input hits regular expressions of multiple knowledge bases at the same time, determine the knowledge base reply content to be finally used according to the priority relationship.

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

11. A program product comprising a computer program, wherein When the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Method and system for context-aware data prioritization

    CA2628348A1

  • Power distribution method and terminal

    CN110636532A

  • Resource space display method and device and electronic equipment

    CN112016026A

  • Information display method and device and projection equipment

    CN113220954A

  • Question response method and device, equipment and storage medium

    CN114168724A