Describes how to approximate the regular expression pattern.
Size of this structure in bytes, for versioning. Use the sizeof() operator to calculate this value.
This is the weight/penalty associated with insertions.
This is the weight/penalty associated with deletions.
This is the weight/penalty associated with replacements.
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 .
When approximating a pattern against an input, some characters maybe inserted to get a successful match, this field sets the maximum number of insertions.
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.
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.
Maximum allowed number of errors total.
Help Collections
Raster .NET | C API | C++ Class Library | HTML5 JavaScript
Document .NET | C API | C++ Class Library | HTML5 JavaScript
Medical .NET | C API | C++ Class Library | HTML5 JavaScript
Medical Web Viewer .NET
Multimedia
Direct Show .NET | C API | Filters
Media Foundation .NET | C API | Transforms
Supported Platforms
.NET, Java, Android, and iOS/macOS Assemblies
Imaging, Medical, and Document
C API/C++ Class Libraries
Imaging, Medical, and Document
HTML5 JavaScript Libraries
Imaging, Medical, and Document