JPH0215364A - Document processor - Google Patents

Abstract

PURPOSE:To save operator's selecting operation by providing a processing means for automatically correcting an input word to a substitutive candidate word when only one substitutive candidate word exists. CONSTITUTION:When the operator incorrectly inputs a word and no word candidate exists in a word dictionary 29, no existence of the word in the diction ary 29 is decided by a retrieved result decider 4 and the input word is trans ferred to a spelling corrector SC 5. The number '1' of substitutive candidate words obtained by the processing of the SC function is transferred to a substitu tive candidate word comparator 7. Since the number of substitutive candidate words is decided as '1', an input signal 101 to an AND gate 10 is enabled and a candidate word outputted from the SC 5 is inputted to an OR gate 11 as an input signal 111. Thus, a correct word can be obtained without operator's selection only by disabling an input 301 of an OR gate 30 and displayed on a display device 12.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a Sentence 8 processing device that is capable of obtaining words with the correct pronunciation that can be deduced from the character information of an input word based on the orthography or pronunciation. It is something.

(Prior art) Figure 8 shows a function (hereinafter referred to as spelling helifire) that determines whether the input J\i and the word is spelled correctly, and the correctly spelled word based on the input characters and information. (hereinafter referred to as spelling corrector).
FIG. 2 is a block diagram of an AND collector (S, V, C).

FIG. 9 is a flowchart 1 to 1 showing the operation of the spelling helifire function. FIG. 10 is a flowchart showing the operation of the spelling corrector function. A control program according to the flowcharts of FIGS. 9 and 10 is stored in a ROM 26.

The conventional technology will be described below with reference to FIGS. 8, 9, and 10.

(1) Description of Spelling Verifier First, in step 5lot of FIG. 9, the word input by the operator from the input device 28 such as a keyboard is received. Next, in step 5102, the spelling verifier searches the word dictionary 29 for the input word and obtains the search results.

In step 103, it is determined whether the input word exists in the word dictionary 29. Input word is word dictionary 29
If it exists in the input word, it is determined that the spelling of the input word is correct,
The process ends, but if the word does not exist, it is determined that the word is misspelled, and the process proceeds to step 5104 to notify the operator of the result.

To further execute the spelling collector, in step 5105 the spelling collector (S, C,
) and pass the input word to the spelling collector.

(2) Description of Spelling Collector The operation of the spelling collector will be explained according to the flowchart of FIG. 1O when the operator inputs the wrong word "vict, orie".

First, in step 5201, the word "victoria", which is marked N or G by the spelling verifier, is taken. In step 5202, 'victor
The spelling of the input word is modified such as "yvictori", "victoria", etc., and in step 5203, the word dictionary 29 is searched for the modified word.

Then, in step 5204, if the transformed word exists in the dictionary 29, the process advances to step 5205, and the transformed word is stored in the RAM (random access memory) 25 as a replacement candidate word.

Some constraints are determined in advance regarding the extent to which the input word is transformed, and in step 206 it is determined whether the above constraints are satisfied and the transformation work has been completed, and in step 5206 it is determined that the transformation has been completed. from step 5202 to step 5206 until
Repeat the process up to.

When the transformation of the input word is completed, step 5207
, and the modified word "vic" stored in the RAM 25
tory, vector, victo
ria” and “victories” are displayed on the display 27, for example, with numbers.
08, select only one correct word from among the candidate words displayed on the display 27 and input it, for example, by number,
The operation ends by outputting the correctly spelled word in step 5209.

[Problem to be solved by the invention]

However, in the conventional example described above, even if there is only one "word determined to be correct by analogy with the input word" as a result of activating the spelling collector and searching, that word is displayed to the operator. , the operator is forced to make a selection, which has the disadvantage of requiring the operator to perform unnecessary operations.

The object of the present invention is to eliminate the above-mentioned drawbacks and to provide a document processing device that does not require unnecessary operations on the part of the operator.
It's about doing.

[Means to solve the problem]

In order to achieve such an object, the present invention includes an input means for inputting a word, a determination means for determining whether the input word is spelled correctly, and based on the determination, a word candidate with the correct spelling of the word. The apparatus includes a replacement candidate word output means for outputting, and a correct word output means for replacing and outputting a word with the input word when the number of words output by the output means is one.

[Effect]

According to the present invention, when there are multiple words determined to be correct by analogy with the input word (hereinafter referred to as "replacement candidate word pa") obtained by the spelling corrector function, By executing the word replacement process and providing a process that automatically corrects the input word with the replacement candidate word if there is only one replacement candidate word,
This makes it possible to omit the operator's selection operation.

〔Example〕

Hereinafter, the present invention will be described in detail with reference to the drawings.

As shown in FIG. 1, the document processing device according to the present invention includes an input means 101 for inputting a word, a determining means 102 for determining whether the input word is spelled correctly, and based on the determination, the correct spelling of the word. Comprising replacement candidate word output means 103 for outputting a word candidate, and correct word output means 104 for replacing and outputting a word with an input word when the number of words output by the output means 103 is one. It is characterized by

FIG. 2 shows the configuration of an embodiment of the present invention. Here, 1 is an input device as a means for inputting words, and is, for example, a keyboard as shown in FIG. 2 is a buffer for memorizing and saving input words, and usually RA
It consists of M (random access memory). 3
4 is a spelling verifier (hereinafter referred to as S, V) as a means of checking the spelling of the input word (17f); 4 is a search result determiner, which determines whether the spelling of the word is correct and performs subsequent processing; instruct.

Reference numeral 5 denotes a spelling corrector (hereinafter referred to as S and C) as a means for correcting the spelling of words. 6 is an AND gate that controls whether or not to output the input word as it is; the signal 601 output from the search result judger 4 and the signal 602 output from the buffer 2 are input;
Outputs 2. 7 is a replacement candidate word number comparator, S,
The number of replacement candidate words obtained from S, C, 5 is compared with the value °°1'' input from the input device 8. 9 is a word replacement processing device, and the number of replacement candidate words obtained from S, C, 5 is compared. Select the correct word from a single item and replace it with the input word.

10 is an AND gate, which controls whether or not to output the replacement candidate word as is. AND gate lO has S,
The signal 102 output from C, 5 and the signal 101 output from the replacement candidate word number comparator 7 are input, and the signal 1
Outputs 11.

Reference numeral 11 denotes an OR gate, which controls whether to output either the input word or the replacement candidate word to the display 12 and the buffer 2. The signals 11 and 111 output from the AND gate and 10 are input to the OR gate 11, and the signal 3
02 is output. 30 is an OR gate, which controls whether the output of the replacement processing device 9 (input signal 301) or the output of S, C, 5 (input signal 302) is output as is.

12 is a display that displays the result (correct word).

FIG. 3 shows the overall appearance of an electronic typewriter to which the present invention is applied. Here, 1 is a keyboard. 12 is a display of the typewriter, on which input characters are displayed. 13 is the main body of the electronic typewriter. A platen knob 14 manually rotates a platen for loading recording paper.

Figure 4 shows the operating section (keyboard) of the electronic typewriter mentioned above.
FIG. Here, 15 is a RETURN key. 16 is an INDEX key. 17 is Revers
This is the eINDEX key. 18 is a 5TAR key.

19 is the C0DE key. 20 is the E key to SP8. 5Use the PAC key 20 to input word break information, and use the C0DE key 19 to select S, C, and functions (described later).
Replacement candidate word display) is activated.

Next, the present invention will be described in detail with reference to the operational flowchart of the present invention shown in FIG. 5 for two cases: a case where a plurality of candidate words exist and a case where only one candidate word exists.

(Example 1) When there are multiple candidate words For example, the operator accidentally inputs the word "victory" and the word dictionary 29 does not contain "victory".
, vector, victoria“
The operation will be explained in the case where there are four replacement candidate words "v1ctories".

First, the operations from step Sl to step S4 are repeated until the operator inputs a space immediately after inputting "victorie". Specifically, step S
1, "V" is input, the character is stored in the buffer 2 in step S2, and further displayed on the display 12 in step S3.

In step S4, it is determined whether the input character is a word delimiter (for example, a space),
If it is not a delimiter, the process returns to step 51, and if a space, which is a delimiter between 11 words, is input, the process proceeds to step S5.

In step S5, the portion between the last input "word break" and the "word break" immediately before it, that is, the last input word, is cut out from buffer 2, and S, V, and 3 are extracted. Start and say the above word “victori”
e” to S, V, and 3. S, V, and 3 pass the input word “vi” to S, V, and 3.
ctorie" in the word dictionary 29, and in step S7, the search result determiner 4 determines "NG"("victorie" does not exist in the dictionary), and the process proceeds to step S8.

In step S8, the input signal 601 of the AND gate 6, which controls whether or not to output the input word as a correct word, is disabled (disabie), and as a result, in step S9, whether the input word or the replacement word is output is disabled. 01 (gate 1
1 input signal 112 is disabled (disabled).
), and the output to the display 12 will be the replaced word.

In step S10, the input word is passed to S, C, and 5. In step 51.1, the output from S, C, 5, ie, information on replacement candidate words, is passed to the input signal 102 of the AND gate 10 and the word replacement processing device 9. Step 5
In step 12, the number of replacement candidate words "4" is passed to the number of replacement candidate words comparator 7.

The determination in step 513 is N because the number of candidates = “4”.
O, and the process advances to step S22. The input signal 101 of the AND gate 10 is disabled (as a result, the input signal 302 of the OR gate 30 becomes “0”).
”) In step 523, the conventional S, C,
(see the prior art section above), the correct word "victory" is obtained and displayed on the display 12 in step 518.

(Example 2) When there is only one candidate word For example, when the operator tries to input the word ``xenon'', the operator accidentally inputs the word ``x e n o n''.
e”, and the word dictionary 29 contains °'xe.
The operation will be explained for the case where only the candidate word "non" exists.

First, the operator inputs the word "xenone" according to the series of processes from step Sl to step S4 described above. When the operator inputs "e" followed by "space", the "word break" is set in step S4. It is determined that this has occurred, and the process advances to step S5.

In step S5, the word "xeno" is extracted from buffer 2.
ne'' and start S, V, 3. Step S
In step 6, the input word "xenone" is passed to S, V, and 3, and the word dictionary 29 is searched. Input word “xeno”
Since "ne" does not exist, the search result determiner 4 determines "NG (does not exist in the dictionary)" in step S7, and the process advances to step S8.

In step S8, the input signal 6 to the AND gate 6
01 is disabled to prevent the input word "xenone" from appearing in the final output. Then, in step S9, the input signal 112 to the OR gate 11 is disabled.

In step 510, input word xen to S, C, 5
one'' is passed, and the result obtained by processing the S, C, functions is used as the replacement candidate word xenon in step 511.
" is passed to the AND gate 10 and the word replacement processing device 9. In step S12, the number of replacement candidate words "1" is passed to the AND gate 10 and the word replacement processing device 9.
” is passed to the replacement candidate word number comparator 7.

In step S13, the number of replacement candidate words is determined to be "1," so in step 515, an AND gate lO
The candidate word "Xen0ne" output from S and C5 by enabling the input signal 101 of
By disabling at step 7, the correct word "xenon" is obtained and displayed on display 12 at step 518 without operator selection.

(Example 3) When the correct word is input The operation will be explained in the case where the operator inputs the overwhelming word "'victory". The processing from step S1 to step S6 in the flowchart of FIG. 5 is the same as in the above-mentioned (Example 1) and (Example 2), so a description thereof will be omitted.

The word “victory” input in step S7
” in the word dictionary 29 and “0. Since the search result determiner 4 obtains the result "(exists in the dictionary)", the process advances to step 519.Steps 519 and 5
20 and 521, input 6 of AND gate 6
OR gate 1 to enable 01
The input signal 112 to the input word "victory" is input to the input word "victory", and the input signal 111 to the OR gate 11 and the input signal 301 to the OR gate 30 are disabled. As a result, step 518
The correct input word "victory" is displayed as is on the display device 2.

FIG. 6 shows a block configuration when the present invention is implemented using a microcomputer. Here, 21 is a central processing unit (C20) of this system, which controls all operations.

3 is a spelling helifire (S, V,) that determines whether the spelling of an input word is correct or incorrect. 5 is a spelling corrector (S, C,) having a function of obtaining correctly spelled words from input words. 1 is an input device for inputting words. 12 is a display device for displaying words and other information.

A read-only memory (ROM) 22 stores information such as programs and word dictionaries for operating this system. 23 is a readable/writable memory (RAM) used as a work area of this system, and the above six units are connected to CPIJ2 via bus 24.
1 is connected.

The operation of this embodiment will be explained according to the flowchart in FIG. First, in step 551, a character is input from the input device 1, and the operations of sequentially storing it in the RAM 23 and displaying it on the display 12 are performed in step S52.
and step 553.

The series of operations from step 551 to step S54 is repeated until, for example, "space" is input from the input device 1 as "word break" information.

When one word has been input, the input word is cut out from the RAM in step S55. pass the above word to spelling verifier 3 in step 556°;
A search is performed in the word dictionary stored in the ROM 22. Then, in step S57, a search result is obtained.

In step 558, it is determined whether the input word exists in the dictionary based on the search results, and if the input word exists, the subsequent processing is not executed and the process returns to step 551.
Waiting for word input.

If the input word does not exist in the dictionary, this fact is output in some form (for example, an alarm), and the process advances to step S59. In step 559, the above input word is passed to the spelling collector 5. Then, in step 560, replacement candidate words and their total number are obtained from the spelling corrector 5.

In step 5ail, it is determined whether or not the number of replacement candidate words is plural. If it is plural, the process proceeds to step 584, where the function of a conventional spelling corrector is executed, and from among the candidate words displayed on the display 12. A process is performed in which the operator is asked to select the correct unit. If there is only one candidate word, step S62
Then, the input word stored in the buffer in the RAM 23 and the replacement candidate word are forcibly exchanged. The correct word obtained through this exchange is displayed on the display 12 in step S63.

(Effect of the invention) As explained above, in the present invention, the spelling
If there is only one replacement candidate word during collector processing, we added processing to automatically replace the input word in the buffer with the correct word, so the replacement candidate word is displayed on the display. This eliminates the need for the operator to make a selection, which helps the operator in document creation, and at the same time improves the efficiency of document creation.

[Brief explanation of the drawing]

FIG. 1 is a basic configuration diagram of a document processing device according to the present invention, FIG. 2 is a block diagram of an embodiment of the present invention, FIG. 3 is an external view of an electronic typewriter implementing the present invention, and FIG. 4 is a block diagram of an embodiment of the present invention. 3 is a diagram showing the keyboard, FIG. 5 is a flowchart showing the operation of one embodiment of the present invention, FIG. 6 is a block diagram of another embodiment of the present invention using a microcomputer, and FIG. 7 6 is a flowchart showing the operation of FIG. 6, FIG. 8 is a block diagram of S, V, and C in the conventional device. FIG. 9 is a flowchart showing the operation of S, V in the conventional device. FIG. 10 is a flowchart showing the operations of S and C in a conventional device. l... Keyboard, 2... Buffer, 3... Spelling verifier, 5... Spelling corrector, 7... Replacement candidate word number comparator, 9... Word replacement processing device, 12 ...display unit, 21...cpu (central processing unit), 22...RO
M (read-only memory) 23...RAh+ (readable/writable memory) 29... word dictionary ROM. #Kimeibushuroubunsansuri-IM&/) Basic Nene palm to the first picture book A Chiritsuki Oi Suzu! , f) N sugoiida 1'' 6th figure I foothold f) Bun I or Rikaku θ 3rd figure 8th figure 0 Tae Niwa 1.・Flow doto shade figure 9 showing the time

Claims (1)

[Scope of Claims] 1) Input means for inputting a word; determining means for determining whether the input word is spelled correctly; and replacement for outputting word candidates with the correct spelling of the word based on the determination. A document characterized by comprising: candidate word output means; and correct word output means that replaces and outputs the input word with the input word when the number of words output by the output means is one. Processing equipment.