System and method for symbol-space based compression of patterns
AssigneeCortica, Ltd.
InventorsIgal Raichelgauz, Karina Odinaev, Yehoshua Y. Zeevi
Life of this patent
Estimating the term…
Abstract
A method and system for symbol-space based pattern compression is provided. The method includes identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and storing the output sequence as a data layer.
Claims15
A method for symbol-space based pattern compression, comprising:
- identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length;
- generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length;
- and
- storing the output sequence as a data layer.
A system for symbol-space based pattern compression, comprising:
- a processing unit;
- and
- a memory, the memory containing instructions that, when executed by the processing unit, configure the system to:
- identify a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length;
- generate an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length;
- and
- store the output sequence as a data layer.
Dependencies are inferred from the claim text.