Back to results
US 2014/0006010 A1Published application
Parsing rules for data
OwnerIgor Nor, Ron Maurerinventors
Life of this patent
Estimating the term…
Abstract
Disclosed herein are techniques for formulating parsing rules. Substrings are detected in an input data. Each substring is associated with a semantic token that categorizes each substring. Patterns of semantic tokens are identified. Rules for parsing the input data are formulated based at least partially on the patterns of semantic tokens.
Claims19
A system, the system comprising:
- a processor to:
- determine at least one rule for partitioning input data into substrings, each substring comprising at least one character;
- associate each substring with a semantic token that categorizes each substring;
- identify patterns of semantic tokens;
- and
- formulate parsing rules for records in the input data based at least partially on the patterns of semantic tokens.
3 more elements
A non-transitory computer readable medium having instructions stored therein which, if executed, causes a processor to:
- detect a delimiter that separates substrings in an input data, each substring in the input data comprising at least one character;
- and
- determine a category for each substring separated by the delimiter;
- associate each substring with a semantic token that categorizes each substring;
- generate a string of semantic tokens such that the semantic tokens are ordered in accordance with an order of the substrings associated therewith;
- identify patterns in the string of the semantic tokens using a suffix tree data structure;
- and
- formulate parsing rules for records in the input data based at least partially on the patterns of semantic tokens identified in the suffix tree data structure.
5 more elements
A method comprising:
- detecting, using a processor, substrings in an input data, each substring comprising at least one character;
- associating, using the processor, each substring with a semantic token that categorizes each substring;
- generating, using the processor, a string of semantic tokens such that the semantic tokens are ordered in accordance with an order of the substrings associated therewith;
- storing, using the processor, the string of semantic tokens in a suffix tree data structure;
- analyzing, using the processor, patterns in the string of semantic tokens using the suffix tree data structure;
- formulating, using the processor, parsing rules for records in the input data based at least partially on the patterns of semantic tokens identified in the suffix tree data structure;
- and
- parsing, using the processor, the input data using the parsing rules.
5 more elements
Dependencies are inferred from the claim text.