JP3382257B2 - Character processing apparatus and method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing apparatus for inputting a Japanese sentence and converting it into Kanji to input a Japanese sentence.

[0002]

2. Description of the Related Art The mainstream input method of a character processing apparatus for inputting Japanese is kana-kanji conversion. Kana-Kanji conversion is a method that converts input readings into Kanji based on a built-in dictionary, but the built-in dictionary contains only common words in Japanese, words in special fields, operator coined words, etc. Is not included. Therefore, word registration is an essential function in the input method using Kana-Kanji conversion. However, in the word registration in the conventional device, the part of speech of the registered word is generally limited (for example, only a noun).
The reason that only part of the part of speech can be registered is to facilitate the process, but it is not possible to register an arbitrary word. Therefore, it is necessary to be able to register general parts of speech.

For example, the five-step utilization of "bug ru" is quite commonly used by some information processing engineers, but such a word cannot be registered in the conventional apparatus. If you want to register "bugru" in the word registration dictionary with the conventional device, you have to register all the inflected forms from the probable form "bug et al." To the imperative form "bugre" as nouns. To do.

In fact, in consideration of such a point, there has been proposed a device capable of registering a word of a general part of speech (for example, a verb).

In such an apparatus, when registering a word,
Ask the operator to specify reading, notation, and part of speech. For example, in the case of "Bugru", the word is registered by designating the reading "Baguru", the notation "Bugru", and the part-of-speech "Five verbs".

[0006]

However, even if the operator specifies the part of speech and registers the word, it is uncertain whether the specified part of speech can be converted as intended by the operator. In other words, even if the operator had a hard time registering a word, it might not be converted at all if it was converted by another use. This is because "part of speech" is an unfamiliar concept to the general public, and is likely to be specified incorrectly.

As an example, consider a case where the word "beautiful" is registered as a word. It is assumed that when registering a word to be used, a rule is set to specify the final form.
Even if the operator mistakenly registered the word "pretty" as an adjective, where it should have been an adjective verb,
In the conventional device, when the word is registered, it cannot be confirmed whether it is registered correctly.

In this case, "Kirekarou" and "Kureikaru"
It will be recognized that it will be used, and the operator's desired "clean" and "clean" will not be converted. That is, when the word "beautiful" registered by the operator is used as a candidate for kana-kanji conversion, there is a problem that it cannot be used as an adjective verb.

In the above example, in order for the registered word to be converted as desired by the operator, it must be registered as an adjective verb.

In order to register a word having such a complicated part of speech, it is necessary to confirm whether or not the newly registered word (particularly the part of speech) is in line with the true intention of the operator. There was no such device.

[0011]

According to the present invention, in order to solve the above-mentioned problems, a character processing device allows a dictionary in which word readings, notations and parts of speech are stored in association with each other, and each part of speech is allowed. A check table in which one or more combinations of endings and endings of stems are associated with utilization lines corresponding to the combination, and an inflection table in which inflectional endings in each inflectional form are stored for combinations of part-of-speech and inflectional lines And a conversion means for converting the input reading into a notation while referring to the dictionary, and a word registration means for registering the reading, the notation and the part of speech designated by the operator as a new word in the dictionary. And if the specified part of speech has an inflection,
Prior to registration by the word registration means, the check table is searched, and based on the part of speech and the ending and ending of the stem in the new word, whether or not the part of speech is appropriate and a utilization line when appropriate. Determination means for determining
When the judging means judges that it is not appropriate, the notifying means for notifying an error, and when the judging means judges that the specified part of speech is appropriate, the part of speech and the judging means judge. An inflection ending search means for searching the inflection ending in each inflection form from the inflection ending table based on the inflection endings obtained, and an inflection in each inflection found by the inflection ending search means in the stem of the new word Utilization example display means for creating and displaying the utilization examples respectively connected. According to another aspect of the present invention, a dictionary is stored that associates word reading, notation, and part of speech in association with each other, and for each part of speech, one or more combinations of the end of the stem and the end of the word, It is input to the character processing method in the character processing device provided with a check table in which the utilization lines corresponding to the combination are associated with each other, and an utilization ending table that stores the utilization endings in each inflection for the combination of the part of speech and the utilization line. As a new word, a conversion step of converting the reading to the notation while referring to the dictionary, and associating the reading, the notation, and the part of speech designated by the operator with each other,
When the word registration step of registering in the dictionary and the designated part-of-speech have practical use, prior to registration by the word registration step, the check table is searched, and the part-of-speech and the end of the stem in the new word and Based on the word ending, a determination step of determining whether or not the part of speech is appropriate and an inflection line when it is appropriate, and an informing step of informing an error when it is determined as not appropriate in the determination step,
When the designated part-of-speech is judged to be appropriate in the judgment step, the utilization of searching the inflection in each inflection from the inflection table based on the part-of-speech and the inflection line judged in the judgment step The method includes a word ending search step, and a usage example displaying step of creating and displaying a usage example in which the word ending of the new word is connected to the word ending in each of the usage forms searched in the word ending search step.

[0012]

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

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

In the configuration shown in the figure, the CPU is a microprocessor, which performs arithmetic operations for character processing, logical decisions, etc., and has an address bus AB and a control bus C.
B, each component connected to those buses is 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.

Next, the ROM is a read-only fixed memory in which the procedure of control by the microprocessor CPU described later with reference to FIGS. 6 to 9 is stored.

The RAM is a writable random access memory having a structure of 1 word 16 bits,
Used for temporary storage of various data from each component. TD
IC is a registered word dictionary, and stores registered words.
GCTBL is a word ending check table, and is a table for checking the word ending when the registered word is a part of speech utilized. GSTBL is an inflection ending connection table, which is a table in which inflection endings for displaying examples of inflection are stored.

Reference numeral KB denotes a keyboard, which is a character / symbol input key such as an alphabet key, a hiragana key, and a katakana key, and a conversion key, a word registration key, a part-of-speech setting key,
Various function keys such as an execute key and a cancel key for instructing each function to the character processing apparatus are provided.

DISK is document data, registered word dictionary TD
It is an external memory for storing the IC. The document and the registered word dictionary TDIC are stored as needed, and the data is called up when necessary by the instruction of the keyboard.

CR is a cursor register. The CPU can read and write the contents of the cursor register. A 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 for storing a pattern of data to be displayed.

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 pattern of the dot configuration and the display of the cursor on the display device CRT are controlled by the CRT controller.

Further, CG is a character generator for storing a pattern 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 and its microprocessor CP
U reads out various control signals stored in the ROM, and various controls are performed in accordance with these control signals.

FIG. 2 is a diagram for explaining the word registration operation.

Reference numeral 2-1 shows an initial operation screen. Underline means cursor. When the word registration key is pressed in this state, the word registration initial screen 2-2 is displayed.

In 2-2, word registration is activated and a window for inputting registered words is displayed. Here, the operator inputs "lonely" in the field of the word to be registered. When the conversion key is pressed, "lonely" is converted to "lonely".
Next, the operator inputs "sorry" in the reading field. Input is completed on the 2-3 screen.

After that, when the part-of-speech setting key is pressed, 2-
It becomes the screen of 4. The initial screen for setting the part of speech is displayed.

On the part-of-speech setting screen, move the cursor to select the part-of-speech. To register the word "lonely" with adjectives, move the cursor to "9 adjectives". It becomes the screen of 2-5.

When the execute key is pressed, a usage example of the adjective "sora" is displayed as in the screen 2-6. Confirm that the displayed usage example is correct, and press the execute key.
Then, the word registration is actually executed. Then 2-1
Return to the initial screen of.

If the usage example is incorrect on the screen 2-6, the cancel key is pressed. After that, the screen returns to the part of speech setting initial screen of 2-4.

FIG. 3 is a diagram showing an example of data stored in the registration dictionary TDIC. As shown in the figure, the registered word data is stored in ascending order of reading (dictionary array).

FIG. 4 shows a part-of-speech ending check table GCTBL. Using this table, it is checked whether the specified part-of-speech is consistent with the specified endings of "read" and "notation".

The word ending check table is composed of data of "part of speech", "last character of word stem", "word ending" and "line". The registered word data input is compared with this table.

"Part of speech" describes the part of speech that needs to be checked. If the same part of speech is lined up, it is acceptable if the check succeeds in any of them.

The "last character of the word stem" is one character at the end of the reading specified by the operator, excluding the "word ending".
The part of the check table where the last character in the word stem is circled indicates that any hiragana is acceptable.

The "word ending" is the end portion of the reading specified by the operator. The ending may be one letter or two letters.

The "row" is used when the check is successful and indicates how many rows are used. The line marked with a circle indicates that the line does not exist.

When performing the check, the following processing is performed.

First, the part of speech designated at the time of registration is compared with the part of speech in the check table. If there is a relevant part of speech, the necessary information is extracted from the data reading and notation of the registered word and compared with the data in the check table. The last character of the stem and the ending are compared in order.

If either of them does not match by comparison, it is considered that the designated part of speech is not suitable. If both match, we get information that the number of lines is considered to be appropriate for the specified part of speech.

For example, consider the case where the word "eat" is registered. When the word "eat" is specified as an adjective, one character is obtained with the ending "i" and the stem ending "○" is obtained from GCTBL. Since the stem end is "○", it matches unconditionally. Next, the last letter "Ru" and G
The ending "i" indicated by CTBL is compared. Since it does not match, it is understood that it is not suitable for the adjective specified by the operator. If you specify a one-stage verb, one character with the ending "ru" from GCTBL, the end of the stem "i""ki" ... "be" ...
Get "re". Since the ending is a single character, the second character "be" is taken from the end of the operator-specified reading, and this is taken as the operator-specified stem end. Therefore, the operator-specified stem end "be" and GCT
BL Compare the stem ends. Since it matches with "be", the check of the stem end is successful. Next, when comparing the endings, they match with "ru". Therefore, the information "Ba line one stage verb" is obtained.

FIG. 5 is an inflection ending connection table for displaying an inflection example. Used when displaying the screen by combining the stem and ending of each part of speech.

5-1 is an inflection ending connection table for adjectives.

Reference numeral 5-2 is an inflectional ending connection table for adjectives.

Reference numeral 5-3 is an inflectional ending connection table for the Sa-hen noun and the Sa-verb.

Reference numeral 5-4 is an inflectional ending connection table for the verb.

Reference numeral 5-5 is an inflection ending connection table for one-stage verbs.

Reference numeral 5-6 is an inflectional ending connection table for the Ka line five-stage verb.

Reference numeral 5-7 is an inflectional ending connection table for the Ga-gyu 5-dan verb.

Reference numeral 5-8 is an inflection ending connection table for the Sa-gyu 5-dan verb.

Reference numeral 5-9 is an inflectional ending connection table for the five-row verb.

Reference numeral 5-10 is an inflectional ending connection table for the Na-row five-stage verb.

Reference numeral 5-11 is an inflectional ending connection table for the Ba-gyu 5-dan verb.

Reference numeral 5-12 is an inflectional ending connection table for the MAYOU five-stage verb.

Reference numeral 5-13 is an inflectional ending connection table for the Ra-gyu 5-dan verb.

Numeral 5-14 is an inflection ending connection table for the WA-line five-stage verb.

The circled part of the inflection ending column indicates that there is no inflection ending.

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

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

Step 6-1 is a process for fetching data from the keyboard. The type of the key fetched in step 6-2 is determined, and the process branches to the processing routine for each key.

When the conversion key is input, step 6-
It branches to 3 and kana-kanji conversion processing is performed. The kana-kanji conversion process is a process that is generally performed in a character processing device of the same type, and is known, so it will not be described here.

When the word registration key is pressed, the process branches to step 6-4, and the word registration process described in FIG. 7 is performed in step 6-4. Then step 6-1
Branch to.

For other keys, step 6-5.
And the insertion, deletion, etc. are performed in a normal character processing device. After that, the process branches to step 6-1.

FIG. 7 is a detailed flowchart of the "word registration process" in step 6-4.

In step 7-1 "Designation of registration",
Open the word window, let the operator enter information such as the notation and reading of the registered word, and import that information from the keyboard. The registration designation process is a process generally performed in the same type of character processing device, and thus will not be described.

In step 7-2, the operator waits for a key input. If the input key is the part-of-speech setting key, the process branches to step 7-3. When the execution key is input, the process branches to 7-9.

In step 7-3 "part-of-speech setting processing", the operator is made to set the part-of-speech of a word that seems to be suitable for the registered word.

At step 7-4, it is determined whether the set part of speech is utilized or not. Part-of-speech to use (sahenon,
Adjective verb, adjective, sa verb, the verb, five-stage verb, one-stage verb, etc.), the process branches to step 7-5. Part of speech not used (noun, place name, surname, first name, proper noun, adverb, prefix, suffix, classifier, adjunct, conjunction,
If it is a verb, etc.), the process branches to step 7-10.

In step 7-5 "check part of speech", the part-of-speech checking process described in FIG. 8 is performed. As a result of this processing, a return value of 0 or 1 (whether the check is OK) is set, and the row information is returned.

In Step 7-6, Step 7-5
If the return value from is 0, it is considered that the set part of speech is correct, and the process branches to step 7-7. If the return value is 1, the process branches to step 7-3.

In step 7-7 "Display of utilization example", display processing of the utilization example described in FIG. 9 is performed.

Furthermore, it is confirmed whether the displayed utilization example is correct. When the operator determines that it is correct, the operator presses the execution key. If it is determined that it is incorrect, the operator presses the cancel key. The key is determined in step 7-8. If the execute key is pressed, the process branches to step 7-12 to execute the registration work. When the cancel key is pressed, the process branches to step 7-3.

In step 7-9, the processing when the execution key is pressed after the designation of registration is performed. If no part of speech is set, a noun is automatically set.

At step 7-10, confirmation display of registration information is performed. The operator confirms whether the part-of-speech specified by the operator, which is not used, or the noun set in the standard part-of-speech setting is appropriate. When the operator determines that it is correct, the operator presses the execution key. If the execute key is pressed, the process branches to step 7-12 to execute the registration work. If the operator determines that it is incorrect, the operator presses the cancel key. When the cancel key is pressed,
It branches to step 7-3.

In step 7-12, the word is registered in the dictionary. The registration process is a process that is generally performed in the same type of character processing device, and is well known, so a description thereof will not be given.

FIG. 8 is a flow chart showing in detail the "check of part of speech" in step 7-5.

In step 8-1, the type of part-of-speech to be used is determined. If the part of speech is a sahen noun or adjective verb, the process branches to step 8-5. If it is another part of speech to be used, the process branches to step 8-2.

In step 8-2, it is checked in the ending check table of FIG. 4 whether the part of speech to be registered is correct for the registered word. Outputs line information found in the checking process. If the check result is correct, step 8-
Branch to 5. If not, the process branches to step 8-3.

In step 8-3, an error message indicating that the given information is incorrect is displayed.

At step 8-4, the return value is set to 1.

At step 8-5, 0 is set to the return value.

FIG. 9 is a detailed flowchart of step 7-7 “display of utilization example”.

In step 9-1, the inflection ending connection table of FIG. 5 is selected from the part of speech and the line. The connection table is selected from the part of speech designated by the operator and the line information found in the checking process. For parts of speech without line information, the table can be selected simply by specifying the part of speech.

At step 9-2, the word stem portion is judged. Since the part-of-speech is known, the number of characters at the end of the word can be found from the inflection ending connection table GCTBL, and the word stem can be found by subtracting the number of characters from the end of the display.

In step 9-3, the word stem and the word end are connected. The word group of the connection table found in step 9-1 and the word stem found in step 9-2 are connected. For each inflectional form, connect the stems and endings, and prepare the screen display for all inflectional forms.

In step 9-4, the word stem and the word end combined in step 9-3 are displayed on the screen.

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.

[0090]

As described above, according to the present invention,
When registering a new word in the dictionary by associating the pronunciation, the notation, and the part of speech specified by the operator with each other, if the specified part of speech has a practical use, the allowed stem of each part of speech is registered prior to registration. A check table in which one or more combinations of endings and endings are associated with utilization lines corresponding to the combinations is searched, and the parts of speech are appropriate based on the ending part and ending of the stem in the new word. Whether or not it is appropriate and the usage line when it is appropriate, if it is determined that it is not appropriate, an error is notified, while if it is determined that it is appropriate, the part of speech and the determined usage line are Based on the combination of part-of-speech and inflection line, the inflection ending in each inflection is searched from the inflection ending table that stores the inflection inflection in each inflection, and each inflection found in the stem of the new word Okeru inflectional endings were to be displayed by creating a practical example which is respectively connected, you can determine an error of the designated part of speech when registering a word with high accuracy,
It is possible to prevent registration by erroneous part-of-speech designation. Furthermore, by creating and displaying a usage example of a new word according to a part of speech or a usage line, it is possible to confirm whether or not a word having various usages is used as intended by the operator. Therefore, improper registration can be avoided, and a character processing device with high operability can be realized.

[Brief description of drawings]

FIG. 1 is a block diagram of the overall configuration of the present invention.

FIG. 2 is a diagram showing an example of a word registration operation according to the present invention.

FIG. 3 is a diagram showing a configuration of a registered word dictionary TDIC according to the present invention.

FIG. 4 is a diagram showing a structure of a part-of-speech ending check table used in the present invention.

FIG. 5 is a diagram showing a configuration of an inflection ending connection table for displaying an inflection example in the present invention.

FIG. 6 is a flowchart showing an operation of the character processing device.

FIG. 7 is a flowchart showing an operation of the character processing device.

FIG. 8 is a flowchart showing an operation of the character processing device.

FIG. 9 is a flowchart showing the operation of the character processing device.

[Explanation of symbols]

CPU microprocessor DIC Kana-Kanji conversion dictionary ROM Read-only memory RAM random access memory TDIC registered word dictionary GCTBL ending check table GSTBL inflection ending connection table DISK external memory PRT printer KB keyboard CR cursor register DBUF display buffer memory CRTC CRT controller CRT display device CG character generator

─────────────────────────────────────────────────── ─── Continuation of front page (56) Reference JP-A-1-287772 (JP, A) JP-A-5-67081 (JP, A) JP-A-4-188266 (JP, A) JP-A-3- 129555 (JP, A) JP-A-3-110671 (JP, A) JP-A 64-74668 (JP, A) JP-A 62-212767 (JP, A) (58) Fields investigated (Int.Cl. ⁷ , DB name) G06F 17/21-17/24

Claims (2)

(57) [Claims] 1. A dictionary that stores word readings, notations, and parts of speech in association with each other, and one of the end of the stem and the end of the word that is allowed for each part of speech.
Correspondence between the above combinations and utilization lines corresponding to the combinations
The combination of the digit check table, part-of-speech, and usage line is used in each usage form.
An inflection ending table that stores term endings, a conversion unit that converts an input reading into a notation while referring to the dictionary, and a new word by associating the reading, the notation, and the part of speech designated by the operator, When the word registration means registered in the dictionary and the designated part-of-speech have practical use, the check table is searched prior to registration by the word registration means .
And, based on the end and <br/> endings of stems in the new word with the part of speech is appropriate and whether the or part of speech is appropriate
In the case where it is determined that it is not appropriate, the informing means for informing an error and the designated part of speech are determined to be appropriate by the determining means. when the respective than the inflectional endings table based on utilization of rows determined by the part of speech and the determining means
Inflection ending search means for searching inflection endings in inflectional forms
And the stem of the new word is detected by the inflection ending search means.
A character processing device, comprising: a utilization example display means for creating and displaying a utilization example in which the utilization endings of the respective utilization forms searched for are respectively connected . 2. A character processing device provided with a dictionary for associating and storing a reading, a notation, and a part of speech of a word ,
About one or more pairs of allowed stem endings and endings
Check that associates the combination with the utilization line corresponding to the combination.
The table, the part of speech, and the combination of usage lines
An inflection ending table that stores inflection endings in inflectional forms
And a conversion step of converting the input pronunciation into the notation while referring to the dictionary, and registering the pronunciation, the notation and the part of speech designated by the operator as a new word in the dictionary. When the process and the specified part of speech have conjugation, the check table is searched prior to registration by the word registration process .
And, based on the end and <br/> endings of stems in the new word with the part of speech is appropriate and whether the or part of speech is appropriate
In the case where it is judged to be inappropriate in the judgment process for judging the utilization line in the case,
From the inflection table based on the part of speech and the inflection line determined in the determination step, when the informing step of informing an error and the designated part of speech are determined to be appropriate in the determination step.
Inflection ending search process for searching inflection endings in each inflection
And the stem of the new word is detected by the inflection ending search process.
And a usage example displaying step of creating and displaying a usage example in which the usage endings of the searched usage forms are respectively connected .