Methods and apparatus for storing and processing natural language text data as a sequence of fixed length integers

• US 20020165707A1
• Filed: 02/26/2001
• Published: 11/07/2002
• Est. Priority Date: 02/26/2001
• Status: Abandoned Application

• Current Assignee: Charles Call
• Original Assignee: Charles Call
• Inventors: Call, Charles G.
• Application Number:
  US09/793,267
• Publication Number:
  US 20020165707A1
• Time in Patent Office: Days
• US Class Current: 704/2
• CPC Class Codes: G06F 40/123 Storage facilities
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

A mechanism for more rapidly processing natural language text data and more compactly storing such data in a memory array of 16-bit integers, each integer identifying an individual term in the text data stored in a term lookup table. The original text is parsed into a sequence of substrings consisting of alternating alphanumeric terms and intervening punctuation strings. Each substring (with the exception of a single space between adjacent alphanumeric terms) is translated into an identifying integer placed in the memory array. To perform the conversion of each term into its identifying integer, a term lookup table is searched for a previously stored term which matches the given term and, if a matching term is found, the said given term is converted into the integer which identifies the matching term. If a previously stored matching term is not found, the given term is stored in an available empty location in the term first lookup table and is converted into the integer which addresses that available empty location. High-speed term-to-integer conversion is performed using a vectored binary tree as the term lookup table. High speed searches are performed by scanning the memory array for integers which identify target words, and additional lookup tables which are also addressable by an given term'"'"'s identifying number may be employed to determine attributes of that term. A text file manipulation program employs the integer array text data to rapidly search, display, categorize, annotate, and highlight the text of a natural language text database. Highlighted passages are specified by their starting and ending positions in the integer array and are characterized by stored data which specifies the highlight color, annotation text, and one or more category codes associated with the highlighted passage. A keyword in context listing may be displayed which presents a sorted list of all phrases beginning with any term in a user-specified term list.

Claims

1. The method of representing natural language text data in encoded form which comprises the steps of subdividing said text data into a sequence of character strings, forming at least one string table containing an addressable copy of each unique one of said character strings, and forming a sequence of integer values each of which specifies a corresponding one of said character strings.

2. The method of representing natural language text data as set forth in claim 1 wherein said sequence of character strings comprises a sequence of alternating natural language terms and punctuation character strings which separate said natural language terms, each of said natural language terms consisting of one or more characters in a first predetermined set of characters that includes the letters of the alphabet, and each of said punctuation strings consists of one or more of characters is a second predetermined set of characters which does not include the letters of the alphabet.

3. The method of claim 2 wherein said first predetermined set of characters further includes the numerical digit characters.

4. The method of claim 2 wherein said first predetermined set of characters includes both the uppercase and the lowercase letters of the alphabet.

5. The method of claim 1 wherein the step of forming a sequence of fixed length integer values includes the step of suppressing the formation of integer values specifying punctuation character strings which consist of a single space character between two of said natural language terms.

6. The method of claim 1 further comprising the step of reconstructing said natural language text data by concatenating the sequence of character strings which correspond to the each integer value in said sequence of integer values.

7. The method of claim 5 further comprising the step of reconstructing said natural language text data by concatenating the sequence of character strings which correspond to each integer value in said sequence of integer values and further comprising the steps of detecting the presence of two consecutive ones of said integer values which represent two adjacent natural language terms, and inserting a single space character between said two adjacent natural language terms.

8. The method of claim 1 wherein said step of forming at least one string table containing an addressable copy of each unique one of said character strings comprises forming a searchable binary tree of nodes, each of said nodes being associated with a unique one of said strings and a unique one of said integer values, comparing in sequence each successive one of said character strings in said text data with the strings associated with the nodes of said binary tree, and forming a new node in said binary tree associated with each new unique character string not already associated with an pre-existing one of said nodes.

9. Apparatus for storing and processing natural language text data consisting of a sequence of encoded characters, said apparatus comprising, in combination,

a parser for subdividing said text data into a sequence of natural language terms and punctuation strings wherein each of said terms consists of characters in a first predetermined set of characters which includes the letters of the natural language alphabet, and wherein each of said punctuation strings consists of characters in a second predetermined set of characters which excludes said letters of the alphabet,

a string lookup storage unit for processing said sequence of term and punctuation strings from said parser and for encoding each given one of said term and punctuation strings as an integer value which uniquely specifies the content of said given one of said term and punctuation strings,

an integer storage unit for storing the integer values from said string storage lookup unit as a sequence of integer values which represent said natural language text, and

means for reproducing said natural language text data in it original form as a sequence of encoded characters by concatenating the terms and punctuation strings whose content is specified by each successive one of said sequence of integer values.

10. Apparatus as set forth in claim 9 wherein said first predetermined set of characters further includes the numeric characters and wherein said second predetermined set of characters excludes said numeric characters.

11. Apparatus as set forth in claim 9 wherein said first predetermined set of characters consists of the upper and lower case letters of the alphabet and numeric characters.

12. Apparatus as set forth in claim 11 wherein each of said term strings consists of characters in said first set of characters as well as one or more specified additional characters provided that two or more of such specified additional characters do not appear adjacent to one another in a term string.

13. Apparatus as set forth in claim 9 wherein said second predetermined set of characters which form the content of said punctuation strings includes the space character and wherein said first predetermined set of characters excludes the space character.

14. Apparatus as set forth in claim 13 including means for omitting from said sequence of integer values stored in said integer storage unit any integer value which represents a single space character, and wherein said means for reproducing said natural language text includes means for responding to the detected presence in said sequence of integer values of any two successive integer values which both specify term strings by concatenating a single space character between the term strings specified by said two successive integer values.

16. The method of claim 15 further in which said step of employing said first lookup table to convert each integer in said sequence of corresponding integers into the term it identifies to reproduce said natural language text includes the step of concatenating the terms produced by the conversion in the order produced to reproduce said natural language text.

17. The method as set forth in claim 17 further comprising the step of searching said natural language text for one or more specific terms having a predetermined attribute, said step of searching comprising the sub-steps of:

storing an indication of said predetermined attribute in a second lookup table at each location said second lookup table which is addressable by the integer which identifies one of said specific terms,

repetitively retrieving each integer in said corresponding sequence from said memory unit,

employing the retrieved integer to address said second lookup table to produce an output signal whenever said indication of said predetermined attribute was stored in said second lookup table at a location addressed by said retrieved integer, and

utilizing said output signal to specify the location of one of said specific terms in said natural language text.

18. The method as set forth in claim 15 wherein said step of employing said first lookup table to convert said sequence of terms into a sequence of corresponding integers includes, for each given term in said sequence of terms, the steps of:

searching said first lookup table for a previously stored term which matches said given term and, if a matching term is found, converting said given term into the integer which identifies said matching term, and if a matching term is not found, storing said given term in an available empty location in said first lookup table and converting said given term into the integer which addresses said available empty location.

19. The method as set forth in claim 18 further including the step of organizing the terms stored in said first lookup table in a sorted order to facilitate said searching step.

20. The method as set forth in claim 18 wherein each location in said first lookup table is a node of a binary tree comprising a storage location for one of said terms and two branch integer registers, and wherein the step of searching said first lookup table comprises searching said binary tree for the said given term, and wherein said step of storing said given term in an available location is accompanied by the additional step of placing the integer which addresses said available empty location in the branch integer register of the last node found in the course searching said binary tree.

15. The method of processing natural language text which comprises a sequence of terms each of which consists of one or more encoded characters, said method comprising the steps of:

storing each given unique term in said sequence of terms in a first lookup table at a location which is addressable by a unique integer which corresponds to and identifies said given unique term,

employing said first lookup table to convert said sequence of terms into a sequence of corresponding integers,

storing said sequence of corresponding integers in a memory unit,

retrieving said sequence of corresponding integers from said memory unit, and

employing said first lookup table to convert each integer in said sequence of corresponding integers into the term it identifies to reproduce said natural language text.