JPH05135017A - Method for processing character and device therefor - Google Patents

Abstract

PURPOSE:To select a desired description from the next candidate of KANA (Japanese syllabary)/KANJI (Chinese character) conversion and to enable KANA /KANJI conversion with high operability by registering plural unknown words with the same reading on an unknown word learning dictionary. CONSTITUTION:As a microprocessor, a CPU executes calculation and logical judgement, etc., KNAJI for processing characters. When an input is supplied from a keyboard KB, first of all, an interrupt signal is sent to the microprocessor CPU, the microprocessor CPU reads the various control signals stored in a ROM and according to those control signals, the various kinds of control are executed. The unknown word learning dictionary is composed of a header including the management numbers, etc., of the dictionary, main body as the set of unknown words, and management table for managing the unknown words, and stores reading, description and part of speech concerning each registered unknown word. Then, the unknown word learning means executes additional registration even when the unknown word with the same reading as that of the unknown word to be newly registered is already registered on the unknown word learning dictionary.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to Japanese language processing, and more particularly to a processing apparatus for creating a correct sentence in Kana-Kanji conversion.

[0002]

2. Description of the Related Art Conventionally, in inputting Japanese, kana-kanji conversion is performed using a word dictionary that stores word readings, notations, and parts of speech. As a result of kana-kanji conversion, there may be a plurality of words, which are generally called homophones, having the same pronunciation but different notations. Then, a word selected by the user among the homonyms is stored as learning, and a learning process is performed that is uniquely determined in the homonyms at the time of the next kana-kanji conversion. For unknown words that are not registered in the word dictionary, learning is performed by newly registering unknown words.

[0003]

However, in the conventional learning process, in order to uniquely determine a word, only at most one kind of words having the same reading is learned. If you want to use several types of notation with the same reading for an unregistered word, you must create an unlearned notation by some conversion operation each time, or register it by the user's word registration operation. Instead, the input work was interrupted.

[0004]

The present invention eliminates the above-mentioned drawbacks of the prior art. In order to solve the problems, at least unknown word learning means for learning reading and notation of unknown words and unknown words are known. The unknown word learning means has a learning dictionary for registering words, and the unknown word having the same reading as the newly registered unknown word is added to the learning dictionary even if the unknown word is already registered in the learning dictionary. You can have multiple notation of unknown words, and you can build a kana-kanji converter that suits your purpose.

[0005]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to the drawings.

FIG. 1 is an example of the overall configuration of the present invention.

In the configuration shown in the figure, the CPU is a microprocessor, which performs arithmetic operations for character processing, logical judgments, etc., an address bus AB, a control bus CB,
The respective components connected to those buses are controlled via the data bus DB.

The address bus AB is a microprocessor C
An address signal for instructing a component to be controlled by the PU is transferred. The control bus CB transfers and applies a control signal of each constituent element to be controlled by the microprocessor CPU. The data bus DB transfers data between the constituent devices.

The ROM is a read-only fixed memory. PA is a program area in which control procedures by the microprocessor CPU, which will be described later with reference to FIGS. 6 to 13, are stored.

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 constituent element.

The TBUF is a document buffer, which is a memory for storing the document information input from the keyboard KB.

YBUF is an input reading buffer memory for storing readings input from the keyboard KB.

The DIC is a word dictionary for performing Kana-Kanji conversion.

The TDIC is an unknown word dictionary in which unknown words can be registered in order to learn unknown words that are not registered in the dictionary.

The GDIC is a learning data dictionary that stores the latest learning of kana-kanji conversion.

DBPOOL is a homophone pool that stores candidates for Kana-Kanji conversion.

LRNDAT is a learning data storage memory that stores learning states of individual words and examples.

KB is a keyboard, which is provided with various function keys such as alphabetic keys, hiragana keys, katakana keys and other character and symbol input keys, and conversion keys for instructing conversion.

In FIG. 1, YOMI is a key for inputting a reading, CON is a conversion instruction key for converting the input reading, NXT is a next candidate conversion instruction for changing a conversion candidate and converting it to a next candidate. Key, SEL is a selection key for confirming the current homophone display candidate and learning the candidate notation at the same time, HIRA is a hiragana conversion key for confirming the input reading in hiragana notation, and KATA is the input reading. A katakana conversion key that is determined by katakana notation, TAN is a single-kanji conversion instruction key for converting the input reading at the single-kanji level.

DISK stores a document created in a memory for storing a fixed form document, and the stored document is called when necessary by a keyboard instruction.

CR is a cursor register. The CPU can read and write the contents of the cursor register. The CRT controller CRTC, which will be described later, displays a cursor at a position on the display device CRT for the address stored here.

DBUF is a display buffer memory, and TB
The pattern such as document information stored in the UF is stored.

The CRTC plays a role of displaying the contents stored in the cursor register CR and the buffer DBUF on the display CRT.

Further, the CRT is a display device using a cathode ray tube or the like, and the display of the dot configuration pattern and the cursor on the display device CRT is controlled by the CRT controller.

Further, CG is a character generator, which stores patterns of characters and symbols to be displayed on the display device CRT.

The character processing device of the present invention comprising the above-described components operates in response to various inputs from the keyboard KB, and when an input from the keyboard KB is supplied, an interrupt signal is first sent. Sent to the microprocessor CPU, which microprocessor CP
U reads out various control signals stored in the ROM,
Various controls are performed in accordance with those control signals.

An example in which unknown word learning is executed in the apparatus of the present embodiment having the above-mentioned configuration will be described below with reference to FIG.

(A) is a state of the CRT before characters are input. In the figure, (q) indicates a cursor.

In this state, when the characters "ki", "ka", and "i" are input, the state of the CRT becomes as shown in (b). The underline indicated by (r) indicates a state where the kana-kanji conversion result has not been determined.

When the conversion key is input from the state of (b), kana-kanji conversion is executed on the input character string, and as a result, the state of the CRT becomes as shown in (c). When the conversion key is subsequently inputted, the next candidate notation is displayed on the monitor section (s) at the bottom of the screen, and the corresponding numerical key is inputted to select the candidate. If the Katakana conversion key is entered while the Kana-Kanji conversion result has not been finalized, it will be converted to Katakana notation that corresponds to reading, as shown in (e),
When the selection key is input, unknown words such as reading "kikai" and notation "kikai" are learned, and the notation is fixed by "kikai". As a result, the state of the CRT becomes as shown in (f). In this state, input "Kikai" again, and if converted, it will be converted into "Kikai" with unknown words learned as in (g), (h), and (i), and in the notation of the next candidate as in (j). The registered unknown word "Kikai" appears. When the katakana conversion key is further input, the characters at the end of the katakana converted as shown in (k) are converted into hiragana characters one by one. When the selection key is input in this state, the unknown word of the reading "kikai" and the notation "kikai" is additionally registered in addition to "kikai". Furthermore, in the same way, "ki", "ka",
When the character "i" is input and the conversion key is further input, "quick" is converted by unknown word learning, and as a result, the state of the CRT becomes like (o), and in the next candidate notation Two unknown words coexist, “quick” and “kikai”.

FIG. 4 is a diagram showing the structure of the unknown word learning dictionary TDIC.

The unknown word learning dictionary is composed of a header including a management number of the dictionary, a main body which is a set of unknown words, and a management table for managing the unknown words. Reading, notation, and part of speech are stored for each registered unknown word. The example in the figure is an unknown word whose reading is "kikai", notation "kikai", and part of speech "noun".

FIG. 5 is a diagram showing the structure of the management table. Stores the address in the unknown word dictionary. Old and new management is performed depending on the position in the table.

The operation of the above embodiment will be described according to the flow.

FIG. 6 is a flow chart showing the operation of the character processing apparatus of the present invention.

In step S6-1, a key is pressed on the keyboard and an interrupt is awaited. When a key is input, the key is discriminated in S6-2, and depending on the type of key, S6-3, S6-4, S6-5, S6-6, S6-7,
S6-8, S6-9, S6-10, S6-11, S6-
It branches to any of 12 steps.

Step S6-3 is a process when the reading input key YOMI is pressed, and the code of the pressed reading is stored in the input reading buffer memory YBUF.

S6-4 is a process when the conversion key CON is pressed, and the character string which is input in S6-3 and stored in YBUF and which is the target of kana-kanji conversion is converted into kanji and output. Output to buffer. When converting to kanji, the learning data dictionary is referenced to determine the first candidate of the homophone.

Step S6-5 is the processing when the single-kanji conversion key TAN is pressed, which is input in step S6-3 and YBUF is entered.
The character string to be converted into kana-kanji stored in is converted at the single-kanji level and output to the output buffer.

Step S6-6 is the processing when the hiragana conversion key HIRA is pressed, and is input in step S6-3 and YB
The character string to be converted into kana-kanji stored in the UF is converted into hiragana notation and output to the output buffer.

Step S6-7 is the processing when the Katakana conversion key KATA is pressed, and it is input in S6-3 and YB
The character string to be converted into kana-kanji stored in the UF is converted into katakana notation and output to the output buffer.

Step S6-8 is a process when the next candidate conversion key NXT is pressed, and another candidate for the same word in the output buffer output in step S6-4 is displayed.

Step S6-9 is a process when the selection key SEL is pressed, and determines the homophone in the output buffer displayed on the screen and outputs the determined character string in the document. Further, a process of learning the selected word is performed.

S6-10 is a process when the registration key TOR is pressed, and the word designated by the user is registered in the registered word dictionary TDIC.

Step S6-11 is a process when the list key LST is pressed, and a list of registered words in the registered word dictionary TDIC is displayed.

S6-12 is YOMI, CON, NX
This is a process when a key other than T and SEL (for example, a key used for document editing such as a cursor movement key) is pressed, and is a process generally performed in a character processing device of the same type, and is known. No particular description.

S6-13 is a display process for displaying the changed part as a result of the above process. This is a widely-used process of reading one character of data in a document, developing it into a pattern, and outputting it to a display buffer.

FIG. 7 is a detailed flowchart of the process of S6-4.

Step S7-1 is a process of analyzing a character string to be subjected to Kana-Kanji conversion that is input after being segmented into bunsetsu units and outputting candidates for output of Kana-Kanji conversion to the homophone word pool. This is a process for extracting character strings in sequence into punctuated units, searching the word dictionary for analysis, and outputting only candidates that are recognized as syllables to the homophone word pool. Since the processing is generally performed and is well known, it will not be described here.

In step S7-2, the analysis result output to the homophone word pool in step S7-1 is checked to see if there is an example pattern stored in the word dictionary. For example, the candidate of the homophone that is the target of the example is picked up as a priority candidate.

In step S7-3, the first candidate for kana-kanji conversion is determined from the priority candidates picked up in step S7-2 and the candidates for which words have been learned.

Step S7-4 is a process for displaying the output of the Kana-Kanji conversion stored in the output buffer, which is a process generally performed in a character processing device of the same kind, and it is well known and will not be described here.

FIG. 8 is a detailed flowchart of the processing of S6-9.

In S8-1, if the selected notation exists in the dictionary, the learning process of S8-3 is executed as it is. If it does not exist in the dictionary, the unknown word registration process of S8-2 is executed, and then the latest use learning process is executed in S8-3. S8-
The latest usage learning process 3 is to learn the selected word and increase the priority of the word after conversion.
After the learning process is completed, a confirmation process for confirming a homonym is performed. The learning process is to update the learning data corresponding to the word existing in the dictionary or the registered word, is a process generally performed in the character processing device of the same kind, and is known, and therefore will not be particularly described.

FIG. 9 is a detailed flowchart of the process of S8-2.

In S9-1, it is checked whether or not there is a free space in the unknown word dictionary, and if there is no free space, the process branches to the process of deleting the oldest registered unknown word. In S9-2, it is checked whether or not there is a free area in the management table that manages the registered unknown word, and if there is no free area, the process branches to the processing of deleting the oldest registered unknown word. If it is confirmed that there is a free area, unknown word registration is executed in S9-4. The management table is updated in S9-5 after the registration is completed. S9-
4 is a process of registering a new word in a dictionary, which is the same as the process generally performed as a user's word registration process, and is a process generally performed in a character processing device of the same type, which is well known and is particularly described. do not do.

FIG. 10 is a detailed flowchart of the processing of S9-3.

Step S10-1 is a process for retrieving the oldest registered unknown word from the management table. S10-2 is a process of deleting the registered registered unknown word from the unknown word dictionary. S10-3 is a process of updating the management table when the deletion is completed.

FIG. 11 is a detailed flowchart of the processing of S9-5 or S10-3.

In S11-1, the counter variable i is set to 1. In S11-2, it is checked whether or not the address of the i-th unknown word exists in the management table. If present S11-
It branches to 3 and gets the address of the unknown word in the unknown word dictionary from the management table. In S11-4, it is updated in accordance with the current unknown word dictionary. Put in the management table in S11-5. In step S11-6, i is updated and the process is moved to the next unknown word in the management table.

(Other Embodiments) In the above description, the old and new management of the registered unknown words is performed by the management table storing the addresses in the unknown word dictionary, but depending on the actual position stored in the unknown word dictionary. You can also manage old and new. It is also possible to manage the stored words themselves by having old and new management information. Further, it is also possible to manage according to the usage status by updating the management information every time the unknown word once registered is used for conversion.

The present invention is applicable not only to a single device but also to a system composed of a plurality of devices.
It goes without saying that it can be realized by providing software to the device or system.

[0063]

As described above, according to the present invention, it is possible to select a desired notation from the next candidates for kana-kanji conversion by registering a plurality of unknown words having the same reading in the unknown word learning dictionary. It is possible to realize Kana-Kanji conversion with excellent operability, and it is possible to build a Kana-Kanji conversion device that suits the user's purpose.

[Brief description of drawings]

FIG. 1 is a block diagram showing the overall configuration of a character processing device of this embodiment.

FIG. 2 is a diagram showing an example in which unknown word learning in kana-kanji conversion is executed.

FIG. 3 is a diagram showing an example in which unknown word learning in kana-kanji conversion is executed.

FIG. 4 is a diagram showing an example of a configuration of an unknown word dictionary.

FIG. 5 is a diagram showing an example of a configuration of a management table of an unknown word dictionary.

FIG. 6 is a flowchart showing an example of the processing procedure of the entire operation of this embodiment.

FIG. 7 is a flowchart showing an example of the processing procedure of the entire Kana-Kanji conversion according to the present embodiment.

FIG. 8 is a flowchart illustrating an example of a processing procedure of selection processing according to the present exemplary embodiment.

FIG. 9 is a flowchart showing an example of a processing procedure of unknown word registration processing of the present embodiment.

FIG. 10 is a flowchart showing an example of a processing procedure of oldest unknown word deletion processing of the present embodiment.

FIG. 11 is a flowchart illustrating an example of a processing procedure of management table update processing according to the present embodiment.

[Explanation of symbols]

 CPU Microprocessor DIC Kana-Kanji conversion dictionary ROM Read-only memory RAM Random access memory TBUF Document buffer YBUF Input reading buffer DIC word dictionary TDIC registered word dictionary GDIC learning data dictionary DBPOOL homophone pool LRNDAT learning data storage memory DISK external storage PRT printing device KB Keyboard CR Cursor register DBUF Display buffer memory CRTC CRT controller CRT display CG Character generator

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Kazuyo Ikeda 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc.

Claims (2)

[Claims] 1. For reading a word, at least for the word dictionary means that stores information of the word including a notation character string and an unknown word that is not registered in the word dictionary means, It has an unknown word learning means for learning notation and a learning dictionary means for storing learning information by the unknown word learning means, and the unknown word learning means has the same unknown reading as the newly read unknown word. A character processing device characterized in that a word is additionally registered even if the word is already registered in the learning dictionary means. 2. A character processing apparatus comprising a word dictionary storing information of a word including a written character string for reading a word, at least for an unknown word not registered in the word dictionary means. Character processing characterized by learning and storing the reading and notation of an unknown word, and additionally registering an unknown word with the same reading as the newly registered reading of the unknown word even if it has already been registered Method.