L_RegexCostOptions

typedef struct L_RegexCostOptions 
{ 
   L_UINT StructSize; 
   L_UINT InsertedCost; 
   L_UINT DeletedCost; 
   L_UINT SubstitutedCost; 
   L_UINT MaximumCost; 
   L_UINT MaximumInserts; 
   L_UINT MaximumDeletes; 
   L_UINT MaximumSubstitutes; 
   L_UINT MaximumErrors; 
} L_RegexCostOptions; 

Describes how to approximate the regular expression pattern.

Members

StructSize

Size of this structure in bytes, for versioning. Use the sizeof() operator to calculate this value.

InsertedCost

This is the weight/penalty associated with insertions.

DeletedCost

This is the weight/penalty associated with deletions.

SubstitutedCost

This is the weight/penalty associated with replacements.

MaximumCost

When approximating a pattern against an input, the input can be altered to get a successful match, each operation that alters input has its cost, this field controls the maximum cost allowed .

MaximumInserts

When approximating a pattern against an input, some characters maybe inserted to get a successful match, this field sets the maximum number of insertions.

MaximumDeletes

When approximating a pattern against an input, some characters may get delete to get a successful match, this field sets the maximum number of deletions.

MaximumSubstitutes

When approximating a pattern against an input, some characters may get replaced to get a successful match, this field sets the maximum number of replacements.

MaximumErrors

Maximum allowed number of errors total.

See Also

Functions

Help Version 22.0.2021.11.10
Products | Support | Contact Us | Intellectual Property Notices
© 1991-2022 LEAD Technologies, Inc. All Rights Reserved.

LEADTOOLS Raster Imaging C API Help
Products | Support | Contact Us | Intellectual Property Notices
© 1991-2022 LEAD Technologies, Inc. All Rights Reserved.