# US 2012/0254262 A1 · Method, apparatus and computer program for model-driven message parsing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254262 A1
- Document ID: US20120254262A1
- Status: Published application
- Kind: A1
- Application number: 13/525,363
- Filed: 2012-06-18
- Published: 2012-10-04
- Earliest claimed: 2007-08-16
- Assignees: International Business Machines Corporation
- Inventors: Timothy Kimber
- Web page: https://patentgrep.com/patent/US20120254262A1

## CPC

- G06F 40/205: Parsing
- G06F 40/194: Calculation of difference between files
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

There is disclosed a method, apparatus and computer program for parsing a message using a message model. A message is received comprising one or more message fields. This message is stored as a reference bitstream. The message model is used to compare a message field in one or more subsequently received messages with the equivalent field in the reference bitstream. Finally, responsive to determining that a message field in said one or more subsequently received messages matches a field in the reference bitstream a predetermined number of times, storing parser outputs for the matching field for future reuse.

## Claims

### Claim 1

A method for parsing a message using a message model comprising:
receiving a message comprising one or more message fields; storing the message as a reference bitstream; using the message model to compare a message field in one or more subsequently received messages with the equivalent field in the reference bitstream; and responsive to determining that a message field in said one or more subsequently received messages matches a field in the reference bitstream a predetermined number of times, storing parser outputs for the matching field for future reuse.

### Claim 2 (depends on 1)

The method of claim 1, wherein the step of using the message model to compare a message field in said one or more subsequently received messages comprises: storing an index into each message field in the reference bitstream against an equivalent element in the message model.

### Claim 3 (depends on 1)

The method of claim 1, wherein the step of storing the message as a reference bitstream comprises: storing a portion of the reference bitstream against each associated element in the message model.

### Claim 4 (depends on 1)

The method of claim 1, comprising: determining that a message field in said one or more subsequently received message matches a field in the reference bitstream a predetermined number of times.

### Claim 5

(canceled)

### Claim 6 (depends on 1)

The method of claim 1 comprising: determining that parser outputs are stored for a particular message field in a subsequently received message; and using the parser outputs instead of parsing the message field.

### Claim 7

Apparatus for parsing a message using a message model comprising:
means for receiving a message comprising one or more message fields; means for storing the message as a reference bitstream; means for using the message model to compare a message field in one or more subsequently received messages with the equivalent field in the reference bitstream; and means, responsive to determining that a message field in said one or more subsequently received messages matches a field in the reference bitstream a predetermined number of times, for storing parser outputs for the matching field for future reuse.

### Claim 8 (depends on 7)

The apparatus of claim 7, wherein the means for using the message model to compare a message field in said one or more subsequently received messages comprises: means storing an index into each message field in the reference bitstream against an equivalent element in the message model.

### Claim 9 (depends on 7)

The apparatus of claim 7, wherein the means for storing the message as a reference bitstream comprises: means for storing a portion of the reference bitstream against each associated element in the message model.

### Claim 10 (depends on 7)

The apparatus of claim 7, comprising: means for determining that a message field in said one or more subsequently received message matches a field in the reference bitstream a predetermined number of times.

### Claim 11

(canceled)

### Claim 12 (depends on 7)

The apparatus of any of claim 7 comprising: means for determining that parser outputs are stored for a particular message field in a subsequently received message; and means for using the parser outputs instead of parsing the message field.

### Claim 13 (depends on 1)

A computer program comprising program code means adapted to perform the method of claim 1 when said program is run on a computer.
