Automatically generating regular expressions for relaxed matching of text patterns
US8484238B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 22, 2008 |
| Grant date | Jul 9, 2013 |
| Priority date | — |
| Expiry date | Nov 9, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/3338
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system for automatically generating regular expressions for relaxed matching of text patterns. A received input phrase expressed in a natural language is determined to be a plain text pattern. The plain text pattern is automatically tokenized, thereby generating a first token list. Rules loaded from a predefined rule set are automatically applied to the first token list to automatically generate a modified token list. The order of the rules being applied to the first token list is specified by the rule set. The modified token list is automatically converted into a regular expression that matches the plain text pattern and one or more variations of the plain text pattern. A utilization of the regular expression for an information extraction facilitates a recall and a precision of the information extraction.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.