Traitement en cours

Veuillez attendre...

Paramétrages

Paramétrages

Aller à Demande

1. WO2020159772 - MISE EN CORRESPONDANCE APPROXIMATIVE

Note: Texte fondé sur des processus automatiques de reconnaissance optique de caractères. Seule la version PDF a une valeur juridique

[ EN ]

CLAIMS

1. A method, comprising:

obtaining a first set of subconditions;

performing approximate matching of the first set of subconditions against a plurality of sets of subconditions, comprising:

accessing a second set of subconditions among the plurality of sets of subconditions, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of“don’t care”; and

approximately matching the first set of subconditions against the second set of subconditions, comprising:

comparing the first set of subconditions against the second set of subconditions; and

determining that a matching criterion is met based on a result of the matching; and

outputting information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions.

2. The method of claim 1, wherein the first set of subconditions comprises subconditions to be matched.

3. The method of claim 1, wherein the second set of subconditions comprises a rule corresponding to a row in a table of rules, or a root cause corresponding to a row in a table of root causes.

4. The method of claim 1, wherein the value is represented by a single bit.

5. The method of claim 1, wherein the value is represented by a single bit and an ANDN hardware instruction is used to match two values.

6. The method of claim 1, wherein the value is represented by two bits.

7. The method of claim 1, wherein comparing the first set of subconditions against the second set of subconditions comprises comparing entry by entry and/or comprises comparing block by block.

8. The method of claim 1, wherein the matching criterion can be met in cases with an exact match, so that the exact match would produce a result for the approximate match.

9. The method of claim 1, wherein the plurality of states further includes a state of “true.”

10. The method of claim 1, wherein an approximate match of a mask to a row is indicated as a result of a specified matching function.

11. The method of claim 1, wherein the approximate match is determined based on a row being under a distance threshold from a mask.

12. The method of claim 11, wherein the distance threshold is a percentage.

13. The method of claim 1, wherein the approximate match is determined based on at most N mismatched entries, N being a natural number.

14. The method of claim 1, wherein the approximate match is determined based on a row having a strength of match that is equal to or greater than a specified strength threshold.

15. The method of claim 14, wherein the specified strength threshold is a percentage.

16. The method of claim 1, wherein the approximate match is based on parameters that depend on a column and row of entries being matched.

17. The method of claim 1, wherein columns and/or rows are organized to allow a simple mapping from parameters to a mapped entry.

18. The method of claim 1, wherein the approximately matching of the first set of subconditions against the second set of subconditions includes applying a specialized sparse matrix-vector multiplication with a multiply operator computing a metric corresponding to distance or strength.

19. A system, comprising:

a processor configured to:

obtain a first set of subconditions;

perform approximate matching of the first set of subconditions against a plurality of sets of subconditions, comprising:

accessing a second set of subconditions among the plurality of sets of subconditions, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of“don’t care”; and approximately matching the first set of subconditions against the second set of subconditions, comprising:

comparing the first set of subconditions against the second set of subconditions; and

determining that a matching criterion is met based on a result of the matching; and

output information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions.

20. A computer program product, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for: obtaining a first set of subconditions;

performing approximate matching of the first set of subconditions against a plurality of sets of subconditions, comprising:

accessing a second set of subconditions among the plurality of sets of subconditions, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of“don’t care”; and

approximately matching the first set of subconditions against the second set of subconditions, comprising:

comparing the first set of subconditions against the second set of subconditions; and

determining that a matching criterion is met based on a result of the matching; and

outputting information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions.