Text Adjudication Using Alphabet-Linked Hash Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing text adjudication tools require excessive memory, time, and processing power to scan large amounts of input text for prohibited words and phrases, and are often proprietary, limiting their scalability and compatibility with various software programs.
Innovation Solution
A computerized method and system that uses a system datastructure with linked lists organized by alphabet letters to efficiently search for prohibited words and phrases, allowing for scalable and open text adjudication without excessive resource usage, and accepting input from diverse software programs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional text scanning tools are used to examine input text for prohibited words, then text adjudication can be performed, but excessive memory, time, and processing power are required
Solution Approach 1:
The text is divided into individual words, and each word is processed independently through the data structure. The prohibited words list is segmented and organized into an efficient search structure, allowing the system to process text in manageable units rather than analyzing entire documents at once, thus reducing memory and processing requirements
Solution Approach 2:
The patent replaces traditional linear scanning mechanisms with a hash-based data structure approach. Instead of sequentially searching through prohibited words lists, the system uses hash tables with linked lists to provide O(1) average time complexity for word lookups, substituting mechanical sequential search with a more efficient computational structure
2Adaptability or versatility
If proprietary text scanning tools are used, then text adjudication functionality is provided, but compatibility with various software programs is limited
Solution Approach 1:
The patent implements a universal text adjudication system that can accept input from multiple software programs and data sources. The core processing logic is designed to be platform-independent and can integrate with email systems, document management systems, and other communication tools, making the solution adaptable to diverse software environments without requiring proprietary integration for each platform
3Measurement precision
If large amounts of input text are examined, then comprehensive prohibited word detection is achieved, but excessive memory and time are required
Solution Approach 1:
The prohibited words are pre-loaded and organized into hash tables with linked lists before the actual text scanning begins. This preliminary organization of the search structure allows for extremely fast lookups during the scanning phase, as the system doesn't need to process or organize data during the actual text examination, thus reducing processing time while maintaining detection accuracy
Solution Approach 2:
The patent uses hash table copying techniques where the prohibited words structure can be efficiently replicated and distributed across different processing units or memory locations. This allows large volumes of text to be processed in parallel or distributed environments, maintaining detection precision while reducing the time burden on any single processing unit
Data Source
AI summary
A computerized method of adjudicating text against a policy includes receiving one or more system policies, creating a system datastructure for each received system policy, receiving an input message comprising a text to be adjudicated, selecting a system policy from the one or more received system policies based on the input message, and processing the text to be adjudicated and the system datastructure corresponding to the selected system policy to determine if a prohibited word is present in the text to be adjudicated. The one or more system policies include one or more prohibited words and a first hit value corresponding to each prohibited word. The system datastructure includes a plurality of linked lists corresponding the letters of the alphabet and a head linked list operable to store one or more found prohibited words.


