GB2201020A - Word processor - Google Patents

Description

WORD PROCESSOR BACKGROUND OF THE INVENTION The present invention relates to a word processing machine and, more particularly, to an intelligent word processer.

Conventionally, a word processing machine or processor is provided with a printer with a daisy wheel for printing out characters. The number of the characters to be provided by a single kind of crown or daisy wheel is limited. Further, any other type of characters may be needed other than those presented by a specific type of crown or daisy wheel.

).

In such a case, to inform the presence of a specific type of character other than those of the operatively coupled crown or daisy wheel, the word processor prints out a space or any other alternative other than those of the operatively coupled crown or daisy wheel by neglecting the character information. Otherwise, it must stop at any specific character other than those of the print wheel operatively coupled, so that the operator's instruction is awaiting.

SUMMARY OF THE INVENTION Accordingly, it is an object of the present invention to provide an improved electronic word processing machine being prepared to print out any specific character other than those of an operatively coupled print whee !.

It is another object of the present invention to provide an improved electronic word processor for checking whether a printing head presently coupled has characters corresponding to inputted characters.

It is a further object of the present invention to provide an improved electronic word processor for automatically hyphenating words in printing out them.

It is still a further object of the present invention to provide an improved electronic word processor for selecting a message to be outputted when the processor inform the operator of a specific condition requesting the operator's instruction.

< It is yet a further object of the present invention to provide an improved eldctronic word processor for utilizing data of running heads and footnotes in defining a specific zone in the unit of chapter in which a search and replacement function is accomplished.

Briefly described, in accordance with the first preferred embodiment of the present invention, a word processor is characterized by comprising memory means for storing print data, print. wheel means for printing out the print data, and check means for checking whether the type of the print wheel means has a suitable print wheel enough to print out the print data.

In accordance with the second preferred embodiment of the present invention the word processor comprises memory means for storing spelling data, the memory means further storing hyphenate data for some selected words comprising some cr more letters, and print means for automatically printing out the word data automatically together with the hyphenate data.

In accordance with the third preferred embodiment of the present invention, the word. processor comprises message sentence means for storing message sentences telling system questions, and modification means for changing the message sentences.

In accordance with the fourth preferred embodiment of the present invention, the word processor comprises letter selection means for selecting and inputting one or more letters to be retrieved and replaced, chapter selecting means for selecting and defining a sentence region in the unit of-chapter in which the one or more letters are retieved, and retrieval means responsive to said chapter selection < * means for retrieving the one or more letters and replacing-them with nejw one or more letters.

BRIEF DESCRIPTION OF THE DRAWINGS The present invention will become more fully understood from the detailed description given here. nbelow and the accompanying drawings which are given by way of illustration only, and thus are not limitative of the present invention and wherein : FIGS. 1, 2,3, and 4 are a plan view of a keyboard of a word processor according to a first preferred embodiment of the present invention; FIGS. 5 (A) and 5 (B) are an illustration of a table of character codes : FIG. 6 is a block diagram of a word processor according to the first preferred embodiment of the present invention; 'FIG. 7 is an illustration of a table for explaining a relation between characters and modes according to the first preferred embodiment ; FIG. 8 is an illustration of a table for explaing character styles according to the first preferred embodiment ; FIG. 9 is an example of a display in a display screen according to the first preferred embodiment; FIGS. 10,11, and 12 are an illustration of atable showing different charac ers used for the first preferred embodiment; FIGS. 13 (A), 13 (B), 13 (C), and 13 (D) are an illustration of a table of characters used for the first preferred embodiment; , FIG. 14 is a block diagram of a circuit of a word processor according to a second preferred embodiment of the present invention; FIG. 15 is an illustration of a configuration of a spelling and hyphenate information dictionary connected in the circuit of FIG. 14; FIG. 16 is a drawing of a format of a dictionary for storing specific words : FIG. 17 is a drawing of a data format of the dictionary of FIG. 16; FIG. 18 is a block diagram of a word processor according to a third preferred embodiment of the present invention; FIGS. 19 (A) and 19 (B) are a drawing of a data format of message data used for the circuit of FIG. 18; FIGS. 20,21, and 22 are a drawing of a structure of storage data in the second preferred embodiment; FIG. 23 is a drawing of a displayed format in a display in accordance with the second preferred embodiment; FIG. 24 is a drawing of a configuration of inputted data for the second preferred embodiment; FIGS. 25 (A), 25 (B), and 25 (C) are an illustration for explaining a modification of a message in the second preferred embodiment; FIGS. 27,2S, and 29 are a drawing of a storage data of specific message sentences used for the second preferred embodiment ; FIG. 30 and 31 are a drawing of a displayed picture in a display according to the second preferred embodiment; FIG. 32 is a drawing of a structure of a file used in a word processor according to a fourth preferred embodiment of the present invention ; FIG. 33 is a drawing of a page of a book containing contents, the chapters, and pages used for the fourth embodiment; FIG. 34 is a drawing of a page containing a running head title in the fourth preferred embodiment ; FIG. 35 is a drawing of a data format representative of running head titles in the data file in the fourth preferred-embodiment ; and FIG. 36 is a flow chart of the operation of the word processor according to the fourth preferred embodiment of the present invention.

DESCRIPTION OF THE ; FIGS. l, 2, and 3 are a keyboard for a word processor according to the first preferred embodiment of the present invention.

In accordance with the principle of the present invention, as apparently shown in FIG. 1, some key switches in the keyboard have indefinite instructions.

FIGS. 5 (A) and 5 (B) are character codes used for the keyboard of FIG. 1. The operator can select the key switches to freely correspond to the character codes by control codes.

FIG. 2 relates to a keyboard for English. FIG. 3 is a keyboard for German. FIG. 4 is a keyboard for French.

According to the first preferred embodiment of the present invention, code information is inputted from the keyboard and the inputted information is assumed to be position information for selecting the key switches positions rather than the character information. Based on the position information, a memory is provided for serving as a parameter table to-translate the position information into the character information, so that any subsequent word processing is accomplished.

FIG. 6 is a block diagram of a circuit of the word processor according to the first preferred embodiment of the present invention.

The circuit of the word processor of FIG. 6 comprises an input/display device 1, a first register 2, a first table 3, a second register 4, a memory 5, a second table 6, an output device 7, and a control unit 8.

.

The input/display device 1 is provided for inputting the position information into the first register 2. The position information is applied to select character and word information to be inputted into the memory 5. The position information represents the position or positions of an actuated key switch or switches. The device 1 serves to display on its cathode-ray tube (CRT) the information from the first table 3 and the second table 6.

The first register 2 is provided for storing the position information from the input/display device 1. The first table 3 is provided for storing the code information used for translating the position information in the firsa register 2 into the character information set by the operator, and storing information. representative of a type of printing means such as a daisy wheel, crowr'. ; or the like.

The second register 4 is provided for storing the character information as selected by the first register 2 and the first table 3.

The memory 5 is provided for storing the character information processed by the input/display device 1, the two registers 2 and 4, and the first table 3. Further, it appropriately communicates with the second table 6 in order to detect which type of printing means of the second table 6 should be operated, thereby checking how to prevent the output operation of the output device 7 from stopping.

FIGS. 13 (A) through 13 (D) are information of the second table 6. The table 6 serves to check the character data in the memory 5. t The output device 7 outputs the information as stored and edited by the memory 5.

The control unit 8 is provided for controlling the data communication between the circuit elements 1 through 7.

The operator operates the word processor as follows: Before processing the words, the operator modifies the data in the first table 3. A conventional key interface is operated to provide the position information for shift-in, shift-out, the alphanumeric characters, and Japanese"katakana", and information whether the control or the ALT function keys are operated. In response to these items of information, some character code is introduced into a location in the first table 3.

Vlore particularly, with reference to FIG. 7, conditional flags (pare provided for representing that when each of the normal, control, and ALT modes is selected, the code table of either FIG. 5 (A) or 5 (B) should be used. Conditional flags'uare used to switch on or off each item of the character information present in the print wheel selected by the second table 6. The wheel is operated in response to the operator's instruction. When the print wheel as coupled to the output device 7 is special, the corresponding bit of the conditional flags # is on. When some characters absent in the ON condition are to be selected, such an operation is assumed to be irregular, so that any indication is provided such as a buzzer or "prompt"information outside.

In FIG. 7, the conditional flags (Dare unchanged, as long as a key relating to"OOH" of the position code is operated, a code corresponding to"52H"can be outputted.

"H"designates a hexadecimal notation. If the conditional flag (D is"000000", 0 character information for"e"can be outputted because"52H"in the position ifnormation "00" is selected regardless of the selection of either the normal mode or the control mode or the ALT mode. If the conditional flag (Dls"000100'",-"e"can be outputted in both the normal mode and the ALT mode, but in the control mode the character information of" < "is outputted. If the position information is "FF"and the conditional flag (D is"00", character information"S"is outputted in the normal mode and character information"T"is outputted in the control mode, and character information"u"is outputted in the ALT mode.

The operator can enable the display screen to display the items of the character information which can and cannot be used in response to the input instructions. As shown in FIG. 9, the CRT display is divided into two portions. In the upper CRT portion, the presently inputted characters are displayed while in the lower dis ? ! as portion all the characters presentlv supported by the word processor in which the characters corresponding to the print wheel as presentlv copled to t e p ; ocessor are reversed as designated in shaded areas in FIG. 9.

Further, according to the first preferred embodiment of the present invention, it is possible to check which print wheel should be operatively coupled to the word processor depending on the style of the words. This check can be done before the inputted words are to be printed. That result can be displayed in the CRT\dispIay.

As shown in FIG. 8, the word style to be printed out is preliminarily selected, including the character pitch and the midle class. Till starting the print out operation, the operator's instruction is awaited. Based on such information, a mess5geis displayed indicating which print wheel should be used to reduce the number of replacing a plurality of print wheels as much as possible. The right column of the table of FIG. 8 is a group of characters. The contents of"Elite"are illus. r2ted in FIG. 10,"Courier"is illustrated in FIG.'11,and"Pica"is shown in FIG. 12. 12.

(.

The second table 6 stores the many items of information of FIGS. 8, 10, 11, and 12.

The input/display device 1 can be operated to change the information in the second table 6 in the same manner as in the first table 3.

According to the first preferred embodiment of the present invention, as stated above, the word processor can check whether it is provided with the print wheel with the printing characters corresponding to the input characters. It is possible that this check is done upon inputting the input characters. Otherwise, after preparaing and inputting the words or during storing the words, it is detected which printing wheel, including the print wheel as presently coupled and not coupled, can print out the current input characters. Therefore ; the print out operation cannot be p evented.

An attention is directed to a second prefered embodiment of the present invention wherein the word processor is equipped with an automatic-hyphenate function. The automatic-hyphenate function is referred to as the-fuction that a word bridging two lines is automatically hyphenated in the first line. It may be possible all the words are stored with hyphenate information. However, it is rather disadvantageous that all the words are accompanied with the hyphenate information. For example,"ahead"can be hyphenated as"a-head", but this is not a preferable hyphenate form.

According to the second preferred embodiment of the present invention, only a selected group of words each having predetermined letters or more, preferably, six or more are accompanied with hyphenate information to compress the data memory. Hyphenate-position information is added to the words each having 6 letters or more in addition to its spelling information.'.

FIG. 14 is a block diagram of a circuit of a word processor according to the second preferred embodiment of the present invention. The word processor 1 comprises an input device 11, a memory 12, an output device 13, a spelling and hyphenate information dictionay 14, and a controller 15.

The input device 11 is provided for inputting spelling information into the memory 12. Preferably, it may be a keyboard, a tablet input apparats, an optical character recognition (OCR) or the like.

The memory 2 is provided for storing the spelling information from the input device 11. It may be a core memory, an integrated circuit (IC) memory or the like.

The output device 13 is provided for outputting the contents and the edited results of the memory 12. It may be a printer, a display, or the like.

The spelling and hyphenate information dictionary 14 is provided for storing the spelling information corresponding to the words as stored in the memory 2 and hyphenate information corresponding to the words each having six or more letters.

It may be a read only memory (RQtvI).

The controller 15 is provided for controlling the operation of all the circuit elements.

FIG. 15 shows a structure of the spelling and hyphenate information dictionary 14.

It contains index locations I and spelling and hyphenate data memories J. ; The index locations I storing the number of the words are provided with letter'-number classification locations each consisting of first-letter classification locations. In the letter-number classification locations are provided for storing the number of the words depending on their total letter number, 1-letter words, 2-letter words, 3 letter words, 4-letter words,... 8-letter words, and so on. Each letter-number locations are further divided into the first-letter locations storing the number of the words according to their first letters,"A","B","C",....,"X","Y", and"Z". In FIG. 15, the letter-number locations are 1-letter location, 2-letter location, and 8- letter locations from the top. Each first-letter location is labelled with its initial letter of"A","B","C",...."X","Y", and"Z".

Further, the spelling and hyphenate information data loca. cns are proviced fc' storing the spelling data and the hyphenate information data. The Socaions J comprise memories J1, J2,..., and JS. In each location, each of the second and the subsequent letters is converted into 5-bit data. The following TABLE shows the bit conversion correspondence.

Character Data A 00001 B 00010 C 00011 D 00100 E 00101 G 00111 H 01000 I01001 J 01010 K 01011 L 01100 M 01101 N 01110 O 01111 P 10000 Q 10001 R 10010 S 10011 T 10100 U 10101 v 10110 W 10111 X 11000 Y 11001 1 11010 11011 (The last-term is-an-apostrophe.) TABLE I It is assumed that the following 8 words in TBALE II are stored.

No. Word 1 AlVI 2 AN 3 ALL 4 ARM 5 PLAN.

6 PLAY 7 DELICATE 8 DELIVERY TABLE II The follow letter or letters are to be stored in the dictionary.

"A@ : N "ALL":LL "ARM":RM "PLAY" : LAY "DELICATE" : ELICATE "DELIVERY" : ELIVERY To satisfy the-correspondence of the memory capacity of 1 byte = 8its, dummy data (bit off)"X"are added as follows: M#01101XXX#68H(Hexadecimal) N#01110XXX#70H LL- ; 0110001100XXXXXX-j6300H RM-1001001101XXXXXX-9340H LAN#011000000101110X#605CH LAY-011000000111001X-072H; ELICATE#00101011000100100011000011010000101001100XXXXXXX#2B123D0A600 ELIVERY#00101011000100110110001011001011001010010XXXXXXX#2B1362CB2900 In the above words, six or more letters are included within"DELICATE"and "DELIVERY". According to the second preferred embodiment of the present invention, the hyphenate information is annexed at the end of the data for the letters, together, in the unit of bit. If the word has letters to be hyphenated,"1"is provided while no hyphenate information is required, "0" stands.

Further, in the second preferred embodiment, in a word, no hyphen i5 inserted before the first letter and the last letter. Therefore, the hyphenate informaiton corresponds to the bits defined by"the number of all the letters minus 2".

For example, while all of the lettes in a word"DELICATE"are"D E L : I C A T E", "DEL-I-CATE" can be hyphenated. The following-hyphenate information is provided.

Do Eo LKCCAOTE Where white dot designates that no hyphen is provided while the black dot designates that a hyphen is provided. Therefore, the hyphenate information of "001100"is defined. (It is to be noted that"001100"of six bit information precedes "XXXXXXX"in the memory bit for"ELICATE".) A word"DELIVERY"contains letters of"D E L I V E R Y". The following locations can be hyphenated.

DE-LIV-ER-Y., i.

The hyphenate informaiton should be added as follows: Do Ew Lo IoY Ec RY: 010010 (It is also to be noted that the information"010010"is the six bit information prior to"XXXXXXX"in the memory bit for"ELIVERY".) Here, FIG. 16 shows a structure of the index dictionay storing the words in TABLE II. FIG. 17 shows a structure of the data memory.

Of course, it may be possible that the hyphenate information is provided with each of all the letters forming the word. Such a system is disadvantageous because it takes long to detect the hyphenate information when two words have some of identical high-significant letters, but they are hyphenated at the different position' as in the case of"DELICATE"and"DELIVERY".

Therefore, according to the second preferred embodiment of the present invention, after all the spelling data are first detected, the hyphenate information is detected. Further, the hyphenate information is annexed to the end of the spelling data, together. If the hyphenate information is inserted between the letters, it may be difficult to quickly check the spelling of the words.

Further, according to this preferred embodiment, while each of the letters is converted in 5 bits, the checking of its spelling is conducted in the unit of byte, so that more rapid checking speed can be expected rather than the case of checking in the unit of bit. For this purpose, within the word data, some dummy data are inserted.

In the second preferred embodiment, since the hyphenate information is added only to the selected group of words, preferably, six or more letters, memory data can be compressed.

A further attention is directed to a third preferred embodiment of the present invention in which a message sentence as provided by a word processor asking for the system operation or instruction can be modified by the operator.

FIG. 18 is a block diagram of a word processor according to the third preferred embodiment of the present invention. The circuit of FIG. 1S c^mprises an in ? uz device 21, a memory 22, a message information memory 23 ; an ou ? u. device 2U, and a controller 25.

The input device 21 is provided for spelling information and numerical information into the memory 22. The memory 22 stores the input information and menu message information. The menu message information is used to operate the application software in the message information memory 23. The memory 22 provides and edits the information to be outputted and printed out by the output device 14. The controller 25 is provided for controlling these elements.

According to the third preferred embodiment, the menu message is"Prompt Message","System txvless2ge","Error Message", and"Utility Message".

Normally, a plurality of"Prompt Messages"are not displayed in the CRT display.

They designate some special control codes so that if the cursor is positioned at'the t. corresponding position, they become displayed. Examples of"Prompt Message" : Begin Keep, End Keep, Begin Und ; End Und, Begin D-Und, End D-Und, Begin Bold, and End Bold A plurality of"System Messages"store letters which are normally displayed in the menu picture in the CRT display. Examples of them : Task Selection, ID ITEM, Create Document Task, Revise Document Task, Paginate Task, Request (Print) Task, Create Format File, Revise Format File, and Create Glossary File A piuralirity of"Error Messages"are to advise the operator that the system of the word processor detects some error condition. Examples of"Error Message" : Invalid Key, Adjust Line Ending=No For This Line, Cannot Remove File End, Character Cannot Be Corrected Using Bksp., Characters Not Found, Characters Not Specified, Cursor Cannot Move, and Invalid Choices, Type Or Change Choices A plurality of"Utility Messages"are provided to display when the program for the utility is executed. Examples of"Utility Message"are: Task Selection, ID ITEM, Create Document Task, Revise Document Task, Paginate Task, Request (Print) Task, Create Format File, Revise Format File, Create Glossary File, Revise Glossary File, Change Base Format, and Circular Letter Task Unless"Utility Message"and"System Message"are operated simultaneously, the same locations can be used for them.

FIGS. 19 (A) and 19 (B) show the structure of the message data used for the third preferred embodiment. As being apparent from FIGS. 19 (A) and 19 (B), the message data are classifie into an index portion and main portions. In the index portion, the data as shown in FIG. 20 are stored as folllows: A location: the total byte number to be used in the index portion is stored.

B location: a relative address number is stored which indicates how far the"Prompt Message"is from the main portions.

C location : the number of the prompt messages is registered.

D location: a relative address number is inputted-which indicates how far the "System Zvlessage"is from the main portions.

E location : the number of"System Message"to be registered is inputted.

F location: a relative address number is inputted which indicates how ar"Utility Message"is from the main portions.

G location: the number of"Utility Messages"registered is inputted.

H location : a relative address number is inputted which represents how far"Error Message"is from the main portion.

I location: the number of"Error Messages"registered is inputted.

As shown in FIG. 21,"K"stores the value of the messages in the first item. In conformance with the contents of"K","L"stores the letters of the messages sentence."M"contains a message end code."N"and"N"'include picture information in which the corresponding message information is displayed."O" stores a final end code for the first record."P"stores the volume of the next message of the second item.

FIG. 22 shows locations for the picture infomation. The locations of FIG. 22 are provided for storing all the picture information to be displayed by the present system as follows: location : the number of the messages to be displayed in a single picture display is t. stored. The number of the messages indicates what number of items of the message information is used, including only the normally displayed messages and excluding the urgent ones.

R location: Coordinate information is stored representing where to display"S" (the message sentence of FIG. 21) in the picture display.

S location : the numerical infomration is stored representing both which group of "System Message","Prompt : Iessage","Utility Message", and"Error Message"the current massage belongs to, and what serial number of the message group the current message is positioned.

"R"and"S"are repeated by times as defined by the information of"Q".

T location : a separation code is stored, indicating the divisions of the messages in the single picture display.

U location: the message information to be used in the next picture is stored. If "FF" (Hexadecimal) is stored, it represents that the whole control should end.

The third preferred embodiment of the present invention wiil be described in terms of exemplary data.

To provide the picture as indicated in FIG. 23, it is necessary to input the data of FIG. 24 into the tenth picture location in the picture locations of FIG. 22."12"of FIG. 24 indicates that 12 types of messages are used in the picture."02"in "02120073"at the second item of FIG. 24 indicates the second line and"12" indicates that 12th colon and the susequent colon (s) display the following messages in the picture display."073"of"02120073"represents that a message"Change Page Format"is stored in a pictur. e location numbered as"073". The message of "ID ITEM"is stored in the location of"0001"in the third item.

< FIG. 27 shows a structure of conditions that the specific messages are stdred into the memory of FIG. 23. As being apparent from FIG. 27, some correlated data are modified in such a manner that the message itself is modified as indicated in FIG.

27, the picture use information in the picture is changed, and that the position information or the serial number reoistration information are altered as indicated in FIG. 24. The operator can free ! y handle the massage information.

The modification, addition, deletion of the messsage sentence are carried out as follows as explained with reference to FIGS. 25 (A) through 25 (C).

A message modification mode is first selected so that a zero-numbered message of "00-00"in the ststem-is displayed as shown in FIG. 25 (A). A SKIP key s operated to subsequently address and display the heads of group messages. Two CURSOR movement keys are operated to subsequently display the message data. As shown in FIG. 25 (B), to change"Change Format (Page)"to"Change Page Format", an ENTER key is operated. Then, as shown in FIG. 25 (C), a message enter-available region of an elongated box is displayed under the current massage, so that a new message is inputted. In response to the operation of the ENTER key, the replacement of the message is completed.

To add some new messages, during displaying"REST XXXX BYTE", the CURSOR movement keys are operated to shift the cursor in no-entered regions, so that the ENTER key is actuated to input some new data. To alter the picture use information number, a CHANGE key is operated to display the data enter-possible region under the current picture use information number. Displayed messages can be deleted by operating a DELETE key and the ENTER'key. The system checks the correlation of the data so that if any error is detected, the condition is displayed.

To change the menu data of FIG. 23 to those of FIG. 26, the messages of FIG. 27 are changed to those of FIG. 28 in order to complete the menu sentences.

As shown in FIG. 29, the message sentences in English are changed to those in German so that the menu messages in German can be formed as shown in FIG. 30.

When a plurality of message files are provided, in response to the actuation of some switch in starting power supply or some parameter in the base format information, any message can be automatically accessed in which messages written in multilanguages can be presented. In such a case, the modification mode menu of FIG. 31 should be processed.

To change the menu sentence, the conventional operation in the English word processor is carried out so that when the system displays the corresponding message, the CHANGE key is operated to move the corresponding message. The ENTER key is actuated in which the menu messages of FIG. 25 (C) are formed by modification. After the modification, the previous picture is recovered. In this method,"Prompt message"and"Error Message"cannot be modified, though.

A still further attention is now directed to a fourth preferred embodiment of the present invention for improving a search and replacement function. This function is referred to as an operation in which one or more specific letters in a specific region are searched and replaced by new one or more letters in a word processor.

The following controls are used for the search and replacement function in the fourth preferred embodiment of the present invention :. < i: (1) Each time corresponding letter or letters are detected, the operator instruction is awaited.

(2) After a sentence region for searching and replacing one or more specific letters is defined, the search and replacement function is carried out totally once over this region.

(2)- (i) The region is defined in terms of page number.

(2)- (ii) The region is defined by moving the cursor defining the region for starting and stopping the search and replacement function.

(2)-(ici) the number of repeating to search and replace the one or more letters bv new ones is defined.

(2)- (iv) When one or more specific letters are reachea in searching; the searching and replacement function is stopped.

The word processor of the fourth preferred embodiment of the present invention has a sentence file characterized in that the sentence data are each stored in the unit of page as shown in FIG. 32. The sentence data are separated by several chapters and paragraphs as shown in FIG. 33. In the printed-out data are headed by running head titles H as shown in FIG. 34. The footnotes may be also provided in pages. The positions of having the running head titles (or footnotes) are stored as shown in FIG. 35 in which heads bl, b2, b3, and b4 of pages 1,2,3, and 4."a"of the data of FIG. 35 stores format information. The format information defines the following items: (a) Page Size (vertical and horozontal) (b) First Typing Line (a line of staring. the typing) j (c) Last Typing Line (a line ofending the typing)'- (d) Line/inch (an inch spacing for a single line: 8 inch, 6 inch etc.) (e) The Right and Left Margins (f) Line Space (the number of changing the line or lines by using the Return key) (g) Space Pitch: 10,12, and 15 pitch or Proportional Spacing (PS) (h) Tab Position (i) Auto Hyphenation YES or NO (j) Style Information (k) Auto Wraparound YES, or N (1) Justification YES, or NO Normally, these data are set at the head of the sentence file. They are effective unless changed.

Since the sentence file is modified, changed, added, and deleted, the paging of the sentence file should be added and changed accordingly. Conventionally, it is difficult for the word processor to store each page number of starting the corresponding chapter in the sentence file. To conduct the search and replacement function in the unit of chapter, conventionally, the cursor must be moved at the desired positions, so that it is rather troublesome.

According to the fourth preferred embodiment of the present invention, an improved search and replacement function for searching and replacing one or more letters in the unit of chapter.

FIG. 36 shows a flow chart of the operation for the search and replacement function according to the fourth preferred embodiment of the present invention.

The word processor of this preferred embodiment, comprises a control circuit operating the following steps : Step 51 : The cursor is positioned at the program start position to start the search and replacement function.

Step 52 : The instruction of starting the search and replacement function is inputted.

Step S3: One or more letters to be retrieved are inputted.

Step S4 : One or more letters are inputted which replace the retrieved one or more letters.

Step S5 : Inputted one or more letters are confirmed to detect whether other one or more letters to be retrieved are present or not.

Steps S61 and 571 : The page number is inputted and selected to conduct the operation of operation (2)- (i).

Steps S62 and S72 : The stop position is inputted to conduct operation (2)- (ii).

Steps 563 and 573 : The replacement number is inputted to conduct operation (2) (iii).

Steps 564 and 574 : One or more letters are inputted to conduct operation (2)- (vi).

Step 565 : The one or more letters are retrieved according to operation (1). Till the retrieval stop instruction, the retrieval continues.

Steps S66 and S76 : The running head titles and footnotes forming the sentence data are inputted to define a retieval region. When these running heads and the footnotes are detected, the replacement is s opped.- Step S8 : Within the defined region, the search and replacement operation is conducted.

According to the fourth preferred embodiment of the present invention, the head ) : title"Sorting"is selected as shown in FIG. 33, the search and replacement function is carried out over pages 1-379. When the head"Optimum Sorting"is selected, the search and replacement function is carried out over pages 181-246. Meanwhile, even when the format information is changed and the page number of FIG. 33 is changed, no change in paging can be required according to this preferred embodiment of the present invention.

Thus, according to the fourth preferred embodiment, the sentence region for the search and replacement function is defined using the running head title and the -footnotes, the sentence can be edited speedy in the unit of chapter.

While only certain embodimen+s of the present invention have been described, it will be apparent to those skilled in the art that various changes and modifications may be made therein without departing from the sprit and scope of the present invention as claimed.

Claims (6)

1. CLAIMS: 1. A word processor comprising: memory means for storing spelling data; said memory means further storing hyphenate data for a selected group of words comprising some or more letters; and print means for printing out the spelling data automatically together with the hyphenate data.
2. 2. The word processor of claim 1, wherein the number of said some letters is 6.
3. 3. The word processor of claim 1, wherein in said memory means the hyphenate data are annexed to the spelling data.
4. 4. The word processor of claim 1, wherein said memory means further stores dummy data.
5. 5. A word processor having memory means in which are stored the spelling of a plurality of words and also information specifying where at least some of the said words may be hyphenated; whereby the word processor can hyphenate words automatically during printing of text including words for which the said hyphenation information is stored.
6. 6. A word processor according to claim 4 or claim 5 wherein dummy digits are added to the continuous digital codes for said words as necessary so as to ensure that said codes each comprise one or more bytes of a predetermined number of digits.

   7'. A word processor according to any of claims 1 to 6 wherein said hyphenation data is provided for a predetermined group of words and for each word of said group indicates whether or not that word may be hyphenated.

   6. A word processor comprising: memory means for storing print data; print wheel means for printing out the print data; and control means for checking whether the type of said print wheel means has a suitable print wheel enough to print the print data.

   7. The word processor of claim 6, further comprising t a display for displaying the check of said control means.

   8. A word processor comprising: message sentence means for storing message sentences for telling system questions; and modification means for changing the message sentences.

   9. A word processor comprising: letter selection means for selecting and inputting one or more letters to be retrieved and replaced; chapter selecting means for selecting and defining a sentence region in the unit of chapter in which the one or more letters are-retrieved; and retrieval means responsive to said chapter selection means for retrieving the one or more letters and replacing them with other one or more letters.

   10. The word processor of claim 9, wherein said region selecting means receives and is operated with head and footnote information.

   11. A word processor having memory means in which it stores data for printing and a printer using an exchangeable print element, the processor checking ; the data to be printed before printing in order to establish whether the character set of the print element is adequate for printing the said data.

   12. A word processor according to claim 11 in which the said checking is carried out as the data is entered into it.

   13. A word processor which, during some states, presents messages to the operator, the processor having memory means in which to store the said messages and having means whereby the operator can alter the message which appears during a given state.

   14. A word processor having an exchange function in which a predetermined first character group of characters are replaced at each occurrence in a selected portion of a file of stored data by a predetermined second character or group of characters; the processor being able to divide the file into chapters and permitting the said selected portion to be defined as one or more said chapters.

   15. A word processor according to claim 14 in which different levels of chapters are possible, a higher level chapter comprising one or more lower level chapters.

   16. A word processor according to claim 14 or claim 15 which header and/or footer information can be associated with predetermined portions of a file of stored data, and the said portion selected for the exchange function may be defined in terms of the header and/or footer information associated with the selected portion.

   17. A word processor substantially as herein described with reference to Figures 1 to 13 of the accompanying drawings.

   18. A word processor substantially as herein described with reference to Figures 14 to 17 of the accompanying drawings.

   19. A word processor substantially as herein described with reference to Figures 18 to 31 of the accompanying drawings.

   20. A word processor substantially as herein described with reference to Figures 32 to 36 of the accompanying drawings.

   Amendments to the claims have been filed as follows CLAIMS: 1. A word processor having memory means in which are stored the spelling of a plurality of words and also hyphenation data specifying where at least some of said words may be hyphenated, whereby the word processor can hyphenate words automatically during printing of text which includes words for which the said hyphenation data is stored, said hyphenation data being provided only for words having at least a predetermined number of letters.

   2. A word processor according to claim 2 wherein said predetermined number is six.

   3. A word processor according to claim 1 or claim 2 wherein said hyphenation data is annexed in said memory means to the spelling data for said at least some of said words.

   4. A word processor according to claim 3 wherein for each said word which may be hyphenated, the hyphenation data is included in a continuous digital code which also includes the spelling data for that word.

   5. A word processor according to claim 4 wherein an initial part of said continuous digital code forms said spelling data, and wherein said hyphenation data follows immediately after said spelling data.