Constructing regular-expression dictionary for textual analysis

• US 20070265833A1
• Filed: 05/13/2006
• Published: 11/15/2007
• Est. Priority Date: 05/13/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Nakayama, Akihiro
• Granted Patent: US 7,684,976 B2
• Time in Patent Office: Days
• US Class Current: 704/10
• CPC Class Codes: G06F 40/117 Tagging; Marking up details of markup languages G06F40/143; Designating a block; Setting of attributes style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/242 Dictionaries

Abstract

A regular-expression dictionary, as opposed to an exact-match dictionary, is constructed for utilization within computerized textual analysis. One or more data types are defined for entries within the regular-expression dictionary, within a markup-language schema. A structure in the markup-language schema is provided that encompasses the data types of the entries within the regular-expression dictionary. For each of a number of entries of the regular-expression dictionary, a mapping methodology is defined between a source definition of the entry to the structure and the data types within the markup-language schema. Furthermore, a definition of the entry is mapped to the data types within the structure of the markup-language schema, using the mapping methodology defined. The markup language may be eXtensible Markup Language (XML), or another type of markup language.

Claims

1. A computer-implemented method for constructing a regular-expression dictionary, as opposed to an exact-match dictionary, for utilization in computerized textual analysis, the method comprising:

defining one or more data types for entries within the regular-expression dictionary in a markup-language schema;

providing a structure in the markup-language schema encompassing the data types of the entries within the regular-expression dictionary;

for each entry of a plurality of the entries,

defining a mapping methodology between a source definition of the entry to the structure and the data types within the markup-language schema; and

,

mapping a definition of the entry to the data types within the structure of the markup-language schema using the mapping methodology.

2. The method of claim 1, further comprising, for each entry, binding the entry, the definition of which has been mapped to the data types within the structure of the markup-language schema, to a class of an object-oriented programming language.

3. The method of claim 2, further comprising compiling the class to which each entry has been bound to construct a binary version of the regular-expression dictionary.

4. The method of claim 2, wherein the object-oriented programming language is the Java programming language.

5. The method of claim 1, wherein the structure corresponds to a uniform resource identifier (URI), and the data types correspond to the URI, a protocol of the URI, a host of the URI, and a path of the URI.

6. The method of claim 1, wherein the structure corresponds to a date, and the data types correspond to the date, a year of the date, a month of the date, and a day of the date.

7. The method of claim 1, wherein the structure corresponds to a currency, and the data types-correspond to the currency, a currency type of the currency, and a currency value of the currency.

8. The method of claim 1, wherein the structure corresponds to an organic compound, and the data types correspond to at least one or more of the organic compound, a fatty acid of the organic compound, a number of carbons of the organic compound, and a number of double bonds of the organic compound.

9. The method of claim 1, wherein the structure corresponds to a product, and the data types correspond to at least one or more of the product, a vendor of the product, a brand of the product, a product name of the product, a series of the product, a product number of the product, and an edition of the product.

10. The method of claim 1, wherein the markup-language is the extensible Markup Language (XML).

11. A computerized system comprising:

a computer-readable medium storing data representing a regular-expression dictionary, as opposed to an exact-match dictionary; and

,

a textual analysis component to analyze textual data by using at least the regular-expression dictionary.

12. The system of claim 11, wherein the regular-expression dictionary defines a plurality of entries that are each capable of being expressed in substantially more than one manner, as opposed to the exact-match dictionary defining a plurality of entries that are each capable of being expressed in substantially a single manner.

13. The system of claim 11, wherein the regular-expression dictionary defines data types for entries therewithin, in a markup-language schema.

14. The system of claim 11, wherein the regular-expression dictionary defines structures for entries therewithin, in a markup-language schema.

15. The system of claim 11, wherein the regular-expression dictionary exposes one or more application programming interfaces (API'"'"'s) by which the textual analysis component accesses the regular-expression dictionary to match strings within the textual data and to receive definitions of the strings.

16. An article of manufacture comprising:

a tangible computer-readable medium; and

,

means within the medium for effecting a regular-expression dictionary, as opposed to an exact-match dictionary, for utilization in computerized textual analysis.

17. The article of manufacture of claim 16, wherein the regular-expression dictionary defines a plurality of entries that are each capable of being expressed in substantially more than one manner, as opposed to the exact-match dictionary defining a plurality of entries that are each capable of being expressed in substantially a single manner.

18. The article of manufacture of claim 16, wherein the regular-expression dictionary defines data types for entries therewithin, in a markup-language schema.

19. The article of manufacture of claim 16, wherein the regular-expression dictionary defines structures for entries therewithin, in a markup-language schema.

20. The article of manufacture of claim 16, wherein the regular-expression dictionary exposes one or more application programming interfaces (API'"'"'s) by which the textual analysis component accesses the regular-expression dictionary to match strings within the textual data and to receive definitions of the strings.