Regular-Expression Dictionary for Textual Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing regular-expression libraries cannot be used alone for computerized textual analysis as they lack the capabilities provided by exact-match dictionaries, such as resource management and integration with programming language libraries, limiting the ability to retrieve information from regular expressions in text.
Innovation Solution
A regular-expression dictionary is constructed using a markup-language schema with defined data types and a mapping methodology, allowing entries to be mapped to a markup-language structure and bound to an object-oriented programming language class, enabling the dictionary to be used for textual analysis with capabilities like API access and resource management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing regular-expression libraries are used, then regular expression matching capability is provided, but they cannot be employed for computerized textual analysis due to lacking resource management and programming language library integration
Solution Approach 1:
The patent merges the regular-expression library with the dictionary structure, combining two previously separate components into a unified system. The regular-expression dictionary class integrates both the lexical database functionality and the regular-expression matching capability, allowing the system to provide both exact-match and pattern-based matching while maintaining resource management and API accessibility.
Solution Approach 2:
The regular-expression dictionary class serves multiple functions: it acts as a lexical database for textual analysis, provides regular-expression pattern matching, manages resources through loading and unloading mechanisms, and offers programmatic access via APIs. This multi-functionality resolves the contradiction by making the library adaptable to textual analysis while maintaining its core regular-expression capabilities.
2Adaptability or versatility
If exact-match dictionaries are used for textual analysis, then resource management and API access are provided, but they cannot handle regular expressions that match multiple notations
Solution Approach 1:
The system transitions from static exact-match dictionary entries to dynamic regular-expression patterns. The regular-expression dictionary class allows entries to be defined with flexible patterns that can adapt to multiple notations and formats, while the matching process dynamically evaluates these patterns against the input text, providing both flexibility and precision.
Solution Approach 2:
The patent changes the parameter of matching from exact character-by-character comparison to pattern-based matching with configurable regular-expression syntax. This allows the system to handle multiple notations (such as different date formats or currency representations) while maintaining measurement precision through the structured definition of matching criteria in the dictionary entries.
Data Source
AI summary
A regular-expression dictionary, as opposed to an exact-match dictionary, is constructed for utilization within computerized textual analysis. One or more data types are defined for entries within the regular-expression dictionary, within a markup-language schema. A structure in the markup-language schema is provided that encompasses the data types of the entries within the regular-expression dictionary. For each of a number of entries of the regular-expression dictionary, a mapping methodology is defined between a source definition of the entry to the structure and the data types within the markup-language schema. Furthermore, a definition of the entry is mapped to the data types within the structure of the markup-language schema, using the mapping methodology defined. The markup language may be eXtensible Markup Language (XML), or another type of markup language.