JPH0567078A - Word processor - Google Patents

Abstract

PURPOSE:To perform an automatic word deletion when the capacity of a device is full, to always enable the execution of the latest automatic word registration and to efficiently use a registered word dictionary by providing a means controlling the registering sequence of a registered word and a means deleting the registered word from the dictionary based on the registering sequence. CONSTITUTION:A control table stores the addresses of automatic registered words in a registered word dictionary and performs a old and new control by the positions in the table. When an automatic registration is performed of a new word, it is registered when an empty exists in the registered word dictionary. When the empty does not exists, the automatic registration is performed of the new word in the empty area after a processing that an oldest registered word is deleted is performed. Thus, as the automatic registrations are always performed of new words, the registered word dictionary can be efficiently used.

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 in particular, in a device having a function of converting a phonetic reading input with reference to a dictionary into a notation such as Kanji, the information in the dictionary can be easily updated. In addition, the present invention relates to a character processing device capable of converting an appropriate notation at high speed.

[0002]

2. Description of the Related Art Conventionally, in inputting Japanese, kana-kanji conversion is executed using a word dictionary that stores word reading, notation, part of speech, and connection information. There was a device that prepared a registered word dictionary for the user to newly register a word that was not in the word dictionary.

[0003]

Since the input of a word that does not exist in the word dictionary cannot be accurately converted into a kanji-kana mixed sentence, the user needs a word that is not in the dictionary and is registered in the dictionary by the user. There was a need. However, it is impossible to determine all the words that the user needs prior to input and determine if each is in the dictionary. Therefore, the user knows the word that needs to be registered when inputting. In order to register words here, input must be interrupted. On the other hand, if words are not registered there and input continues, the same word cannot be converted correctly when the same word is input again.

Therefore, the applicant of the present application has proposed a device capable of automatically registering a word (hereinafter referred to as automatic registration) when a word that does not exist in the word dictionary is input.

However, the capacity of the registered word dictionary is limited, and if automatic registration is continuously executed at the time of input,
Eventually, the registered word dictionary will fill up. Then, of course, it becomes impossible to execute automatic registration thereafter, and it becomes impossible to accurately convert the input of a word that is not in the dictionary thereafter.

The registered word dictionary in which the automatically registered words are stored also stores user registered words registered by the user himself. By performing the automatic registration, the user-registered word and the automatically registered word are stored together in the registered word dictionary. Since the automatic registration is continuously executed during the input operation, the registered word dictionary may be full regardless of the number of user registered words.
Subsequent user registration becomes impossible.

[0007]

SUMMARY OF THE INVENTION In order to solve the above problems, the present invention relates to a character processing apparatus which includes an input means for inputting characters and a written character string corresponding to the reading of words. Word dictionary means for storing word information, word reading means, word registration means for inputting the information of the word including a notation character string, and storing the word in the word dictionary means, and input by the input means A conversion unit for converting the Takana character string into a notation character string by referring to the word dictionary unit, and a notation character string different from the conversion result by the conversion unit for the Kana character string input from the input unit. When is selected, the kana character string is regarded as unreadable, and control means for controlling the information including the selected notation character string to be registered by the word registration means; Registered words Managing means for managing mechanism, for area reservation required for a new registration by the registration means, based on the registration order comprises a registered word deleting means for deleting the registered word from the dictionary means.

According to another aspect of the present invention, input means for inputting characters, and word dictionary means for storing information of the word including a written character string corresponding to the reading of the word, The first reading means for inputting the reading of the word and the information of the word including the written character string and storing it in the word dictionary means, and the kana character string input by the input means,
When a conversion means for converting to a notation character string with reference to the word dictionary means and a kana character string input from the input means, a notation character string different from the conversion result by the conversion means is selected. , Kana character string is unreadable,
Second registration means for registering information including the selected notation character string in the word dictionary means so as to be distinguishable from the word registered by the first registration means, and new information created by the first registration means. In order to secure an area required for registration, the dictionary means includes a registered word deleting means for deleting the word registered by the second registering means.

[0009]

[Operation] For the kana character string input by the input means,
When a notation character string different from the conversion result by the conversion means is selected, the control means controls such that the kana character string is unreadable and the information including the selected notation character string is registered by the word registration means. In order to secure an area required for new registration by the registration means, the registration order of the words registered under the control of the control means is managed by the management means.
The registered word deleting means deletes the registered word from the dictionary means based on the registration order. As a result, the area required for new registration is secured and the word that is not in the dictionary is registered without the user being particularly aware of the word registration.

Further, when the reading of a word and the information of the word including the written character string are input, the first registration means stores the information in the word dictionary means, and the kana character string input by the input means is input. On the other hand, when a notation character string different from the conversion result by the conversion means is selected, the kana character string is regarded as unreadable, and information including the selected notation character string is read by the second registration means. The word is registered in the word dictionary means so as to be distinguishable from the word registered by the first registration means. Then, in order to secure an area required for new registration by the first registration means, the registered word deletion means deletes the word registered by the second registration means from the dictionary means. As a result, the user does not have to worry about registering words,
A word that is not in the dictionary is registered, and by deleting the word thus registered, an area required for new user registration is secured.

[0011]

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

FIG. 1 shows 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
It transfers an address signal indicating a component to be controlled by the PU. The control bus CB transfers and applies the control signals of the respective components to be controlled by the microprocessor CPU. The data bus DB transfers data between the respective 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 12, 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.

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

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

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

TDIC is a registered word dictionary in which words can be registered in order to perform Kana-Kanji conversion.

GDIC is a learning data dictionary for storing learning data for kana-kanji conversion.

DBPOOL is a homophone candidate storage memory that stores information obtained by analyzing and converting YBUF readings into phrases.

YJPOOL works in conjunction with DBPOOL,
It is a memory for storing information on examples applied to the same phonetic word candidates.

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

FZTBL is an adjunct word string conversion table for associating an adjunct word with connection information stored in the DIC.

The KB is a keyboard, which is provided with various function keys such as an alphabet key, a hiragana key, a katakana key and other character symbol input keys, and a conversion key 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 is a memory for storing a fixed form document. The prepared document is stored, and the stored document is recalled 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.

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.

The following is an example of the process of registering a word in the dictionary (hereinafter referred to as automatic registration) when the word is converted into a word that is not in the dictionary, in the apparatus of this embodiment having the above-described configuration. 2 will be described.

(A) is the state of the CRT before characters are input. In the figure, 21 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 22 indicates that 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). After converting the first conversion result "Machine" to "Strange" by the next candidate conversion,
When the selection key is input, the conversion result is determined, word learning is executed, and as a result, the state of the CRT becomes as shown in (g). In this state, again, "ki", "ka",
When the character "i" is input and the conversion key is further input, the first conversion result becomes "strange" by word learning, and as a result, the state of the CRT becomes as shown in (i).

On the other hand, when the hiragana conversion key is input from the state of (b), the hiragana conversion is executed on the input character string, and as a result, the state of the CRT becomes as shown in (d). When the selection key is input in this state, the words of reading "kikai" and notation "kikai" are automatically registered. Furthermore, when the characters "ki", "ka", and "i" are input in the same manner and the conversion key is further input, it is converted into the automatically registered word "kikai", and as a result, the state of the CRT is changed. It becomes like (j).

The katakana conversion from the state of (b) is executed in the same manner as the hiragana conversion. As a result, the state of the CRT becomes as shown in (e), and the reading is "kikai" and the notation is "kikai".
Is automatically registered. Furthermore, in the same way, "ki",
When the characters "ka" and "i" are input and the conversion key is further input, the word is converted into the automatically registered word "kikai", and as a result, the state of the CRT becomes as shown in (k).

When the single-kanji conversion key is input from the state of (b), the single-kanji conversion is executed on the input character string, and as a result, the state of the CRT becomes as shown in (f).
In (f), among the input characters, "ki" is converted into "ki" as a single kanji character. By repeating the single-kanji conversion, "ki" is converted into "period", "kai" is converted into "kai", and "kikai" is converted into the notation "kai". When the selection key is input here, the conversion result is determined, and as a result, the state of the CRT becomes as shown in (h). At this time, the words of reading "kikai" and notation "meeting" are automatically registered. From this state, when the characters "ki", "ka", and "i" are input in the same manner and the conversion key is further input, the words are converted into the automatically registered word "kai", and as a result, the CRT The state is as shown in (l).

FIG. 3 is a diagram showing the structure of the registered word dictionary TDIC.

The registered word dictionary is composed of a header including a management number of the dictionary, a main body which is a set of registered words, and a management table for managing the automatically registered words. For each registered word, a reading, a notation, a part of speech, and a flag for discriminating between a registered word by the user and an automatically registered word are stored. The example in the figure is an automatically registered word whose reading is “kikai”, notation “kikai”, and part of speech “undetermined”. In this embodiment, the parts of speech of the automatically registered words are all "undetermined" as described above, but if the parts of speech can be easily inferred, the parts of speech may be registered.

FIG. 4 is a diagram showing the structure of the management table. The address of the automatically registered word in the registered word dictionary is stored. Old and new management is performed depending on the position in the table.

The operation of the above embodiment will be described with reference to the flowchart.

FIG. 5 shows the state of the CRT when the registered word dictionary list display is executed.

As described with reference to FIG. 3, inside the registered word dictionary TDIC, the automatic registered word and the user registered word are distinguished by a flag. Even in this list display,
Based on this information, the automatically registered word is displayed with a symbol “*” added to it so as to be displayed separately from the user-registered word registered by the user.

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 by the keyboard and an interrupt is awaited. When a key is input, the key is discriminated in step S6-2, and steps S6-3 and S6-
4, step S6-5, step S6-6, step S
6-7, step S6-8, step S6-9, step S6-10, step S6-11, step S6-1.
It branches to either step of 2.

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

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

Step S6-5 is a single Kanji conversion key TAN.
This is the process when is pressed, and the character string to be converted in kana-kanji stored in the YBUF input in step S6-3 is converted at the single-kanji level and output to the output buffer.

Step S6-6 is the hiragana conversion key HI.
This is the process when RA is pressed, and step S6-3
The character string to be converted into kana-kanji stored in YBUF is converted into hiragana notation and output to the output buffer.

Step S6-7 is the katakana conversion key KA.
This is the process when TA is pressed, and step S6-3
The character string that has been input by and is stored in YBUF, which is the target of kana-kanji conversion, is converted to katakana notation and output to the output buffer.

Step S6-8 is the next candidate conversion key NXT.
This is the process when is pressed, and another candidate of 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 the homophone in the output buffer displayed on the screen is fixed and the fixed character string is output in the document. Further, a process of learning the selected word is performed. Also, the single-kanji conversion process of step S6-5, the hiragana conversion process of step S6-6, and step S6-7
If the converted word does not exist in the dictionary due to the katakana conversion process of step 1, etc., this word is automatically registered.

Step 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.

In step S6-12, YOMI, CO
This process is performed when a key other than N, NXT, or 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, which is well known. There is no special description.

In step S6-13, as a result of the above processing,
This is a display process for updating and displaying the changed portion. 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 step 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 phrases and outputs candidates for Kana-Kanji conversion output 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.

Step S7-2 checks whether or not the analysis result output to the homophone pool in step S7-1 corresponds to the example pattern stored in the word dictionary. If an example pattern exists, a homonym candidate 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 candidates for 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 process of step S6-9.

In step S8-1, it is checked whether the selected notation for the input kana character exists in the word dictionary DIC or the registered word dictionary TDIC, and if it exists in the dictionary, the learning in step S8-3 is performed as it is. Execute the process.
If it does not exist in the dictionary, the learning process is executed after the automatic registration process of step S8-2 is executed. The learning process in step S8-3 is to learn the selected word and increase the priority of the word after that. 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 step S8-2.

In step S9-1, it is checked whether or not there is a vacant area in the registered word dictionary, and if there is, a step S9-2.
If not, the process branches to step S9-3 of deleting the oldest automatically registered word. After this process, step S9-3 is executed.
Return to 1. In step S9-2, it is checked whether or not there is a free area in the management table that manages the automatically registered words. If there is a free area, it is left as it is. Then, the process proceeds to step S9-5. Word registration is executed in step S9-5 in which it is confirmed that there is a free area. The management table is updated in step S9-6 when the registration is completed. The word registration process of step S9-4 is a process of newly registering a word in the registered word dictionary. The input kana character string is used as a word reading, and the selected and confirmed conversion result is used as a word notation.

FIG. 10 is a detailed flowchart of the process of deleting the oldest automatically registered word in steps S9-3 and 9-4.

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

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

In step S11-1, 1 is set in the counter variable i. In step S11-2, it is checked whether the address of the i-th automatically registered word exists in the management table. If it exists, the process branches to step S11-3, and the address in the registered word dictionary of the automatically registered word is obtained from the management table. In step S11-4, it is updated according to the current registered word dictionary. In step S11-5, the data is put into the management table. In step S11-6, i is updated and the process is moved to the next automatically registered word in the management table.

FIG. 12 is a detailed flowchart of the process of step S6-10.

In step S12-1, it is checked whether or not there is a free area in the registered word dictionary. If not present, step S
The process branches to 12-2 to check whether the automatically registered word can be deleted. If it is possible, the free word is created in the registered word dictionary by deleting it in step S12-3, and the process returns to step S12-1 again. If the word cannot be deleted, the process branches to step S12-5 to display that word registration is impossible. If it is confirmed in step S12-1 that there is a free area, word registration is executed in step S12-4.
Then, in step S12-6, the management table is updated.

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

Although the above embodiment has been described with respect to a single device, the present invention can be applied to a system composed of a plurality of devices and can also be realized by supplying a program to the device. Needless to say.

[0078]

As described above, according to the present invention, the latest automatic word registration can always be executed by executing the automatic registration word deletion when the capacity is full. Also, by managing the order of the automatically registered words, it is possible to use the registered word dictionary more efficiently. As a result, it is possible to build a kana-kanji conversion device that can more accurately convert the input and suits the user's purpose.

As described above, according to the present invention, it is possible to handle user-registered words and automatically registered words separately. Further, even if the registered word dictionary is full of automatically registered words, user registration is possible, and user registration can be prioritized over automatic registration.

[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 automatic registration is executed in kana-kanji conversion.

FIG. 3 is a diagram showing an example of the configuration of a registered word dictionary.

FIG. 4 is a diagram showing an example of the configuration of a management table of automatically registered words.

FIG. 5 is a diagram showing an example of a state in which a registered word list is executed.

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 illustrating an example of a processing procedure of automatic registration processing according to the present exemplary embodiment.

FIG. 10 is a flowchart showing an example of a processing procedure of the oldest 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.

FIG. 12 is a flowchart showing an example of a processing procedure of word registration processing by the user of the present embodiment.

[Explanation of symbols]

 CPU Microprocessor AB Address bus CB Control bus DB Data bus ROM Fixed memory RAM Random access memory DISK Document memory 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. An input means for inputting characters, a word dictionary means for storing the information of the word including a written character string corresponding to the reading of the word, and a reading dictionary of the word and a written character string. And a word registration means for storing the information in the word dictionary means for storing in the word dictionary means, and a conversion for converting a kana character string input by the input means into a written character string by referring to the word dictionary means. Means and a kana character string input by the input means, when a notation character string different from the conversion result by the conversion means is selected, the kana character string is regarded as unreadable and the selected notation Control means for controlling the information including the character string to be registered by the word registration means, management means for managing the registration order of the words registered by the control of the control means, and necessary for new registration by the registration means Territory A character processing device, comprising: a registered word deleting unit that deletes a registered word from the dictionary unit based on the registration order to secure a region. 2. An input means for inputting a character, a word dictionary means for storing the information of the word including a written character string corresponding to the reading of the word, and a reading dictionary of the word and a written character string. And a first registering means for storing the information of the word including the word in the word dictionary means and converting the kana character string input by the input means into a notation character string by referring to the word dictionary means. When a notation character string different from the conversion result by the conversion unit is selected for the conversion unit for converting and the Kana character string input by the input unit, the Kana character string is determined to be unreadable and is selected. Second registration means for registering, in the word dictionary means, information including the written character string so as to be distinguishable from the word registered by the first registration means; and a new registration means for the first registration means. In order to secure the area required for registration, Character processing apparatus characterized by having a registered word deleting means for deleting the words registered by the second registration means from a dictionary means.