JPH0449724Y2 - - Google Patents

Description

[Detailed Description of the Invention] [Industrial Field of Application] This invention relates to a text processing device such as a Roman typewriter having a word registration function.

[Prior Art] Conventionally, in a Roman typewriter equipped with a spell check function, when attempting to check an input word for misspellings or omissions, the input word is compared with words registered in a spell check dictionary. As a result, if the input word is not registered in the spell check dictionary, a spell check error is notified to that effect.

[Problem to be solved by the invention] However, in this type of typewriter, the number of proper nouns (person names, place names, etc.) recorded in the spell check dictionary is very small; becomes a spell check error. In such cases, it is necessary to check whether the spelling of the input word is correct every time a proper noun spell check error occurs, so it is necessary to register the words of frequently used proper nouns in advance. It would be fine if they had been registered, but the registration was time-consuming and troublesome.

The problem of this invention is to register the word in the spell check dictionary when a word matching the input word is not registered and the word starts with an uppercase letter.

[Means for solving the problem] FIG. 1 is a functional block diagram of this invention. In the figure, 1 is a character input means such as a keyboard for inputting letters constituting a word such as alphanumeric characters, 2 is a word storage means to be referred to when checking the spelling of an input word, and 3 is a character input means 1 that is input from the character input means 1. Detecting means 4 detects whether the input word input from the character input means 1 is stored in the word storage means 2 by the detection means 3; identification means 5 for identifying whether or not the input word starts with a capital letter in the alphabet when it is detected that the input word does not include a specific character; This is a registration means for registering the input word in the word storage means 2 when it is identified that the input word is written.

[Operation] Next, the operation of this invention will be explained. When the detection means 3 detects that the input word from the character input means 1 is not stored in the word storage means 2, the identification means 4 identifies whether or not the input word starts with a capital letter. conduct. Depending on the identification result, the registration means 5 stores the input word in the word storage means 2.

Therefore, if a word matching the input word is not registered and the word starts with a capital letter, the word can be registered in the spell check dictionary.

[Example] An example of this invention will be described below with reference to FIGS. 2 and 3.
This will be explained in detail with reference to the drawings. Note that this embodiment shows an example in which the present invention is applied to a Roman typewriter with a spell check function.

Configuration Figure 2 is a basic block circuit diagram of this Roman typewriter. In the figure, reference numeral 11 denotes a key input section, and this keyboard is provided with numerical keys, alphanumeric keys, etc. Then, the key input section 11
A key input signal outputted from the CPU (central processing circuit) 12 in response to an operation key is sent to a CPU (central processing circuit) 12, and designates an input processing program therefor.

The CPU 12 controls various operations of this typewriter, and executes input processing, spell check processing, word registration processing, printing processing, etc. The CPU 12 is a system that configures the character generator and stores control programs, etc.
ROM (read only memory) 13, dictionary ROM 14 that stores words for spell check
are connected, and their contents are read out and taken into the CPU 12 under the control of the CPU 12. Also,
The CPU 12 is connected to a registered word RAM (random access memory) 15 in which spell check words registered as external characters are stored, and a system RAM 16 that constitutes a sentence memory, etc., and these write and read operations are performed under the control of the CPU 12. is controlled.

On the other hand, the CPU 12 sends text data to the printing section 17 and the display section 18, and controls printing and display operations of the text data.

Operation FIG. 3 is a flowchart that starts execution every time one word is input from the key input section 11. Here, the CPU 12 processes the input of a space until the next input of a space as one word. First, when one word is input, a search operation is performed in which word data is sequentially read from the dictionary ROM 14 and compared with the input word data (step S1). As a result, if a word that matches the input word is stored in the dictionary ROM 14, this information is stored in step S2.
is detected, exits from this flow, and waits for key input such as the next word. That is, if the input word exists in the dictionary ROM 14, it means that the word was input with the correct spelling, so in this case, the process exits from this flow and a spell check error does not occur.

On the other hand, words that match the input word are displayed in the dictionary.
Step S2 indicates that it is not stored in the ROM14.
When the word is detected, a search process is executed in which the words registered in the registered word RAM 15 are sequentially read out and compared with the input word (step S3). As a result, the words that match the input word will be registered.
If it is detected in step S4 that the input word is stored in the RAM 15, the process exits from this flow in the same way as in the case described above.
Registered word RAM1 even if it does not exist in ROM14
If it exists in 5, it will not be a spell check error.

Also, words that match the input word are registered in the word RAM.
If it is not stored in 15, step S4
Proceed to step S5. Here, a check is made to see if the input word starts with a capital letter, in other words, to see if the input word is a proper noun. As a result, the input word is displayed in dictionary ROM1.
4. If the word is not stored in the registered word RAM 15 and does not start with a capital letter, a spell check error occurs, and the printing unit 17 is driven to notify the error (step S9).

Also, if the word starts with a capital letter, the step
Proceeding to S6, the printing unit 17 is driven and an error notification to that effect is performed. And the next step
In S7, a check is made to see if the input word has been corrected or changed. Here, the input word is displayed on the display unit 18, so visually check whether there are any typos or omissions, and if there are any typos or omissions, correct them according to the normal key operation procedure. conduct. Now, if the input word is corrected, it is detected in step S7 and the process returns to step S1, but if no correction is made, the process proceeds to step S8, where the input word is directly transferred to the registered word RAM 15 and registered. Ru. That is, words starting with a capital letter are registered words in the dictionary ROM 14.
If it is not stored in any of RAM15,
The word is automatically registered in the registered word RAM 15, but in this case, the input word newly registered in the registered word RAM 15 is not limited to words that were entered with the correct spelling from the beginning, but also includes words that have been corrected since then. .

In this way, in this embodiment, even if a word causes a spell check error during text input, for words starting with a capital letter, after the error notification,
If there is no correction, the input word is registered, and if the correction is made, the corrected word is registered, so that spell check errors will not occur every time a proper noun is input. To eliminate inconveniences, the registration work required when frequently used proper nouns are registered in advance is reduced.

In the above embodiment, the present invention is applied to a Roman typewriter with a spell check function, but it is of course applicable to a word processor.

[Effects of the invention] According to this invention, it is possible to increase the number of words registered in a check dictionary simply by inputting text data. Therefore, for example, when checking the spelling of an input word,
This has the effect of reducing the registration work required when frequently used proper nouns are registered in advance in order to eliminate inconveniences such as spell check errors occurring each time a proper noun is input.

[Brief explanation of the drawing]

Figure 1 is a functional block diagram of this invention, Figure 2,
Figure 3 shows an embodiment of this invention, Figure 2 is a basic block circuit diagram of a Roman typewriter equipped with a spell check function to which this invention is applied;
The figure is a flowchart for explaining the operation of this embodiment. 11...Key input section, 12...CPU, 13...
...System ROM, 14...Dictionary ROM, 15
...Registered word RAM.

Claims (1)

[Scope of utility model registration request] a character input means for inputting characters constituting a word; a word storage means for referring to when checking the spelling of an input word inputted from the character input means;
a detection means for detecting whether or not an input word input from the character input means is stored in the word storage means; and a detection means for detecting whether the input word input from the character input means is stored in the word storage means; an identification means for identifying whether or not the input word is a word starting with a capital letter of the alphabet when it is detected that the input word is not stored in the capital letter of the alphabet; 1. A text processing device having a word registration function, further comprising a registration means for registering the input word in the word storage means when it is identified that the input word is a word that begins with the first word.