JPS63311472A - Character processor - Google Patents

Abstract

PURPOSE:To improve the operability by displaying automatically a word to be brought to KANJI (Chinese character) conversion in the beginning by only inputting the reading of a word of a homonym thereafter, when the homonym has been selected once, and erasing automatically a learning data to be erased, by following up the end of a document. CONSTITUTION:A KANJI (Chinese character) which is selected by the first selecting means or the second selecting means from in homonyms is discriminated and stored in a storage means in accordance wit its selection, and at the time of selecting a homonym in the next time, the KANJI stored in this storage means is displayed on a display means. In this regard, among the KANJIs stored in the storage means, a deletion of the KANJI selected by the first selecting means is executed by a means for executing a deletion by an instruction of an instructing means. In such a way, an unnecessary learning data which is used for selecting the homonym can be deleted.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a character processing device having a learning function for converting a character string and determining a first candidate of notation for a homophone.

[Prior Art] Conventionally, as a character processing device that converts a character string, an operator inputs a reading and gives an instruction to convert a kanji,
A character processing device that converts readings into kanji, so-called kana-kanji conversion, has been realized.

Recently, in character string conversion using the above-mentioned devices, a so-called learning process is used to determine and display the first candidate preferentially based on the most recently selected word for multiple conversion candidates, such as homophones. It is widely used by processing equipment. Therefore, a character processing device that performs such learning processing is provided with a memory that stores information regarding kanji characters selected based on predetermined selection criteria as learning data.

In addition, this learning process includes displaying kanji that are frequently used, and kanji related to technical terms for each technical field as first candidates among homonyms.

[Problem to be solved by the invention] However, the contents of this memory do not allow the operator to grasp what is the first candidate for a homophone, and as the number of homophones selected increases, the memory becomes larger than the memory capacity. The problem was that the learning data could not be memorized.

SUMMARY OF THE INVENTION Accordingly, an object of the present invention is to provide a character processing device that can easily select and input homophones by effectively utilizing a limited memory capacity.

[Means for Solving the Problems] In order to solve these problems, the present invention provides a display means for displaying candidate kanji for selection when selecting homophones in kana-kanji conversion, and a display means. first and second selection means for selecting a desired kanji from among the candidate kanji displayed on the screen; a storage means for storing the kanji selected by the second selection means, the storage means for storing the kanji selected by the first selection means and the kanji selected by the second selection means; A control means for preferentially displaying the kanji stored in the means on the display means when selecting a next homophone, and an instruction to delete the kanji selected by the first selection means from among the kanji stored in the storage means. The present invention is characterized by comprising an instruction means and means for deleting the Kanji character selected by the first selection means from among the Kanji characters stored in the storage means in response to an instruction from the instruction means.

[Operation] According to the present invention, the kanji selected from the homonyms by the first selection means or the second selection means are stored separately in the storage means according to the selection, and the next homonyms are stored separately in the storage means. When selecting a word, the kanji characters stored in the storage means are displayed on the display means by the control means. It should be noted that since the deletion of the kanji selected by the first selection means from among the kanji stored in the storage means is carried out by the deletion means according to the instructions of the instruction means, unnecessary kanji used for the selection of homophones are deleted. learning data can be deleted.

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

FIG. 1 shows an example of the overall configuration of the present invention. In FIG. 1, C20 is a microprocessor that performs calculations, logical judgments, etc. for character processing, and controls each component connected to these paths via the address bus ^B, control bus CB, and data bus DB. Control elements.

Address bus AB transfers address signals indicating the components to be controlled by the microprocessor CPU. The control path C8 transfers and applies control signals for each component to be controlled by the microprocessor CPU. The data bus DB transfers data between each component device.

Next, ROM is a read-only fixed memory.

P^ is a program area in which control procedures etc. by the microprocessor CPU, which will be described later with reference to FIGS. 7 to 12, are stored.

Further, the RAM is a writable random access memory having a structure of 1 word and 16 bits, and is used for temporary storage of various data from each component.

TBUF is a document buffer, which is a memory area for storing document information converted into Kanji characters. The DIG is a memory area that stores a dictionary containing a reading and a table of kanji corresponding to the reading for performing kana-kanji conversion.

YBUF is the Kana person oyster located in B on the keyboard -KAN^
This is a memory area for storing the kana reading code input by the user. LRND is learning data, and is a memory area that stores word codes that mean learned words, ie words for which homophone selection has been made.

) ISTRY is a memory area that stores a learning data registration history list, and stores the storage index of words registered in the memory area LRND. WCOD is a memory area that stores a copy code that is the same as the word code registered in the memory area LRND.

i is a memory area that stores counter variables used by each program stored in the program area PA.
IMEMO is a memory area that stores the storage index of each word in the memory area LRND when a word is registered in the memory area LRND.

B is a keyboard, which includes character symbol input keys such as alphabet keys, hiragana keys, and katakana keys, as well as various keys for instructing various functions for this character processing device, such as a conversion key, a learning key, and a document editing end key. It has function keys.

In the figure, CON is the conversion key that instructs the selection of homophones, that is, conversion of kanji, as the first selection means, and ^N^ is the character symbol input key-1LR for inputting the reading.
N is a learning key that instructs learning and kanji conversion as a second selection means, and HDEND is a document editing end key that declares to end input editing processing.

The DISK is a memory such as a floppy disk for storing standard documents, and stores created documents, and the stored documents are called up by the microprocessor CPU when necessary by instructions from the keyboard. CR is a cursor register. The contents of the cursor register can be read and written by the CPU.

A CRT controller CRT, which will be described later, displays a cursor at a position on the display device CRT corresponding to the address stored here.

DBUF is display buffer memory, document buffer TB
Stores patterns such as document information stored in the UF.

CRTC is cursor register CR and buffer DBU
It plays the role of displaying the contents stored in F on the display CRT.

Further, a CRT is a display device using a cathode ray tube or the like, and the display of a dot configuration pattern and a cursor on the display device CRT is controlled by a CRT controller. Furthermore, CG is a character generator that stores patterns of characters and symbols to be displayed on the display device CRT.

In a character processing device made up of these various components, the keyboard operates in response to various inputs from the keyboard B. When human power is supplied from the keyboard KB, an interrupt signal is first sent to the microcontroller. The microprocessor CPU reads various control signals stored in a fixed memory ROM, and various controls are performed according to these control signals.

FIG. 2 shows the configuration of the dictionary DIC in the character processing device of the present invention. In FIG. 2, YF is a reading part, which stores the reading of a word up to a maximum of lθ characters in 2 bytes per character, and stores 0 in the remaining area. F is the kanji character part, which stores the notation of a word up to 4 characters each with 2 bytes, and stores 0 in the remaining area.

GF is a grammatical information section, used for learning, and stores grammatical information such as the part of speech of the word. LF is learnable judgment data, 1 for words that can be learned for homophones,
0 is stored for unlearnable hiragana character strings and words for kanji that have no homophones.

Each word consists of 31 bytes, and a word code for identifying the word is assigned from the beginning of the dictionary. For example, the variable W(i) means the first word from the beginning of the dictionary.

FIG. 3 shows the structure of the document data buffer TBUF. In FIG. 3, one character of document data is represented by two bytes.

O is stored as an uninput code.

FIG. 4 shows the configuration of the input reading code buffer YBUF. In Figure 4, on the keyboard there is a Kana-Kaki on B.
Stores the kana code that is output when ANA is pressed in 2 bytes per character.

FIG. 5 shows the configuration of the learning data memory area LRND.

In FIG. 5, the word codes of the learned words are stored in the memory area LRND in the form of a list, and the memory area LRND is composed of 2 bytes for one word.
It consists of 400 bytes for 00 words. In the initial state and in the remaining memory area, 0 is stored as a code meaning a non-existing word, and -1 (FFFF) is stored as a list end code at the end of the list.

FIG. 6 shows the configuration of the learning data registration history list area H5TRY.

In FIG. 6, memory area H5TRY is memory area L
This is a list for storing the index of the registered memory area LRND when registering a word code in RN[l, and consists of 2 bytes for 1491 words and 200 bytes for 100 words. initial state and remainder)
0 is stored in the area where the LRND index value does not exist, and -1 (FFFF) is stored as the list end code at the end of the list.

FIG. 7 is a flowchart showing the operation of the character processing device of the present invention. This control procedure is mainly performed by the microprocessor CPU.
Executed by

In step 57-1, key B is pressed on the keyboard and the CPU waits for an interrupt to occur in the microprocessor cPU.

When a key is input, the microprocessor CPU determines the input key in step 57-2, and branches to any one of steps 57-3 to 57-7 depending on the type of key.

Step 57-3 is a process performed when 8N^ is pressed on the kana key, and the input kana code is stored in the memory area YBtIF.

Step 57-4 is a process performed when the conversion key CON is pressed, and converts the pronunciation string stored in the memory area YBUF into a kanji string selected from the homonyms (see Figure 8 for details). (mentioned).

Step 57-5 is a process when the learning key LRN is pressed, and the word code stored in the memory area WCOD is stored in the learning data area LRND (11th
(detailed in the figure).

Step 57-6 is a process performed when the document editing end key EDEND is pressed, and it is assumed that the document input has ended, and the learning data automatically learned by the conversion process is invalidated (see Fig. 12). (details in ).

Step 57-7 is the Kana key KANA, the conversion key CO
N.

This is a process that occurs when a normal key (such as a cursor movement key) other than the learning key LRN and the document editing end key is pressed. Therefore, I will not specifically describe it.

Step 57-8 is a display process for displaying the portion changed as a result of the above editing process. Document buffer TBU
The data in the document stored in F is transferred to the microprocessor C.
This is a commonly used process in which the PU reads one character, develops it into a pattern, and outputs it to the display buffer DBUF.

FIG. 8 is a detailed flowchart of the learning data registration process performed by pressing the conversion key in step 57-4.

In step 58-1, the microprocessor cpu
is the dictionary DIC according to the memory contents of the input reading string YBUF.
Search for.

In step 58-2, as a result of the dictionary search, YBI
The microprocessor CPU determines whether or not a reading that matches the memory content of JF is found, and if it is found, the 58
-3, and if not found, branches to 58-13. Then, in step 58-3, the word code of the found word is stored in the memory area WCOD.

If no word is found, the contents of the buffer YBUF are output as they are to the document buffer TBUF in step S8-13, and the processing in step 57-4 is ended.
The process returns to step S7.

In step 58-4, the microprocessor CPU searches whether the same word as the word stored in the memory area W(:OD) exists in the memory area LRND.

In step 58-5, it is determined whether the same word code as in the memory area wcoo is found in the memory area LRND. If found, the process branches to step 58-11; if not, the process branches to step 58-6.

In step 58-8, the memory DIC determines whether there is the next kanji word for the same reading in the buffer YBtlF.
Search for. In step 58-7, buffer YB
It is determined whether the next word with the same reading as UF has been found, and if found, the process proceeds to step 58-3;
Otherwise, the process branches to step 58-8.

In step 58-8, the microprocessor CPU determines whether the word stored in the memory area wcoo is learnable by referring to the learnability determination data (LF in FIG. 2) of the word. If it is determined that learning is possible, the process branches to step 58-9, and if it is determined that learning is not possible, the process branches to step S8-12.

The words determined to be learnable are registered in the word code in the memory area LRND in step 58-9, and are further stored in the history data area H5TR in step S8-10.
The index of the word in the memory area LRND is stored in Y.

In step S8-12, the found word WCOD
After setting the notation code to the document buffer TBUF,
Return to step 57-8.

In step S8-11, the notation code of the word code found in the memory area LRND is transferred to the document buffer TB.
Set it to UF and return to step 57-8.

FIG. 9 shows step 58-9 and step 511-12.
3 is a detailed flowchart of the learning data registration process of FIG.

In step 59-1, the counter variable i is set to an initial value O
Set.

In step 59-2, it is determined whether the value represented by the variable LRND (i) is the list end code FFFF using the variable i as an index, and if the list end is detected, the program immediately returns to the program shown in FIG. However, if not, the processing from step 59-3 onwards is performed.

In step 59-3, the microcomputer CPU determines whether the value represented by the variable LRND (i) is an unset value of 0 or not. If the variable LRND (i) is an unset value O, the process branches to step 59-5; otherwise, the process branches to 59-4.

In step 59-4, the counter variable i is incremented by 1, and step 59-2 is returned.

In step 59-5, the value indicated by the variable LRND (i) is replaced with the value in the memory area WCOD.

In step 59-6, the value of counter variable i is stored in the memory area IMEMO, and then the process returns.

FIG. 1θ is a detailed flowchart of the history data registration process of step 58-10.

In step 510-1, an initial value O is set to a counter variable i.

In step 51G-2, it is determined whether the value represented by the variable H5T(i) is the list end code FFFF using the variable i as an index, and if the list end is detected, the process returns immediately; For example, the learning possibility determination processing from step 510-3 onwards is performed.

In step 510-3, it is determined whether the value represented by the variable H5T(i) is an unset value of 0, and if the value represented by the variable H5T
(1) is the unset value 0, step 510
-5, otherwise branch to step 51G-4.

In step 5IO-4, counter variable i is incremented by 1, and step 510-2 is returned.

In step 510-5, the value indicated by the variable H5T (i) is replaced with the memory area IMEMO value, and then the process returns.

FIG. 11 is a detailed flowchart of the process of registering learning data by pressing the learning key in step 57-5.

In step 511-1, a counter variable i is set to an initial value of 0.

In step 5ll-2, it is determined whether the value represented by variable LRND (i) is the list end code FFFF using variable i as an index, and if a list end is detected, the process proceeds to step 5ll-12. Otherwise, the process from step 5ll-3 onwards is performed.

In step 5ll-3, it is determined whether the value represented by the variable LRND (1) matches the wcoo value, and if they match, the process proceeds to step 511-5; otherwise, the process branches to 511-4. .

In step 511-4, the counter variable l is incremented by 1, and step 511-2 is returned.

In step 511-5, the value indicated by variable i is stored in the memory area IMEMO.

In step 511-6, the learning data registration list)
In order to search for ISTRY, the counter value i is set to an initial value of 0.

In step 511-7, it is determined whether the value represented by the variable H5T (i) is the list end code FFFF using the variable i as an index, and if the list end is detected, the process proceeds to step 511-12. If not, the process from step 511-8 onwards is performed.

In step 5ll-8, it is determined whether the value represented by the variable H5T (i) matches the value in the memory area IMEMO. If they match, the process proceeds to step 5ll-10; otherwise, step 5ll- Branch to 9.

In step 511-9, the counter variable i is incremented by 1, and the process loops to step 511-7.

In step 511-10, in order to make variable H5T (i) unused, variable H5T(1) is set to O, and in step 511-11, learning registration history H5T
Allocate RY.

In step 511-12, memory area 11COD
The word code shown in is set in the memory area LRND (same as in FIG. 9).

FIG. 12 is a detailed flowchart of the learning invalidation process at step 57-6, which functions as a deletion means.0 A code signal generated by the document editing end key EDEND is detected by the microprocessor CPIJ as a deletion instruction signal. Then, in step 512-1, the counter variable l is set to an initial value of 0.

In step 512-2, it is determined whether the value represented by variable H5T (i) is the list end code FFFF using variable i as an index, and if the list end is detected, the process proceeds to step 512-6; If not, the process from step 512-3 onwards is performed.

In step 512-3, the value of the memory area LRND expressed as the index of the value of the variable H5T(i): LRND(H5T(i)) is replaced with an unset value O.

In step 512-4, the variable H5T (i) is set to an unset value O.

In step 512-5, the counter variable i is incremented by 1, and the process returns to step 512-2.

In step 512-8, the data in the memory area LRND is searched, and if an unset value O exists between the LRND data (values from 1 to FFFF), that part is filled and allocated (rewritten); Return.

In the explanation of this embodiment, it is assumed that the dictionary structure is a dictionary with a fixed word length, but the same processing can be performed even if the dictionary structure is a more compressed dictionary structure composed of variable length words. be able to.

Moreover, although word codes, which are serial numbers from the beginning of the dictionary, are used as the data used as learning data, the notation codes of the words themselves may be used.

Furthermore, as the timing for initializing the learning data, we set a single key, the key that instructs the end of document m collection, but in addition to this key, there are also documents! The same function may be assigned to a plurality of keys, such as a key that indicates the end of the Ji collection, for example a print instruction key, and a key that instructs to record the created document in an external storage device.

Next, the operation of this embodiment will be explained using specific key operations as an example.

When the operator inputs the reading of the kanji in B on the keyboard, steps 57-1 → 57-2 → 57-3 → 57- in FIG.
The input readings are displayed on the display device CRT in the order of 8.

Next, when the operator presses the conversion key at B on the keyboard, steps 57-1 → 57-2 → 57-4 (8th
The input readings are converted into kanji in the order of (detailed procedure shown in the figure) → 57-8, and the kanji-converted characters are displayed on the display device CRT.

At this time, when there is a selection of homophones, the operator uses a next candidate key (not shown) to display the desired kanji in sequence on the display device CRT. When the desired kanji is found and the operator presses the conversion key CON to convert the kanji,
The control procedure of FIG. 9 is executed in the order of steps 57-1→57-2→57-5, and the selected kanji is automatically registered in the memory LRND as learning data regarding homophones.

However, this automatically registered learning data is automatically deleted after editing the document. If you want to keep the learning data, press the learning key described later to instruct kanji conversion.

Next, when the operator manually reads the homonyms already registered in the memory LRND, step 57
The process proceeds from -1→57-2→57-4 to the control procedure shown in FIG. 8, and the kanji characters stored in the memory LRND are automatically selected and displayed on the display device CRT.

Therefore, by selecting a homophone once, the operator does not need to select a homophone for the registered kanji from the second time.

Note that the learning data to be registered is stored in the memory LRND, and attribute information indicating that this learning data is to be stored in the memory LRND is stored in the memory H5T. The contents of this memory (IST) are used to erase learning data registered by the operator himself.

Note that when the learning key LRN is pressed during the kanji conversion of a homophone, the learning data is stored in the learning data LRND after processing for leaving it in the memory LRND is performed in the control procedure shown in FIG. After that, the input reading is converted to the selected kanji.

Through these processing steps, the input reading is converted into kanji, and the document creation is completed. When the operator presses the key EDEND to instruct the end of document creation, the control procedure shown in FIG. 12 is executed, and only the learning data designated for deletion by the attribute information stored in the memory H5T is deleted from the memory LRND.

As explained above, according to the present invention, once a kanji is selected from among homonyms, from the second time onwards, there is no need for ``selection process'' of homonyms, and the first kanji that is displayed is simply selected.
All you have to do is instruct the conversion of the candidate kanji.0 To convert the selected kanji to another kanji, just use the next candidate key to display another candidate kanji as before, then press the conversion key CON. The selected Kanji becomes the next first candidate Kanji. Furthermore, since the selected kanji (learning) data that does not need to be retained is automatically deleted after document processing, the capacity of the memory for storing learning data can be made smaller than in the past.

Furthermore, when performing invalidation processing (deletion processing) of learning data, overflow of the memory LRND can be prevented by counting the number of learning data stored in the memory LRND and displaying the counting result on a display device. It is possible and
The operator can know the number of learning data stored in the memory, and can also organize the learning data.

Furthermore, in this embodiment, an example was shown in which learning data is deleted after document creation is completed, but new learning data in a document is stored in a memory separate from the memory LRND, and this data is stored as learning data. The learning data to be registered may be extracted from the memory and re-registered in the memory LRND.

[Effects of the Invention] As is clear from the above explanation, according to the present invention, once a homophone is selected during document creation, from then on, simply by inputting the pronunciation of this word, it is possible to convert it into kanji first. Since the words are automatically displayed, the operator does not have to select homophones, which not only makes key operations easier, but also allows the selected kanji to be saved as learning data after the document is created. , it becomes possible to erase the learning data, and the memory that stores the learning data can be used effectively. Furthermore, since the learning data to be deleted is automatically deleted upon completion of the document, it is possible to reduce the unnecessary effort of the operator to delete the data each time.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an example of the configuration of the present invention. FIG. 2 is an explanatory diagram showing an example of the memory configuration of the dictionary DIC of the present invention. FIG. 3 is an example of the memory configuration of the document data buffer TBUF of the present invention. FIG. 4 is an explanatory diagram showing an example of the memory configuration of the manual reading buffer YBtlF of the present invention. FIG. 5 is an explanatory diagram showing an example of the memory configuration of the learning data memory LRND of the present invention. The figure is an explanatory diagram showing an example of the memory configuration of the learning data history list of the present invention, and Figures 7 to 12 are flowcharts showing examples of control procedures of the microprocessor CPU in the embodiment of the present invention. CPU: Microprocessor, RAM: Random access memory, CRT: Display device.

Claims (1)

[Claims] 1) Display means for displaying candidate kanji for selection when selecting homophones in kana-kanji conversion; and for selecting a desired kanji from among the candidate kanji displayed on the display means. first and second selection means; storage means for storing the kanji selected by the first and second selection means, the kanji selected by the first selection means and the second selection; a storage means for distinguishing and storing the kanji selected by the storage means; a control means for preferentially displaying the kanji stored in the storage means on the display means when selecting a homonym next time; an instruction means for instructing the deletion of the kanji selected by the first selection means from among the stored kanji; and the first selection means from among the kanji stored in the storage means in response to an instruction from the instruction means. 1. A character processing device comprising means for deleting a kanji selected by. 2) The deletion means is configured to delete the kanji selected by the first selection means from among the kanji stored in the storage means when the end of document creation is instructed. A character processing device according to claim 1.