18070791. REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS simplified abstract (Oracle International Corporation)
Contents
- 1 REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS
Organization Name
Oracle International Corporation
Inventor(s)
ALEKSEI Kashuba of Zurich (CH)
ALEXANDER Ulrich of Freiburg (DE)
REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS - A simplified explanation of the abstract
This abstract first appeared for US patent application 18070791 titled 'REGULAR EXPRESSION MATCHING IN DICTIONARY-ENCODED STRINGS
Simplified Explanation
The patent application describes techniques for generating an encoded-string automaton for a regex pattern from a decoded-string automaton of the regex pattern. The process involves obtaining a decoded-string automaton of the regex pattern and applying unique decoded string values from the dictionary of the encoding. This application of unique values at selected states in the decoded-string automaton results in transitions to target states, which in turn generates transitions in the encoded-string automaton. These transitions are conditioned on the token of the unique decoded string value in the dictionary.
- Decoded-string automaton is obtained from a regex pattern.
- Unique decoded string values from the encoding dictionary are applied at selected states.
- Transitions to target states in the decoded-string automaton are generated.
- Transitions in the encoded-string automaton are created based on the unique decoded string values.
Potential Applications
The technology described in the patent application could be applied in:
- Text processing systems
- Data validation tools
- Pattern matching algorithms
Problems Solved
This technology helps in:
- Efficiently encoding regex patterns
- Automating the generation of encoded-string automata
- Improving the performance of string matching processes
Benefits
The benefits of this technology include:
- Increased efficiency in pattern recognition
- Enhanced automation in encoding processes
- Improved accuracy in string matching algorithms
Potential Commercial Applications
The technology could be commercially applied in:
- Software development tools
- Cybersecurity systems
- Data analytics platforms
Possible Prior Art
One possible prior art for this technology could be:
- Research papers on automata theory and string matching algorithms
What are the limitations of this technology in real-world applications?
The limitations of this technology in real-world applications include:
- Complexity in handling large regex patterns
- Performance issues with extremely large dictionaries
How does this technology compare to existing methods of automaton generation?
This technology offers:
- More efficient encoding of regex patterns
- Improved automation in the generation of encoded-string automata
Original Abstract Submitted
Techniques are described for generating an encoded-string automaton for a regex pattern from a decoded-string automaton of the regex pattern. In an embodiment, the process obtains a decoded-string automaton of the regex pattern and applies unique decoded string value(s) from the dictionary of the encoding. When applied at a selected state in the decoded-string automaton, the application may yield a transition to at least one target state in the decoded-string automaton for a unique dictionary value. Such a transition generates a transition in the encoded-string automaton from an encoded state corresponding to the selected state in the decoded-string automaton to a target state in the encoded-string automaton corresponding to the target state in the decoded-string automaton. The generated transition in the encoded-string automaton is conditioned on the token of the unique decoded string value in the dictionary.
