JPH0476761A - Document processor with spelling checking function - Google Patents

Abstract

PURPOSE:To improve the working efficiency of document processing by automatically rewriting an inputted misspelled word by its corresponding candidate word. CONSTITUTION:A misspelled word and a selected candidate word are relationally stored in a word pair memory 26 in a RAM 20. When an inputted word has been stored in the memory 26, the inputted word is automatically rewritten by a candidate word stored in relation to the misspelled word without executing spelling check or candidate word retrieval, so that in the case of repeatedly inputting a word stored by a misspelling, the retrieving and selecting operation of candidate words can be completely omitted in the 2nd input and after. Consequently, time required for the retrieving and selecting operation of candidate words is saved and the working efficiency of document processing is improved.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a document processing device with a spell check function;
In particular, it relates to a system in which a misspelled word is automatically rewritten with the candidate word stored in correspondence with the misspelled word.

[Prior art]

In general, word processors for Roman languages are equipped with a dictionary memory that stores spelling information for many words within the control device.
Devices equipped with a spell check function to check the spelling of input words and a candidate word search function to search for candidate words related to misspelled words and display them on a display have been put into practical use.

In word processors equipped with these functions, when an input word is misspelled, the display displays one or more correctly spelled candidate words related to the misspelled word, and the desired candidate word is selected. There is. That is, when these candidate words are displayed one by one, the next key is repeatedly operated until the desired word is displayed, and the misspelled word is replaced with the candidate word selected by the selection key.

Also, if multiple of these candidate words are displayed at once,
Normally, the cursor points to the first candidate word, so
When specifying the second and subsequent candidate words, the cursor movement key is repeatedly operated to specify the desired candidate word with the cursor, and the misspelled word is replaced with the candidate word selected using the selection key.

Here, the candidate word is searched according to a predetermined rule based on candidate word search control, so for example, when the same misspelled word as the previous one is input, multiple candidate words similar to the previous one are displayed in the same display order as the previous one. be done.

[Problem to be solved by the invention]

By the way, when an operator remembers some words with incorrect spellings, it is not uncommon for the operator to repeatedly input the incorrect spellings.

Therefore, in word processors equipped with conventional spell check and candidate word search functions, each time the operator inputs the misspelled word, a candidate word search is executed and displayed. Therefore, you have to interrupt the document input work and select a candidate word, and especially if the desired candidate word is displayed late, you have to press the cursor movement key or next key several times each time. Moreover, there are problems such as the operation for selecting candidate words becomes complicated, the search for candidate words and the operation for selecting candidate words take time, and the efficiency of document processing decreases.

An object of the present invention is to provide a document processing device with a spell check function that can automatically replace input misspelled words with corresponding candidate words.

Means for Solving Problem C] A document processing device with a spell check function according to the first claim, as shown in the functional block diagram of FIG. an input means, a display means capable of displaying a plurality of character strings, a word buffer that sequentially receives and stores word data input or stored in memory in advance, and a word buffer that stores spelling information of a large number of words. a spell checker that receives word data from the word buffer and performs a spell check on each target word via the dictionary memory; and a dictionary that stores candidate words related to misspelled words determined to be misspelled by the spell checker. Candidate word search means for searching through memory;
In a document processing device with a spell check function, which includes a display control means for displaying searched candidate words on a display means, and a selection means for selecting a desired candidate word from the displayed candidate words, a word selected by the selection means is provided. a word pair storage means for storing candidate words and misspelled words in association with each other; a determination means for determining whether or not a target word is stored in the word pair storage means; When stored as a word, the target word in the word buffer is associated with the misspelled word and rewritten with a candidate word stored in the word pair storage means, and the spell checking means stops spell checking the target word. It is equipped with a rewriting command means.

As shown in the functional block diagram of FIG. 1(b), the document processing device with a spell check function according to a second aspect of the present invention provides a document processing device with a spell check function that selects a candidate word and a misspelled word each time the selection means selects a candidate word. The present invention is provided with word pair storage means for storing word pairs such as at the top position of the word pair storage means.

[Effect]

In the document processing device with a spell check function according to the first aspect, the word pair storage means stores the candidate word selected by the selection means and the misspelled word determined to be misspelled by the spell check means in association with each other. On the other hand, the determining means determines whether or not the target word is stored in the word pair storage means each time the target word is stored in the word buffer.

Then, in response to the determination result of the determining means, when the target word is stored as a misspelled word, the rewriting command means associates the target word in the word buffer with the misspelled word and stores it in the word pair storage means. The target word is rewritten with the target word, and the spell check means stops checking the spell of the target word.

The document processing device with a spell check function according to the second claim basically operates in the same manner as the first claim, but
Each time a candidate word is selected by the selection means, the word pair storage means sequentially stores word pairs consisting of the candidate word and the misspelled word at the head position of the word pair storage means.

〔Effect of the invention〕

According to the document processing device with a spell check function according to the first aspect, the word pair storage means, the discrimination means, and the rewrite command means are provided, and the misspelled word and the selected candidate word are stored in the word pair storage means in association with each other. Then, when the input target word is stored in this word pair storage means, the target word is automatically replaced with the stored candidate word in association with the misspelled word without performing a spell check or candidate word search. Since it is rewritten, if you repeatedly enter a word that you have memorized with an incorrect spelling, you can omit the search and selection operation for candidate words from the second time onwards. This can save time and greatly improve document processing efficiency.

According to the document processing device with a spell check function according to the second claim, the same effects as in the first claim can be obtained. In addition, each time a candidate word is selected by the selection means, a word pair consisting of a candidate word and a misspelled word is stored at the beginning of the word pair storage means, so the more recently stored a misspelled word, the faster the search time. It is possible to significantly improve the efficiency of document processing.

[Example] Hereinafter, an example of the present invention will be described based on the drawings.
This embodiment is a case where the present invention is applied to an English word processor.

As shown in FIG. 2, a keyboard 3 is disposed at the front of the body frame 2 of the word processor 1.
A daisy-wheel type printing mechanism PM is provided in the main body frame 2 behind the keyboard 3, and a liquid crystal display 1 capable of displaying display information consisting of characters and symbols is provided at the rear of the keyboard 3.
0 is set.

The keyboard 3 includes character keys including alphabet keys, numeric keys, and symbol keys, a space key, a return key,
Cursor movement keys for moving the cursor on the display 10 in the left and right directions, various function keys, etc. are provided in the same way as normal ones, as well as a spell check mode setting key for setting or canceling the spell check mode, Next key to display the next candidate word Previous key to display the previous candidate word, Selection key to replace the entered misspelled word with the desired candidate word, End key to end various functions is provided.

The printing mechanism PM has a general configuration including a platen, a carriage, a daisy wheel, a driving circuit for these, and the like.

Next, the control system of the word processor 10 is constructed as shown in the block diagram of FIG.

The display mechanism DM includes a liquid crystal display 10 and a display RAM for outputting display data to the display 10.
and a display controller 11 including a character generator ROM storing a large number of dot patterns such as characters and symbols. Incidentally, reference numeral AM designates an alarm mechanism that includes a buzzer 12 and a drive circuit 3 that makes the buzzer 12 sound.

The control device C includes a CPU 6, an input/output interface I4 connected to the CPU 16 via a bus I5 such as a data bus, ROMs 17 and 18, and a RAM 20.

The program memory of the ROM 17 includes a control program that controls the display mechanism DM in response to code data input from the keyboard 3, a control program that stores the code data in the line buffer 21, and a control program that controls the display mechanism DM in response to code data input from the keyboard 3, and a control program that stores the code data in the line buffer 21. A cursor movement control program for moving the cursor, a spell check/candidate word search control program, etc. are stored.

The spell check/candidate word search control program includes a spell check processing subroutine for executing spell check processing on input words and a candidate word search processing subroutine for searching the dictionary memory 18 for candidate words related to misspelled words. Stored.

In the dictionary memory of the ROM 1B, spelling data regarding approximately 70,000 words, for example, is stored in alphabetical order like a normal dictionary in order to check the spelling of words.

Here, spell check processing is a well-known and common process, so to briefly explain it, the word data of the word input from the keyboard 3 and stored in the word buffer 24
The spelling is checked by comparing the spelling data of a large number of words stored in the dictionary memory of the OM1B.

Candidate word search processing is a well-known and general process, so to briefly explain it, it is a search process that repeatedly searches whether or not a word exists in the dictionary memory 18 by replacing each letter of a misspelled word with each letter of the alphabet, or a similar process. This method searches for correctly spelled candidate words related to the misspelled word by transposing character strings based on rules that make misspellings easier.

In the line buffer 21 of the RAM 20, one line of word data input manually from the keyboard 3 is stored.

The text memory 22 receives one line of word data from the line buffer 21 one after another and stores document data.

The buffer pointer 23 stores one address within the line buffer 21 based on the display position of the cursor. Note that the contents of this pointer 23 are referred to as pointer PTO.

The word buffer 24 stores the latest input word (target word) data supplied from the line buffer 21.

The candidate word memory 25 stores, for example, up to 50 correctly spelled candidate words searched for misspelled words. Note that the end data rFFJ is automatically stored at the address next to the final candidate word.

As shown in FIG. 5, the word pair memory 26 consisting of a RAM backed up by a battery stores word pairs in which the data of the misspelled word determined to be misspelled and the data of the candidate word selected by the selection key operation are paired. For example, up to 100 sets are stored. Note that end data rFF is automatically stored at the next address of the final word pair.

One address of the candidate word memory 25 is stored in the pointer 27 . Note that the contents of this pointer 27 are
shall be.

The flag memory 28 stores flag data of a spell check mode flag F that is set (data is "1") when the spell check mode is set and reset (data is "0") when the spell check mode is canceled. be done. Furthermore,
The RAM 20 is provided with various types of memories, counters, pointers, etc. for temporarily storing the results of calculations performed by the CPU 16, as required.

Next, regarding the spell check/candidate word search control routine performed by the control device C of the word processor I,
This will be explained based on the flowcharts shown in FIGS. 4(a) to 4(b). In addition, 5i (i=10.11.12...
) is each step.

In the document data input mode, each time a character key, space key, or other key is operated on the keyboard 3, the code data corresponding to that key is stored in the line buffer 2.
This control is started at the same time that the word separator key such as the space key or return key is operated (S10: Yes), and when the flag F is set and the spell check mode is in effect (Sll :Yes
), the latest input word data is read from the line buffer 21 based on the pointer PTO and stored in the word buffer 24 (S12). Note that when the SIO or Sli determines NO, this control is ended and the process returns to the main routine. Next, all misspelled word data stored in the word pair memory 26 is searched for the input word data (313), and if the same word as the input word is not stored in the word pair memory 26 (S14: NO).
, a spell check process is executed for the input word data using the dictionary memory 18 (318), and if there is no word that is the same as the human word and there is a misspelling (S19: Ye
s), the buzzer 12 sounds to warn you of the misspelling (
S20), the candidate word memory 25 is cleared (S21)
). Next, the dictionary memory 18 is searched for candidate words related to this misspelled word (S22), and when a candidate word is detected (S23: Yes), all detected candidate words are stored in the candidate word memory 25. Along with being
The starting address of the candidate word memory 25 is stored in the pointer PTI (S24). However, when no candidate word is detected (S23: NO), the display 10 shows “
"No candidate word" is displayed (326).

Next, the first candidate word stored in the first position indicated by the pointer PTI among the candidate words stored in the candidate word memory 25 is displayed (S25).

Then, when the next key is operated (S27/S28:
Yes), pointer PTI based on end data rFFJ
When indicates the start address of a candidate word other than the final candidate word (329: NO), the pointer PTI is incremented and points to the start address of the next stored candidate word (S30). Candidate words are displayed (331). Furthermore, when the previous key is operated (S27/S33: Yes) and the pointer PTI indicates the start address of a candidate word other than the first candidate word (S34: No), the pointer PT1 is decremented. Since the start address of the candidate word stored immediately before is specified (S35), the candidate word immediately before is displayed (336).

Incidentally, when it is determined Yes in S29 or 334, the buzzer 12 sounds (S32).

Then, when the selection key is operated (327・S3
7: Yes), the candidate word displayed on the display 10 is replaced with the inputted misspelled word and displayed, and the word buffer 24 is sent to the line buffer 2 via the word buffer 24.
1 is replaced with the input word (33B), and a word pair consisting of the misspelled word and the selected candidate word is inserted and stored at the top position in the word pair memory 26 (33B).
S39), return to the main routine. For example, as shown in Figure 5, the input word ``ass'' is a misspelling.
k'', rsma ] J and the selected candidate word rask
", rsmall" are stored in pairs.

On the other hand, when the same word as the input word is stored (S14: Yes), the input word in the line buffer 21 indicated by the pointer PTO is stored in the word pair memory 2 (315). For example, the fifth
As shown in the figure, when the input word "rsmal" is stored in the word pair memory 26 as a misspelled word, the input word in the line buffer 21, that is, the misspelled word r
smal” is a candidate word rs stored in the word pair memory 26 in correspondence with this misspelled word rSmal.
It can be rewritten as "mall".

Next, in the word pair memory 26, the word pair consisting of the misspelled word and the candidate word is moved to the top position and inserted and stored (S16), and the operator is informed that the input word has been automatically rewritten to the candidate word. Buzzer 12 to notify
is sounded, for example, twice (S17), and this control is ended and the process returns to the main routine. For example, as shown in FIG. 6, the misspelled word rsmal and the candidate word rsm
a11'' is moved to the top position and inserted and stored. Then, when the word rsmalj is input again next time, since this input word rsma1 is stored at the beginning position of the word pair memory 26, the input word rsm
The search time for "al" is shortened. However, Yes in S14
When it is determined that S15 to S317 are executed, the spell check process performed on the input word in S1B is canceled.

Then, when the end key is operated (327・S4
0: Yes), a termination process such as erasing the displayed candidate word is executed (S41), and the process returns to the main routine. However, when a key other than the next key, previous key, selection key, or end key is operated (S27: Yes, 3
40: No), the buzzer 12 sounds (S42).

The spell check/candidate word search processing control is partially changed to count the number of times the same misspelled word stored in the word pair memory 26 is inputted, and the count value is After reaching a predetermined number, the misspelled word may be automatically replaced with a corresponding candidate word.

As explained above, a misspelled word and a selected candidate word are associated with each other and stored in the word pair memory 26, and when the input word is stored in this word pair memory 26, a spell check or a candidate word search is performed. The input word is automatically rewritten with the candidate word stored in association with the misspelled word without having to run the word, so if you repeatedly enter a word that you have memorized with an incorrect spelling, you can use the search function to search for candidate words. The selection operation can be completely omitted from the second time onward, thereby reducing the time required for candidate word searches and selection operations, and greatly improving the efficiency of document processing.

Furthermore, each time a candidate word is selected, a word pair consisting of a candidate word and a misspelled word is stored at the beginning of the word pair memory 26, so that the search time for the most recently stored misspelled word is reduced. The efficiency of document processing can be significantly improved.

Note that the selected candidate word memory 26 may store the sequence number data and the data of the selected candidate word in association with each other.

Further, the selection candidate word memory 26 is a RAM type IC.
It is also possible to provide an external storage memory such as a card or floppy disk. In this case, a large number of words can be stored.

Note that the candidate word memory 25 and the selected candidate word memory 26 may store the starting address of the dictionary memory 18 in which the candidate words are stored instead of the candidate word data.

Note that the present invention can also be applied to the case where each word of document data already stored in the text memory 22 is subjected to spell check processing.

It goes without saying that the present invention can be applied to various document processing apparatuses, such as Roman word processors and electronic typewriters, which are equipped with a fixed dictionary memory or a user dictionary memory and are capable of spell check/candidate word search processing.

[Brief explanation of the drawing]

Figures 1(a) and 1(b) are functional block diagrams showing the configuration of the present invention, Figures 2 to 6 show embodiments of the present invention, and Figure 2 is a perspective view of a word processor. Figure, 3rd
The block diagram of the word processor control system is shown in Figure 4 (
a) to 4 [1(b) are schematic flowcharts of spell check/candidate word search processing control routines, and FIGS. 5 and 6 are explanatory diagrams illustrating the configuration of word pair memories, respectively. 1. Word processor, 3. Keyboard, 10
...Liquid crystal display, 16...CPU, 17...
ROM (program memory), 18...ROM (
dictionary memory), 20...RAM. 24...word buffer, 26...word pair memory, C.
・Control device, DM...Display mechanism. Figure (a) Figure (b) Figure 4 (b) Figure 6

Claims (2)

[Claims] (1) An input means for inputting characters, symbols, and various commands, a display means capable of displaying a plurality of character strings, and a means for sequentially receiving word data input or stored in memory in advance. a word buffer for storing, a dictionary memory storing spelling information of a large number of words, a spell checking means for receiving word data from the word buffer and performing a spell check on each target word via the dictionary memory, and a spell checking means. Candidate word search means for searching a dictionary memory for a candidate word related to a misspelled word determined to be misspelled; Display control means for displaying the searched candidate word on a display means; and a desired candidate word from among the displayed candidate words. a word pair storage means for storing a candidate word selected by the selection means and a misspelled word in association with each other; a discriminating means for discriminating whether or not the target word is stored in the word buffer; and based on the discriminating result of the discriminating means, when the target word is stored as a misspelled word, the target word in the word buffer is associated with the misspelled word, and word pairing is performed. 1. A document processing device with a spell check function, comprising rewriting command means for rewriting with a candidate word stored in a storage means and for instructing a spell check means to stop spell checking the target word. (2) Each time a candidate word is selected by the selection means, the word pair storage means stores a word pair consisting of the candidate word and a misspelled word at the head position of the word pair storage means. A document processing device with a spell check function according to claim 1.