JPS5851380A - Kana-kanji conversion processing system - Google Patents

Abstract

PURPOSE:To switch the system with an easy operation to use Hiragana (cursive Japanese syllabary character) in the hind part of a compound word and a declinable suffix part or to convert Hiragana in these parts to Kanji (Chinese character), by outputting declinable suffixes in an adjunct table dictionary with inscription in Kana (Japanese syllabary). CONSTITUTION:An independent word dictionary 18 is divided into three parts, namely a general independent word dictionary 18A, a proper noun dictionary 18B, and a numeral dictionary 18C; and in accordance with this division, a prefix table 19 is divided into three parts, namely, a general prefix table 19A, a proper noun prefix table 19B, and a prepositive auxiliary numeral table 19C, and a suffix dictionary 20 is divided into three parts, namely, a general suffix table 20A, a proper nous suffix table 20B, and a postpositive auxiliary numeral table 20C.

Description

[Detailed Description of the Invention] Regarding the kanji conversion processing method used in the Japanese language word processor, etc., it improves the correct answer rate of conversion in the kana-kanji conversion processing method that provides bunsetsu break information to %, and the processing speed of document creation work. This invention relates to a kana-kanji conversion processing method that can improve the performance.

Kana-Kanji conversion processing (hereinafter also referred to as single K "conversion processing").

) method, a nuka method has been proposed so far. For example, the system disclosed in Japanese Patent Publication No. 11FFI53-7131 uses a device as shown in FIG. ) 5, and if there are multiple written characters corresponding to the same pronunciation kana, all of them are displayed on the display device 2, and the operator selects the desired character or character using the homophone (different character) selection circuit 10. is also V. However, from '&, Japan 1 [
Since Company C has many homophones and allographs, this conversion processing method imposes a heavy burden on the operator, and also has the problem of requiring manual speed to be kept to a low level.

As a solution to the above Rffi', Funbu -
An automatic conversion processing method using a full-scale conversion method has also been proposed.

For example, fw HK Technical Research, Volume 25, No. 6 (19
73) K discloses a method of reducing homonyms by performing a grammatical check on input sentences input in units of punctuation, and then outputting the one most frequently used. Ru. A complete block diagram of this system is shown in 2nd eUk. In this method, the definition of one phrase - such as having one independent word - is fixed, so the portion to be converted into kanji remains constant regardless of the intention of the text creator.

However, the latter part of so-called collocations (the suffix-like part of a pragmatic term, hereinafter referred to as a ``pragmatic suffix'') such as ``stay over'', ``damage to death'', ``write up'', and ``tremble''. 1. There is a custom of writing ``to put in'' and ``damage'' in 1. ``to raise'' and ``to rise'' are written in kanji and 2.
There is i1).

In one case where the above-mentioned conversion processing method is used to convert the above-mentioned collocation into kanji notation, such as ``to ne kume'', ``to t9'' and ``to t9'' are used.
If you want to convert it into hiragana, such as ``tomarikoshin'', first enter ``tomari'' manually, perform the kanji conversion process t-g, and then enter ``komu'' as two phrases. '' requires a cumbersome operation in which forced hirakana processing is required, which poses a problem of placing a heavy burden on the operator.

The present invention improves the above-mentioned automatic conversion processing method, and makes it possible to change by a simple operation whether the latter part of a collocation or a pragmatic suffix St-hiragana is used or converted to a kanji. The purpose is to provide a conversion processing method.

The above-mentioned object of the present invention is to divide the Japanese words constituting an input sentence into independent words, w-initials, suffixes, and adjunct words, and to break down the input sentence into division units centered on one independent word. tl! is an independent #dictionary that stores independent words by inputting in kana characters, stores the input character string in a temporary storage means, and stores the stored contents. A prefix table that stores suffixes, a suffix table that stores suffixes, an independent word endings table that stores the conjugated endings of independent words in words, and an adjunct table that stores adjuncts. In the kana-kanji conversion processing method, which is configured to check with the contents of the dictionary, in the adjunct word table, in addition to formal water body, auxiliary verb, auxiliary verb, and particle, there is a pragmatic suffix,
A feature is that the pragmatic suffixes in the adjunct table are output in hiragana notation. This is achieved by the Kana-Kanji conversion processing method.

In addition, in the present invention, the punctuation unit (``Bunsetsu J tomo (hau.)'' refers to the following duck.

[Prefix] (Independent word) [Suffix] [Adjunct word] *Here, it is assumed that there is always one independent word in the book, and the words enclosed in [ ] may be omitted, and the attached word (* (marked) may be repeated multiple times.

The contents of the dictionary or table are as follows (common to all): 0 The part that matches the 0-yomi kana Futaba character string.

Table 0: Characters to be output when a specific word is confirmed.

0 article body, conjugation: The part of speech and conjugation of each independent word are recorded with all serial numbers.

O Frequency: Frequency of use - Normalized and recorded within the reading kana.

The specific contents of each dictionary will be detailed later.

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 3 is a pull diagram of a kana-kanji conversion processing unit showing an embodiment of the present invention. In Figure 3, the same components as shown in Figure 2 are given the same symbols as those shown in Figure 2.
Also, closely related components are given codes with branching subscripts.

As is clear from comparing FIG. 2 and FIG. 3, in this embodiment, the independent word dictionary 18 (see FIG. 2), the general independent word dictionary 18, the IN famous body dictionary 1811, and the number dictionary 180 are used. Divided into three parts, clitic table 19 and suffix table 2
0 (all in Figure 2) % Correspondingly, general prefix table 19mu, proper noun prefix table 1911 and prefix cylinder table 19C; general suffix: 1!20mu, proper name tone suffix table 2
It is divided into three parts: 0B and postfix classifier table 200.

These subdivided dictionary table 1 can be accessed by interlocking changeover switch S0. S, , S, allows nine corresponding dictionary tables to be selected for use in verification.

This is achieved by classifying literary works into categories and manually calculating them with the category information to increase the accuracy rate of analysis (correct conversion rate).
It is for total improvement.

The key point of the present invention lies in the contents of the table of adjunct terms and how to use them, which will be described later.

Hereinafter, the specific contents of the first dictionary table will be explained using an example.

α) General independent word dictionary 18A As shown in part of its contents in Figure 4, in general terms, nouns, ``suru'' nouns (nouns that can have ``suru'' in the ``suru'')
, verbs, adjectives, adjectives, rentaiji, jiku, interjections, etc. are memorized.

Among these, the verb is only the stem, but the first-stage conjugated verb includes the entire inflected part, and the ``suru'' and the ``kuru'' include the entire conjugated form. Ru.

■Proper name derogation @18B As part of the content is shown in Figure 6, among independent words,
Memorizes the unique names of people, places, corporations, etc.

■Institutional Dictionary 180 As part of its contents is shown in the 6th WJ, among independent words, the name #g representing a number is remembered as 'IiI Shrine.

(4) General adverb table 19A As shown in part in FIG. 7, it stores prefixes attached to nouns, etc. of general independent words.

C) Proper name li apposition table 19B As shown in part in Figure 8, the proper name tone is
1i! Remember the initials.

β) Prefix Motive Cylinder Table 190 @9 As shown in part in Figure 9, the motive 1g placed before the number - is stored.

(7) General suffix table 20m As shown in part in Figure 1O, it stores suffixes attached to the nominal tone of general independent words.

β) Proper noun wave suffix table 20B As shown in part and all in FIG. 11, it stores suffixes attached to proper names.

Q) Rear moving engine table 2 (1) As shown in part and all in the 12th garden, I remember the moving number 11'Th placed after lk*.

αO) Independent word classification table (contained conjugate ending table) 21 The independent word classification table (a part of the contents is shown in Figure 13) is the part-of-speech level (noun, wits, adnominal, and impression #), and the words are classified at the conjugation ending level and stored. As shown in FIGS. 14 to 17, the conjugation foot table stores the conjugation endings of conjugations. Tao, Figure 14 is a 5-stage conjugation verb, Figure 15 is a 1-stage conjugation, IJ,
Figure 16 is a list of adjectives, and Figure 17 is a list of adjective verbs.

α1) Included M vocabulary 22 Consists of a major classification table 221 and a minor classification table 2211 9
As shown in part and all in Figure 18, the major classification table 22A is classified into formal nouns, auxiliary verbs (formal verbs), auxiliary verbs, particles, and the above-mentioned pragmatic suffixes. The classification table 22B corresponds to the numbers. Minor classification table 22
As shown in part and all in BTF Figure 19, each word of the formal noun, the accusative, the conjugation form of each period of the ulj verb, each period of the verb, and each period of the predicate suffix. It is classified by the unit of conjugation.

α Connection Matrix Table 17 Independent words and appendix I! A table showing the grammatical connections between four words, with preceding words in rows and succeeding words in columns.
Element a1 of column j. is defined as follows.

←) If c, -1, the word in the 5th row can be glued to the word in the 5th column (b) 01:, ”' If Q, the word in the 1st row cannot be glued to the word in the 5th column A part of the contents is shown in Figure 20.The column numbers in Figure 20 are rounded up every 4 columns and are shown in hexadecimal.In addition, the serial numbers in the major classification table 22A of the Appendix II words are as follows: It is 1- corresponding to the above column number.

Using connection matrix table 17 in FIG. 21, attach JI! The steps for selecting words are shown as a model. The details will be described in the description of specific examples below. In addition, the connection matrix table 17 has an item tP for termination possibility, which is ``1''.
'', KFi indicates that there is a possibility of the clause ending.

The operation of this embodiment configured as described above will be explained below.

(1) Input Input is performed using the keyboard device 11. An example of the character arrangement of the keyboard device 11 is shown in FIG. 22 (this is not limited to this).

Defense of left and right hands! Box 1 Define the coverage area of each finger as shown in the complete diagram. Also, place it in the home position column t-C.

This #board device F has the following special function keys.

(a) Space Par Co., Ltd. Since this key has the role of a certain type of key, when inputting an actual space, the space bar should be pressed twice in succession.

(b) O-marked special keys (@, @, ■) #1, respectively the category of the manually generated phrases (general phrases).

This key is used to input all (proper noun clauses and WkIm clauses). Space bar (hereinafter referred to as "■")
By pressing the key in combination with the above-mentioned special key, the phrase break output information is generated.

Immediately after a general clause, press ■ and then press ■. After the TM of a specific water body clause, press ■ and then O. Immediately after a numeral clause, press ■. You will have to type Ot from here.

(Example) Keystroke order After conversion, the output is ■O
→ I'm going to Oko ■ [phase] → I went to school with Yamamoto-sama ■■ → Yamamoto-sama and Otaku ■■ → The big boy in Ota Ward ■■ → The 5th Daisa person, Kato 5 and Kano (c) In the third volume of C, special keys (19, 1lffi) marked with 0 are keys for outputting input character strings in hirakana and kanakana, respectively. In combination with the space bar, force character output information.

Immediately after the phrase that you want to output in hiragana, ■ Press all the keys, then press the lock key, and output it in kanakana. Immediately after the phrase,
You will need to press the ■ key and then the river.

(Example) Keystroke order Output after conversion Rust L-■ area → Rust Nobashii■encircle→Sabishii school bus → school bus ■Envy exchange behavior As mentioned above, [Kasuburikuku-1, ``Kyoyukumi''.

[Sentences such as belief f-J etc.f#ke, this is ``stay-knocked.''

In some cases, you may want to say ``kyoshu komu'' or ``believe in komu''.

If you also want to convert the ``kumi'' part into kanji, such as in ``Narikomi mo'', enter this as two clauses.

That is, when the operator inputs "Tomari" one character at a time from the keyboard device t11, this signal is sent to the kana register 1.
2 is temporarily multiplied by II. This is a general phrase, so when the operator next presses ■■, this signal becomes 11.
The signal is sent to the 1m circuit 13. Control circuit ff113#'i selects one terminal (terminal corresponding to general sentence t#) of selector switch SL181+'8, and selects the kana register 1.
The contents of 2 are compared and searched against the inner world of the 18-m general self-contained dictionary using longest-dispersion.

Then [I know all about the nouns that correspond to [TomaCjK].

Next, look at the rows of the connection matrix table 17 from the noun item of the control circuit 13 #i independent word classification table 21, check that the termination possibility column is 1'', and check all the contents of the kana register and the dictionary. We know that adjunctive words are difficult because they match with the content.

Next, the control@path 13 reads the expressions in the independent word dictionary 18m and sends the character strings of "overnight" and "earth" to the output editor 14 along with frequency information. Output editor 14 selects the word with the highest frequency ≠ "overnight" out of the two independent words and displays it on display device 1.
5 and display it with a message indicating that there is a homophone.

The operator then inputs "Komu" one character at a time, and this signal is temporarily stored in the kana register 12. Next, when the user presses the key ``■■'', the entire comparison between the contents of the kana register 12 and the contents of the general independent word dictionary 18 starts. If you search for longest-dispersion, there is no heading for "kob", so
They match up to "ko". Here, three types of parts of speech and conjugations are found: nouns (子, powder), adjectives (ko), and 5-step conjugation of the verb M line, but if it is a noun or an adjective, it may not connect with the following character "chi". This can be determined from the connection matrix table 17 or the use table (Figure 16).

Is the conjugation table (Figure 14) the conjugation of the verb in the 5th row of M lines? If you search, you will find that the final form of jin is ``mu'', and this conjugated form has a termination possibility column of 11'' in the connection matrix table 17, so you can see that it can be terminated.Control circuit 13
Send the notation ``Kumi-J'' of the 5th stage conjugation of the u-do ma row and the ``mu'' of the conjugation table to the Lu Li II collector 14. The output editor 14it sends both of them as they are to the display device 9115, and displays "Include".

, h) Through a series of actions, it can eventually be translated into ``staying over''.

Next, if you want to leave the partial hiragana of ``komu'' as in ``stay over'', enter this as the t1 clause.

That is, when the operator inputs "Toma 9 Komu" one character at a time, and then presses ■ [stock], it will match the noun of "Tomari" in the 18th column of the general independent word dictionary, so the connecting line will be When we look at all the nouns W in Column Table 17, we confirm that they can be connected with the final form of the pragmatic suffix ``Kom'', ``Kom'', and that this can be terminated, indicating that the analysis has been completed. know.

In the output collection fiift14, similar to the above, the display device 1 displays K "night shi J" and "ζmu" together with the information that there are homophones.
Send to 5. You can now confirm that it has been converted to "staying over."

During the unification, I went to a mission school in Ota Ward. Indicates N which creates the meaning of the sentence j.

When the operator inputs "I am" one character at a time using the keyboard device 11, this signal is temporarily stored in the kana register 12. Since this is a general phrase, when the operator next presses ■ [phase], this signal is sent to the control circuit 1.
Sent to 3. The control circuit 13 has a changeover switch 8□t
Terminal a (terminal corresponding to a general phrase) of Sl t Ss is selected, and the contents of the kana register 12 are collated and searched with the contents of the general independent word dictionary 18 by the longest-teaching method. There is no corresponding noun for ``Watakushike'', but ``Wata < LJ K. Then I know that there is a corresponding noun.

Next, the control circuit 13t'1 looks at row t of the connection matrix table 17 from the noun item of the independent word classification table 21, and the bit 'l
Check the column with bit 1''.
Search for the word B and check whether it contains "ke". If there is no ``1'' in the above column, start searching again for a ``1'' column from the next column. Noun line assistance 11 ``
Since it is ``1'' in the ``wa'' column, ``watakushi'' is 1.
It can be seen that "is" is connected. Furthermore, attached word minor classification table 2
Row t of the connection matrix table 17 from the entry of the connection aid rFiJ of 2B
Check that the termination possibility is "l", and from the match with the lightest character in the kana register 12, we know that the analysis was performed normally (see Figure 21)0 Next, the mackerel control circuit 13#'i reads the notation in the independent word dictionary 18A, narrows down the code for "I", reads the notation in the adjunct word table 22, and sends the code rFi, J to the output m collector 14. . In this case, the output of the output W calculator 14Vi is directly sent to the display device 16 for display. From this display, the operator confirms that the replacement process has been performed normally.

The operator then inputs "Otaku no" one character at a time, and this signal is temporarily stored in the kana register 12. Since this is a proper noun phrase, when the user next presses the key ■ [phase], this signal is sent to the control circuit 13. Control circuit-13a changeover switches a, s, s, b*
One child (terminal corresponding to a proper noun phrase) is selected, and the entire contents of the kana register 12 are compared and searched against the contents of the proper noun dictionary 118B using the longest match method. It can be seen that "Ota" is included in the proper noun dictionary 18B and is a proper noun (treated as a noun).

Next, in the control circuit 13, we look at the consonant sounds in the connection matrix table 17 from the noun items in the independent word classification table 21, and check all columns with the bit l'''.However, in the attached word table 22, “<
” or [ Since there is no string of 1 in 〈, connection matrix table 17
Even if you reach the end of the line of nouns, it is not possible to connect them.

Therefore, the control circuit 13#i maintains "Ota" as an independent word and performs matching with the suffix table using the subsequent character string "Kuno".

As described by Peng, since the b terminal of the changeover switch S is selected, the proper name dictionary suffix table 20B is searched and "〈" is extracted. Next, the proper noun suffix is changed to the independent word. Connection matrix Table 1 from the independent word classification table as a noun
Checking 7.〇The case particle 1's can be connected with a noun, so from attached MIM table 22 to connection matrix table 17
I know that the analysis was successful because I can see that it can be terminated.

Next, the control circuit 13 reads the notation in the proper name dictionary 18B,
This will be sent to all cars No. 14. Here, since there are two notations for the pronunciation of "Oona": "Ota" and "Ota", both of them are sent to the output IIl collector 14, including frequency information. It reads the notation of the suffix and sends it to the full code output unit 14 for ``ku'', and sends the code for ``no'' of the first suffix to aS.

The output stinks! ! The device 14 selects the one of the two independent word expressions with the highest frequency and sends it to the display device 15 as "Ota-ku's" and displays it, and also displays that there are multiple independent words with the same sound. In this case, "Ota-ku's" is correct, so you can press #a for the next input character, but if you need "Ota-ku's" again, you can press ■ at this point and the keyboard will be pressed. A direct signal is sent from the device 11 to the output editor 14 IC, and the output editor 1 exchanges "Ota" and "Ota" and displays the display device 1.
6 and redisplays it as ``Ota Ward''.

The operator then inputs ``mi oshin n su〈-ru'' one character at a time, and this signal is temporarily stored in the kana register 12. Since we want to convert this clause into kanakana characters, next time we input @kawa, this signal will be sent to the control circuit 13. The control circuit 13 takes out the contents of the kana register 12 one character at a time, refers to the hiragana/kanakana correspondence table 23, and converts them into hirakana t kana kana. Hiragana/
Characters or symbols that are not in the kanakana correspondence table (in this case, the middle point "・" corresponds to this) are placed in that position without conversion. When all characters have been converted, they are sent to the output editor 14 along with the craft code. Among the codes sent from the output editor 14#i control circuit 13, the craftsman code is removed, and the other character strings are sent as they are to the display device 15 for display. ``Mission School'' is displayed, the operator confirms it and moves on to the next input.

The next character is the case particle "he", but since a character string that does not contain an independent word (in this case, it is just one character) cannot be converted, the Kenzenbin et al. In other words, when the operator inputs "J",
This signal is temporarily stored in the kana register 12. Next ■
When the key is pressed, this signal is sent to the control circuit 13. The control circuit 13 sends the contents of the kana register together with the box hood to the tt output collector 14, the output editor 14 removes the ta code, and sends the other character strings as they are to the display device 15 for display. [J is displayed, and the operator acknowledges it and moves on to the next input.

The operator then inputs "Kayo O Te-masu" one character at a time, and this signal is temporarily stored in the kana register 12. Since this is a general candy, when the next KQ9 [phase] is input, this signal is sent to the control circuit 13. Control circuit 13F
i First, selector switch S, , S,.

8, select 1 terminal t*, and match and search the contents of kana register 2 with the contents of the general independent word dictionary 185 using the longest teaching method. By making this a 6-level conjugated verb in the A-wa line, ≠, when the next character string "0 te-masu" is compared with the letters in the A-wa line of the 6-level conjugation table, it matches 口, so it is a consonant form. It is and t
know.

Next, let's look at the bamboo tube in the connection matrix table 17 from the 15-stage conjugated consonant flight form oma in the control ■ road 13 Fi independent word classification table 21.
Bitsushi checks the "l" column.

In the end, it turns out that "te" in the character string "teVhmasu" is a conjunctive particle. Control time '#113 is in attached word table 22
From the item of the conjunctive particle ``te'', look at the rows of the conjunctive matrix table 17 and arrive at the auxiliary particle ``k'', then the adjunct table 2
2, extract the undefined form "-" and add it to row t of connection matrix table 17.
I'll take a look. In this case, “Iru” is a 1-stage conjugation, so 1
Look at the same line as the unnatural form of the stage conjugation verb. However, in this line, you can see that the following "!!su" is not unified.

Therefore, we return to the adjunctive word table 22 again, take out the adjunctive form "i" that follows the pre-existing form, and look at row t of the connection matrix table 17. In this case as well, look at the same line as the conjunctive form of the first-stage conjugated verb. This is a work that can be connected with the column of Cho Hayabusa's support moving body "tsu", and it is attached! Take out the final form of polite auxiliary li ``Mazu'' from the word classification table, look at the consonant sounds in Connection Matrix Table 17 from this item, confirm that the column for possibility of termination is 'l'', and confirm that it is normal. I know that the analysis was carried out on

The subsequent operation is the same as the processing of the clause ``Kake'' described above, and after being sent to the output S unit 14, the message ``Toguguchimasu'' is displayed on the display device.
〇In addition, in this example, the part of the auxiliary dynamic "i" is input as one phrase in order to output it as Himogana, but if you want to convert the part of "i" into kanji, input it as two phrases as shown below. Just do it.

, the pronunciation is ``i'', the notation is ``i'', the name hook is ``,'' and the conjugation is ``i''.
Because it contains the word ``verb, 1st step'', ``through'' ``
"I'm here."

Next, as yet another analysis example, when creating the sentence ``The 5th Chumagome Athletic Meet'', the entire text is shown.

The operator does the manual work by saying ``Daigokai''■■.

This signal causes the control circuit 13 to switch the selector switch S0°S,
Select the 0 terminal of ,S, and start the entire analysis. The longest string of characters in the word "daigokai" - Independent word dictionary (number word dictionary 180) according to the teaching method - blond hair - There is no match. In other words, the pronunciations of ``Daigokaψ,''``Taigoka,''``Da-to,''``Tai,'' and ``Da'' are included in the independent word dictionary.

If the independent word is not found, the control circuit 13 selects the next KI
[Since the 0 terminal has been selected, the prepositional verb table 190 is used as the search procedure, the prepositional verb table 19 (1-ra [dai J) is taken out.] Next, when the longest independent word is extracted from the II continuation character string ``gokai'' using the longest method, it is found that ``go'' is in the number word dictionary 180. In the independent word classification table, one row of the connection matrix table is treated as a noun.

In the subsequent analysis of the character string ``kai'', the noun and the adverb ``ka-''
It is possible to connect the adverb ``ka'' with ``1'', but it can be seen that there is no possibility of connecting the adverb ``ka'' with the ``i'' in the second sentence. Then, by making an inquiry with the suffix table (ill!Wh number cylinder table 200), "ka-" can be retrieved. This is treated as a noun in the independent word classification table, so when we look at the connection matrix table 17 from that item, we see that the termination possibility is @1'', which indicates that a normal analysis was performed.

Therefore, the control circuit 13 outputs "th" from the prepositional verb table 190, "fifth" from the number word dictionary 180, and "punishment" and "floor" from the postfix Wk body table 200 together with the frequency. Send to 14th. The output editor 14 #i sends the character string #i [fifth] to the display device 15 and at the same time sends a signal that there is one homophone. In this case, "fifth translation" is correct, so move on to the next input.

When the operator inputs "Kameka Matome" ■■, the III control path 13 selects one terminal tube of the changeover switches S□, s, , s,. And first, by the longest match method! ! IW
Even when I looked up the '4i name dictionary 18B, there was no matching book, so I moved to the clitic dictionary ME, and the proper name prefix table 191! l1
l-Take out the "gaka". Next, use the longest match method again!
Look up IwI Famous Drama Dictionary 18B and pick out ``Magume''.

From this k, the output r is obtained.

Next, enter 0 [phase] in the operator's "Daiundoka-". Control circuit 13 companies selector switch S, , S, .

Select the a terminal of B and start the analysis.

The first attempt to extract independent words using dispersion was unsuccessful;
! ! ``Dai'' is extracted using the inclination process, and ``Rindo'' is extracted by extracting independent words using the longest-teaching method again.

Furthermore, an analysis of isK relationships with adjuncts reveals that ``iPii'' is not common, and ``kai'' [is extracted] through suffix processing. The control circuit 13Fi sends the notation of these words (or words) to the output lI collector No. 1, but since the readings of the suffix "ka-" have "Kai" and "Kai", both are sent along with the output ranking information. send.

The output editor 14 is a display device for the character string of "Great Motion World"! 1
5 and displays that there is a homophone. When the operator manually presses the ■ key, "kai" changes to "kai." This means that you have entered the necessary text for the ``5th Chumagome Dai-linked Association''.

In the above embodiment, the input clause is classified into three categories: general clause, proper noun clause, and numeral clause by focusing on the independent words in the clause, and this category information is provided prior to the conversion process. However, since this classification is done by the operator, there may be a classification error or a keystroke error. Therefore, if you specify a certain category and the analysis is unsuccessful in that category, it is a good idea to automatically check all other categories.

In that case, the order of category instructions should be as follows.

[Stock] - [Phase] -〇 [Phase] -〇 - [Stock] ■→■→＠ Also, adding "technical terms" to the category classification,
It is effective in increasing the overall success rate of analysis.

In this case as well, it is a good idea to look at other categories in the following order to prevent mistakes.

O→■−〇−■ ■−■→■−■ 〇−■−＠−S＠ ■−＠−＠−＠ As mentioned above, when adding all "technical terms" to the category classification, special Define the key ■ like any other special key. It is convenient to place it in the position of the character keys "Hi" and "Mo".

It goes without saying that the content of the category classification is not limited to the above-mentioned categories.

Further, in the pot plate device shown in the above embodiment, the special key is defined twice as the character key, but the special key may be provided separately and independently from all the character keys. In that case,
It is no longer necessary to press the space bar first.

As described above, according to the present invention, the Japanese words constituting the input sentence are classified into independent words, @adverbs, suffixes, and MffM, and the phrases centered on the independent words of t-1 in the input sentence are This independent word dictionary is constructed by manually inputting character strings into kana characters, storing the inputted character strings in a temporary storage means, and storing the entire memory contents and independent words.

The prefix is V, and the affix table remembers it! ! ? A suffix table that memorizes suffixes, a conjugated suffix for self-directed words? Memorized independent word classification table and attached PA words memorized
In a kana-kanji conversion processing method that is compatible with the contents of a dictionary such as I-word barley, formal nouns, capture verbs, auxiliary verbs, and particles of formal nouns, auxiliary verbs, and particle suffixes have pragmatic suffixes. , the pragmatic suffix in the adjunct word table is output in kehirakana notation, so it is easy to decide whether to output the end of a collocation or the pragmatic suffix part as hiragana or convert it to kanji. Switching can be performed with a simple operation, greatly reducing the burden on the operator, and making it possible to greatly improve the ultimate human power speed, which has a remarkable effect.

[Brief explanation of drawings]

Figures 1 and 2 are block diagrams showing the conventional kana-kanji conversion processing method, block diagrams showing an implementation of the invention of the third Viff company, and Figures 4 to 21 are diagrams showing the contents of dictionary documents. , FIG. 22 is a diagram showing the character layout Pt of the keyboard V. 1138! ffi bush, 12: kana register, 13 = control IT path, 14: output & 1 collector, 1δ: display device, 16
: Printer, 17: Closed matrix table, 18m: General independent word #
it 婁, 18 Oi: Ii Famous Noun Book, 18C: Number 1iiJ
Dictionary, 19A general prefix table, 191 [famous l[needle head table, 190: prepositional auxiliary 'fIIv table, 20A general spelling suffix table, 20B: craft noun nucleus tail table, 200:1! Auxiliary motive number table, 21: Independent word classification table, 22: Adjunct word table, 22mu: Adjunct word major classification table, 22B: Adjunct speaker classification table, 23: Hiragana/Kanakana correspondence table. Figure 4 Figure 6 Figure 18 (a) (b) 22A 22A Figure 19 22B 22B

Claims (1)

[Claims] Classify the Japanese language that constitutes the input sentence into independent words, prefixes, suffixes, and attached words, and break it down into division units centered on t-1 independent words in the input sentence. and enter it in kana characters, and temporarily save the input character string to it1. m means, all the memory contents are independent [[Memorized independent word dictionary, 1]
Mengwi's resignation letter, J1 who remembers his words! Memorized gong: tail # table, independent word order 1 @ table that remembers the conjugated ending of the independent word of 艷 and appendix IWM stored in appendix E table omitted. In addition to the kana-kanji conversion processing method, the form name shrine and the auxiliary verb are included in the attached M candy table. In addition to auxiliary verbs and particles, there is a pragmatic suffix #l, and the pragmatic suffixes in the attached table a are output in hiragana notation. Coffee method.