Method of processing a text in order to store the text in memory

Claim 3

A method of processing a text as claimed in claim 1, further comprising: creating a phrase tally file which includes a tally of the numbers of occurrences of pairs of words adjacent one another in said text; and adjusting said phrase tally file so as to include a tally of the number of occurrences of phrases in said text which correspond to two phrase codes, or a phrase code and word code; wherein a phrase code is allocated to represent two word codes, two phrase codes, or a phrase code and a word code if, according to said tally file, the pair of adjacent words, or phrase, represented thereby has a tally greater than two; and the tally of any preceding or succeeding pair of adjacent words, or phrase is decremented by one.

Claim 4

A method of processing a text as claimed in claim 2, wherein prior to allocating a phrase code to represent two word codes, two phrase codes, or a phrase code and a word code, the phrase tally file is processed and if the pair of adjacent words, or phrase, corresponding thereto overlaps with another pair of adjacent words, or phrase, having a higher tally, the respective two codes representative thereof clash and said allocation is prevented.

Claim 5

A method of processing a text as claimed in claim 3, further comprising processing said binary word code representation of said text so as to generate said phrase tally file which comprises a plurality of records each having a first field including a pair of adjacent word codes, a second field including the tally of said pair, and a third field which may be used to indicate operations to be performed in respect of said pair, said records being accessible by a respective index.

Claim 6

A method of processing a text as claimed in claim 4, wherein said phrase tally file only includes records in respect of pairs of word codes having tallys greater than two, and said method further comprises processing said word code representation of said text so as to generate an index stream representative of the position of pairs of adjacent word codes in said text, said index stream including the indices associated with the pairs of word codes in said phrase tally file and markers of representative the pairs of word codes having tallys less than three.

Claim 7

A method of processing a text as claimed in claim 5, wherein said phrase tally file is processed so that the third field of records relating to pairs of word codes, which clash with other pairs having a higher tally, indicates allocation of a phrase code is to be prevented, and the third field of the remaining records indicates allocation is to be performed.

Claim 8

A method of processing a text as claimed in claim 6, wherein after processing of said phrase tally file, said index stream is sequentially processed according to the following steps: (a) an index is accessed and a corresponding record is accessed from the phrase tally file; (b) if the third field of the accessed record indicates allocation is to be performed: (i) a phrase code is allocated to represent the pair of adjacent codes of the second field of the accessed record and a corresponding entry is made in the phrase table file; (ii) any indices immediately preceding or succeeding the accessed index are used to access the phrase tally file and the second fields of the records corresponding thereto are decremented by one and if said second fields become less than three the third field corresponding thereto is adjusted to indicate the respective index is to be removed from the index stream; (iii) if an index immediately precedes or succeeds said accessed index a new pair of adjacent codes, including said allocated phrase, is created and an index is allocated thereto and inserted in said stream and a tally kept thereof of occurrences in said stream during processing of said stream (c) if the third field of the accessed record indicates the respective index is to be removed from the stream the accessed index is removed from the stream.

Claim 9

A method of processing a text as claimed in claim 7, wherein after said stream is sequentially processed, the phrase tally file is adjusted to include each said new pair of adjacent codes having a tally greater than two and said stream is continually sequentially processed and the phrase tally file adjusted accordingly thereafter until all of the indices in said stream have been removed.

Claim 10

A method of processing a text as claimed in claim 8 wherein said dictionary file comprises a plurality of dictionary records each including the binary character code for at least the last character of a word, the binary character code of a word being accessible from said dictionary file, after the address of a corresponding dictionary record, the number of characters in the word, the number of characters which the binary character code of the corresponding record represents and the next dictionary record which needs to be accessed to obtain any remaining characters of the word, are determined using the corresponding word code.

Claim 11

A method of processing a text as claimed in claim 9, wherein each dictionary record further includes three fields indicating the number of characters in the word, the number of characters which the character code of the dictionary record represents, and the next dictionary which needs to be accessed, respectively, and the corresponding word code directly accesses said record.

Claim 12

A method of processing a text as claimed in claim 10, wherein said word and phrase codes comprise sixteen bits.

Claim 13

A method of processing a text as claimed in claim 11, wherein the 256 words which occur the most in said text are represented by eight bit word codes.

Claim 14

The method of claim 1, further including the step of accessing text stored within said storage means by: receiving a signal indicating that a predetermined word or phrase is to be searched for in the text, accessing said dictionary file and phrase file, in response to said signal, to determine the corresponding binary word and/or phrase code to be searched for in said stored text so as to locate said predetermined word or phrase, searching said stored text on the basis of said corresponding binary code, and displaying, in response to said searching step, a location of said predetermined word or phrase in said text.

Claim 15

The method of claim 1, further including the step of decompressing said text by sequentially processing the code representation of said text and using each word and phrase code accessed therefrom to access the dictionary and phrase table files until character code is obtained therefrom, said phrase table file being recursively accessed by phrase code until word code is retrieved for accessing said dictionary file.

Claim 18

The apparatus of claim 15, further including a data processing system connectable to the storage means, said system comprising: means for sequentially accessing the code representation of said text in said storage means and using each word and phrase code accessed from said code to access the dictionary and phrase table files in said storage means until character code is obtained therefrom, said means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; and means for displaying at least part of said text corresponding to the obtained character code, said displaying means being controlled by said accessing means.

Claim 19

The apparatus of claim 15, further including a data processing system connectable to said storage means, said system comprising: means for receiving a signal indicating that a predetermined word or phrase is to be searched for in the text, means responsive to said receiving means for accessing said dictionary file and phrase table file to determine the corresponding binary word and/or phrase code to be searched for in said stored text in order to locate said predetermined word or phrase, and for searching said stored text on the basis of said corresponding binary code, and means responsive to said accessing means for displaying a location of said predetermined word or phrase in said text.

Claim 20

The apparatus of claim 15 further including a data processing system connectable to said storage means, with said storage means having a first section which includes the code representation of said text, a second section which includes said dictionary file, a third section which includes said phrase table file, and a fourth section which includes decompressing, searching and display programs, said system comprising: an address bus and a data bus which are connectable to said storage means; a register bank connected to part of said address bus and input/output ports connected to said data bus and the remainder of said address bus; processor means connectable to said bank and ports so as to control said buses and thereby access said storage means; and means for displaying at least part of said text; said bank being adapted to store four different most significant parts of an address to be placed on said address bus, thereby enabling said processor means to access one of said sections of storage means in one access cycle and another of said sections in the succeeding cycle and retain an indication as to the location at which said one of said sections was last accessed, such that said processor means may sequentially access and process the code representation of said text using said programs and use each word and phrase code accessed therefrom to access said dictionary and phrase table files until character code is obtained therefrom, said processor means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; said processor means being adapted to control said display means to display a part of said text corresponding to said obtained character code.

Claim 21

The apparatus of claim 18, wherein said storage means is housed in a module connectable to said system and said system comprises a reset circuit which initializes and supplies power to said system and said memory when said module is connected to said system.

Claim 22

The apparatus of claim 19, wherein said module and system are such that on connecting said module to said system, first circuitry in the module is earthed, secondly a reset signal is applied to the processor means and input/output ports of the module are disabled, thirdly power is supplied to the module, fourthly corresponding input/output signal lines of the system and module are connected and finally the reset signal to the processor means is removed and the ports of the module are enabled.

Claim 23

The apparatus of claim 18, further comprising selection means for causing said processor means and said display means to move a cursor on a display so as to select a displayed word or menu item, execution means causing said processor means to perform an operation according to said selected menu item and based on said selected word, and cancellation means for causing said processor means to cancel said operation.

Claim 24

The apparatus of claim 21, further comprising means for disabling power supply to said storage means and selected units of said system when switches associated with said selection, execution and cancellation means are unused for a first predetermined period of time.

Claim 25

The apparatus of claim 21, further comprising additional memory for storing initialization and diagnostic routines and variables used during execution of said programs in said memory, a sub-address bus used by said processor means to access said additional memory and holding latches for storing a current address outputted by said processor means while a main address/data bus is used to carry data accessed from said additional memory.

Claim 26

The apparatus of claim 18, further comprising additional storage means for storing initialization and diagnostic routines and variables used during execution of said programs in said storage means, a sub-address bus used by said processor means to access said additional storage means and holding latches for storing a current address outputted by said processor means whilst a main address/data bus is used to carry data accessed from said additional storage means.

Claim 27

The apparatus of claim 18, further comprising selection means for causing said processor means and said display means to move a cursor on a display so as to select a displayed word or menu item, execution means causing said processor means to perform an operation according to said selected menu item and based on said selected word, and cancellation means for causing said processor means to cancel said operation.

Claim 28

The apparatus of claim 18, further comprising additional memory for storing initialization and diagnostic routines and variables used during execution of said programs in said memory, a sub-address bus used by said processor means to access said additional memory and holding latches for storing a current address outputted by said processor means while a main address/data bus is used to carry data accessed from said additional memory.

Claim 29

The apparatus of claim 15, further including a memory medium for storing said text.

Claim 32

A data processing system connectable to a storage means having a dictionary file which relates a binary character code or each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, said system comprising: means for sequentially accessing the code representation of said text in said storage means and using each word and phrase code accessed from said code to access the dictionary and phrase table files in said storage means until character code is obtained therefrom, said means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; and means for displaying at least part of said text corresponding to the obtained character code, said displaying means being controlled by said accessing means.

Claim 33

A data processing system connectable to a storage means having a dictionary file which relates a binary character code or each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, said system comprising: means for sequentially accessing the code representation of said text in said storage means and using each word and phrase code accessed from said code to access the dictionary and phrase table files in said storage means until character code is obtained therefrom, said means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; and means for displaying at least part of said text corresponding to the obtained character code, said displaying means being controlled by said accessing means.

Claim 34

A data processing system connectable to a storage means having a dictionary file which relates a binary character code of each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, said system comprising; means for receiving a signal indicating that a predetermined word or phrase is to be searched for in the text, means responsive to said receiving means for accessing said dictionary file and phrase table file to determine the corresponding binary word and/or phrase code to be searched for in said stored text in order to locate said predetermined word or phrase, and for searching said stored text on the basis of said corresponding binary code, and means responsive to said accessing means for displaying a location of said predetermined word or phrase in said text.

Claim 35

A data processing system connectable to a storage means having a dictionary file which relates a binary character code of each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, said system comprising; means for receiving a signal indicating that a predetermined word or phrase is to be searched for in the text, means responsive to said receiving means for accessing said dictionary file and phrase table file to determine the corresponding binary word and/or phrase code to be searched for in said stored text in order to locate said predetermined word or phrase, and for searching said stored text on the basis of said corresponding binary code, and means responsive to said accessing means for displaying a location of said predetermined word or phrase in said text.

Claim 36

A data processing system connectable to a storage means having a dictionary file which relates a binary character code of each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, with said storage means having a first section which includes the code representation of said text, a second section which includes said dictionary file, a third section which includes said phrase table file, and a fourth section which includes decompressing, searching and display programs, said system comprising: an address bus and a data bus which are connectable to said storage means; a register bank connected to part of said address bus and input/output ports connected to said data bus and the remainder of said address bus; processor means connectable to said bank and ports so as to control said buses and thereby access said storage means; and means for displaying at least part of said text; said bank being adapted to store four different most significant parts of an address to be placed on said address bus, thereby enabling said processor means to access one of said sections of storage means in one access cycle and another of said sections in the succeeding cycle and retain an indication as to the location at which said one of said sections was last accessed, such that said processor means may sequentially access and process the code representation of said text using said programs and use each word and phrase code accessed therefrom to access said dictionary and phrase table files until character code is obtained therefrom, said processor means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; said processor means being adapted to control said display means to display a part of said text corresponding to said obtained character code.

Claim 37

A data processing system connectable to a storage means having a dictionary file which relates a binary character code of each word in a text to a binary word code representative of the word itself, a phrase table file which relates the binary word code of pairs of words, which are adjacent to one another in said text and occur in said text at least three times, to binary phrase code representative of said pairs, and a binary phrase code and a binary word code representation of said text, with said storage means having a first section which includes the code representation of said text, a second section which includes said dictionary file, a third section which includes said phrase table file, and a fourth section which includes decompressing, searching and display programs, said system comprising: an address bus and a data bus which are connectable to said storage means; a register bank connected to part of said address bus and input/output ports connected to said data bus and the remainder of said address bus; processor means connectable to said bank and ports so as to control said buses and thereby access said storage means; and means for displaying at least part of said text; said bank being adapted to store four different most significant parts of an address to be placed on said address bus, thereby enabling said processor means to access one of said sections of storage means in one access cycle and another of said sections in the succeeding cycle and retain an indication as to the location at which said one of said sections was last accessed, such that said processor means may sequentially access and process the code representation of said text using said programs and use each word and phrase code accessed therefrom to access said dictionary and phrase table files until character code is obtained therefrom, said processor means recursively accessing said phrase table file by phrase code until word code is retrieved for accessing said dictionary file; said processor means being adapted to control said display means to display a part of said text corresponding to said obtained character code.

Claim 38

The data processing system of claim 31, wherein said storage means is housed in a module connectable to said system and said system comprises a reset circuit which initializes and supplies power to said system and said memory when said module is connected to said system.

Claim 39

The data processing system of claim 31, wherein said module and system are such that on connecting said module to said system, first circuitry in the module is earthed, secondly a reset signal is applied to the processor means and input/output ports of the module are disabled, thirdly power is supplied to the module, fourthly corresponding input/output signal lines of the system and module are connected and finally the reset signal to the processor means is removed and the ports of the module are enabled.

Claim 40

The data processing system of claim 31, further comprising selection means for causing said processor means and said display means to move a cursor on a display so as to select a displayed word or menu item, execution means causing said processor means to perform an operation according to said selected menu item and based on said selected word, and cancellation means for causing said processor means to cancel said operation.

Claim 41

The data processing system of claim 34, further comprising additional memory for storing initialization and diagnostic routines and variables used during execution of said programs in said memory, a sub-address bus used by said processor means to access said additional memory and holding latches for storing a current address outputted by said processor means while a main address/data bus is used to carry data accessed from said additional memory.

Claim 42

The data processing system of claim 31, further comprising means for disabling power supply to said storage means and selected units of said system when switches associated with said selection, execution and cancellation means are unused for a first predetermined period of time.

Claim 43

The data processing system of claim 31, further comprising additional storage means for storing initialization and diagnostic routines and variables used during execution of said programs in said storage means, a sub-address bus used by said processor means to access said additional storage means and holding latches for storing a current address outputted by said processor means whilst a main address/data bus is used to carry data accessed from said additional storage means.

Claim 44

The data processing system of claim 31, further comprising selection means for causing said processor means and said display means to move a cursor on a display so as to select a displayed word or menu item, execution means causing said processor means to perform an operation according to said selected menu item and based on said selected word, and cancellation means for causing said processor means to cancel said operation.

Claim 45

The data processing system of claim 31, further comprising additional memory for storing initialization and diagnostic routines and variables used during execution of said programs in said memory, a sub-address bus used by said processor means to access said additional memory and holding latches for storing a current address outputted by said processor means while a main address/data bus is used to carry data accessed from said additional memory.