Patent Document ID: 8447588
Application ID: 12338058

Base Claim:
1. A computer implemented method, comprising: recording in a memory input data having delimited strings; recording in the memory a region-matching transducer defining one or more patterns of one or more sequences of delimited strings, with at least one of the patterns defined in the region-matching transducer having an arrangement of a plurality of class-matching networks; the plurality of class-matching networks defining a combination of two or more entity classes from one or both of part-of-speech classes and application-specific classes; the region-matching transducer (i) having, for each of the one or more patterns, an arc that leads from a penultimate state with a transition label that identifies the entity class of the pattern, and (ii) sharing states between patterns leading to a penultimate state when segments of delimited strings making up two or more patterns overlap; applying the region-matching transducer recorded in the memory to the input data with an apply-stage replacement method, which apply-stage replacement method follows a longest match principle for identifying one or more patterns in the region-matching transducer that match one or more sequences of delimited strings in the input data; at least one of the matching sequences of delimited strings satisfying at least one pattern in the region-matching transducer defined by an arrangement of a plurality of class-matching networks, wherein the input data is not labeled with morphological tags when applying the region-matching transducer to the input data; and recording in the memory, in response to said applying, the one or more sequences of delimited strings in the input data matching the one or more patterns in the region-matching transducer.

---

Claim 14:
14. The method according to claim 1 , wherein the region-matching transducer identifies intelligible information in the input data.