JPS5924382A - Word form converting system of electronic interpreter - Google Patents

Abstract

PURPOSE:To obtain easily a translation word of a basic form, by providing a table of ending of word having regular inflection and comparing successively the word ending with inflection of the supplied regular inflection word to obtain a coincident word and then deleting the end of the obtained word. CONSTITUTION:The word supplied through a key input 1 is sent to a deforming circuit 3 via an input buffer 2. The circuit 3 contains an ROM4 storing inflected endings of words such as s, es, les, ves, d, ed, ied, ing, etc. and an ROM5 which stores information on endings of words such as y, fe, e, etc. Then the circuit 3 sends the supplied data to a searching circuit 7 via a register 6 and refers to a dictionary 8. The coincident words, if any, are sent to a display part; while the discordance is informed to the circuit 3. Then the inflected ending is deleted with addition of the word ending information to search 7 the memory 8. The word ending is excluded when the coincidence is obtained to perform a decision 10 through a register 9. Then a detection unable signal NF is delivered to the circuit 7 when no verb is detected; while an OK signal is sent to the circuit 7 when a verb is detected. In such a way, a translation is obtained easily for the basic form.

Description

[Detailed Description of the Invention] The present invention relates to an inflection conversion method for an electronic translator.In recent years, electronic translators have been developed and put into practical use, which display an English translation of a Japanese word when it is input. There is. However, because this type of translator needs to store as many words as possible in its memory, which has limited capacity, it is necessary to store as many words as possible in its memory, which has limited capacity. is not stored in memory. Therefore, the translation of words that regularly change their inflection as mentioned above can only be done using the original form, and the user must first convert the word he or she wants to translate into its original form before inputting it into the translator. There was a problem.

The present invention has been made in view of the above points, and for words whose inflections regularly change, when inputting the inflected form,
The Old Testament is to provide an inflection method for electronic translators that can convert the declensions into basic forms for translation.

An embodiment of the present invention will be described below with reference to the drawings. 1st
In the figure, reference numeral 1 indicates a key input section, which includes a mode switch for instructing translation mode, e.g., Japanese to English, or English to Japanese translation, a translation key for instructing translation, an input key for inputting English or Japanese, etc. It is equipped with The word input data input from the key human power section 1 is input to the input buffer 2.
It is held in the display section (not shown) and displayed, and is also sent to the transformation circuit 3 when the translation key is operated. As will be described in detail later, this transformation circuit 3 is a circuit for basically converting an inflected word form when it is input, and is connected to a first ROM 4 and a second ROM 5.

The first ROM 4 contains I! which shows the inflectional endings of regular inflectional words, that is, plural forms, past tenses, progressive forms, etc. for basic words. r ell + ies I ves l d
Iad l led.

Word ending information such as ing +... is stored. In fact, the second ROM 5 stores the ending information of y+ fe I e. This second ROM 5 is used to obtain basic words ending in y+fe+e. The modification circuit 3 transforms or transforms the data from the input buffer 2 and sends it to the search circuit 7 via the register 6. A dictionary memory 8 is connected to this search circuit 7.

This dictionary memory 8 stores English words and Japanese words that are their parallel translations, as well as part-of-speech information for each word. The search circuit 7 searches the dictionary memory 8 according to the input data held in the register 6, and if there is no matching word, transmits a mismatch signal to the modification circuit 3 via the output line 7a. In addition, the search circuit 7
If a corresponding word is found, the word and part-of-speech information are read out and input to the discrimination circuit 10 via the word register 9. A control signal is further input to the discrimination circuit 10 from the transformation circuit 3 in accordance with the inflected ending of the input word.

The discriminating circuit 10 performs a predetermined discriminating process based on each of the input information, and if it is acceptable to translate, sends it to the OK double signal search circuit 7, and determines that the word to be translated is not stored in the dictionary memory 8. If N0FOUND (N, F,
...not found) is output to the control section. When the search circuit 7 receives an OK signal from the discrimination circuit 10, it reads the translation for the word held in the word register 9 from the dictionary memory 8 into the translation register 1.

The data read into the translation register 11 is sent to a display section (not shown) and displayed. In addition, each of the above circuits is
The operation is controlled according to control commands from the control unit 12.

Next, details of the modified circuit 3 will be explained with reference to FIG. In FIG. 2, numeral 2 is a register that holds input data from input buffer 2, and the held data is transferred to register 6.

In this case, a gate circuit 22 is interposed for the lower three digits of the register 21. Further, the data held in the lower three digits of the register 21 is sent to the comparison circuit 23. moreover,
The end-of-word information read from the first ROM 4 is input to the comparison circuit 23 via the register 24. Then, the comparison circuit 23 compares the endings of 1 to 3 characters according to the number of comparison characters sent from the control circuit 25, and
The comparison result is output to the control circuit 25. Further, a mismatch signal from the search circuit 7 is input to the control circuit 25 . The control circuit 25 controls the reading of the first ROM 4 and the second ROM 5, and also provides a read signal to the dart circuit 22 and the register 21.2.
4 and register 26[-1=provides a sort signal. This register 26 has a two-digit configuration, and the ending information read from the second ROM 5 is sent to the register 60 via the gate circuit 22.
Write in the 2nd and 3rd digits. Therefore, the control circuit 25
Whenever a mismatch signal is sent from the search circuit 7, the ending information is read from the first ROM 4 and sent to the comparison circuit 2.
3 and gives a control command to the discrimination circuit 10 according to the comparison result. If the corresponding word is not found, N,
F. Output a signal.

Next, the operation of the above implementation will be explained. In the English to Japanese translation mode, when an English word is input from the key input section 1, this input data is held in the input buffer 2 and sent to the display section for display. Then, when the translation key is operated in the key human power unit 1, translation processing is started according to the flow shown in FIG. First, the deformation circuit 30
A cent signal is sent from the control circuit 25 to the register 2),
The input data held in the input buffer 2 is stored in the register 21.

At the same time, the control circuit 25 outputs a dart signal to the gate circuit 22 to open all digits (r-) of 93 digits. As a result, the input data set in the register 21 is sent directly to the search circuit 7 via the register 6.

As a result, the search circuit 7 starts operating and searches the dictionary memory 8 by referring to the data held in the register 6. In this first search, step S1 in FIG.
If there is a word that matches the input data as shown in
The search circuit 7 reads the translation for the word from the dictionary memory 8 into the translation register 1 and displays it on the display section. If the target word is not written in the dictionary memory 8, the search circuit 7 outputs a mismatch signal to the transformation circuit 3 and proceeds from Stella f81 to Stellaf O8 and the following processing,
In the transformation circuit 3, the endings of inflections are removed from the input data, and endings such as y*fe+e are added as necessary. That is, when the deformation circuit 3 receives a mismatch signal from the search circuit 7, the control circuit 25 causes the deformation circuit 3 to change the first memory 4.
is accessed, and the word ending information "l!l" written in the first address is read out to the register 24 and sent to the comparison circuit 23, where it is compared with the word ending of the input data held in the register 21.

If the ending information read from the first RUM 4 is one character, the control circuit 25 gives the comparison circuit 23 the number of characters "1". When the comparison circuit 23 receives the number of characters "1" from the control circuit 25, it compares the data held in the T position 1 digit of the register 21.24 and outputs the comparison result to the control circuit 25. If the comparison result of the control circuit 25171 and the comparison circuit 23 is non-coincidence, as shown in step 83 and subsequent steps, the ending information from the lIζOM4 is sequentially read out to the register 24 and sent to the comparison circuit 23, and a coincidence comparison is performed. 7. If all of the word ending information stored in the first ROM 4 does not match, it is assumed that there is no corresponding word, and N,
F. Output the signal to the control circuit 25. If a match is detected in the comparison circuit 23, the control circuit 25
controls the dart circuit 22 according to the number of characters at the end of the inflectional word,
The word data excluding the inflectional ending is transferred from the register 2 to the register 9, and is input to the discrimination circuit 10.

In this case, for example, step 84. In step S5, if the matching declension ending is r ies + J or r ied J, the ending of ryJ is added; in step S5, if the matching declension ending is rve@J, the entire ending of "fe" is added;
Stella 7'81. The matching declension ending is [ing J
In this case, add the ending of reJ.

For example, if the word endings r les J match in step S4, the control circuit 25 reads the word ending information ryJ from the second ROM 5 into the upper digits of the register 26, and then closes all digits of the digits of the dart circuit 22 for the register 21. In this state, the data held in register 2) is transferred to register 6. As a result, the input data minus the ending of r Ies ] is set in register 6.Furthermore,
The control circuit 25 opens the gate circuit 22 for the upper digit of the register 26 and sets the end of the word fff information held in the register 26 in the register 6. As described above, the processing of l"-1esJ, r+yJ is completed for the input data held in the register 21. The processing of the other step 8B + Ss * Sto is performed in the same manner. Then, the control circuit 25 When a match signal is sent from the comparison circuit 23 in the processing of steps S1 to StO, it sends a control signal to the discrimination circuit 10 according to the processing step, and performs the steps shown in FIGS.
) is performed. In other words, Ste, ZoS
If there is a match in steps 2 to S5, the process in FIG. 4(a) is performed;
If they match in step S6, the process shown in FIG. 4(b) is performed, and if they match in SIO, the process shown in FIG. 4(c) is performed. On the other hand, when the data transformed by the transformation circuit 3 is set in the register 6, the search circuit 7 searches the dictionary memory 8 and sends a mismatch signal to the transformation circuit 3 if there is no corresponding word. When the deformation circuit 3 receives a mismatch signal from the search circuit 7, it manually performs the step where the match was detected last time.
Start processing. In addition, when the search circuit 7 finds the target word through the above search, the search circuit 7 sends the word to the dictionary memory 8.
The word and part-of-speech information are read from the word register 9,
It is given to the discrimination circuit 10. At this time, step S! from the transformation circuit 3 to the discrimination circuit 10! If a signal indicating a match is given at ~Ss, the discrimination circuit 10 performs the process shown in FIG.
), it is determined whether it is a verb or not based on the part of speech information, and if it is a verb, it is sent to the OK double signal search circuit 7. When the search circuit 7 receives the OK signal from the discrimination circuit 10, it reads the translation for the word set in the word register 9 from the dictionary memory 8 into the translation register 11, and displays it on the display section. In addition, the above step Sat
If it is determined that it is not a verb, step 81
Proceeding to step m, it is determined whether or not there is a noun, and if it is a noun, it is given to the OK double signal search circuit 7, and if it is not a noun, the N, F, signals are output. If the discrimination circuit 10 receives a signal from the transformation circuit 3 indicating a match in step 6, it proceeds to step 831 shown in FIG. '8J,re++'
.

In the case of r ies J, r yes J, it indicates a change of verb or noun, so step sat l
The determination is made in step 822.

Further, if the discrimination circuit 10 receives a signal indicating a match from the transformation circuit 3 in step S6, the process proceeds to step 831 shown in FIG. 4(b), and judges whether the part-of-speech information is a verb or not. , if it is not a verb, outputs the N, F signal. If it is determined in step Sat that it is a verb, the process proceeds to step S32, where it is determined whether the ending of the basic word is reJ or not, and if it is not reJ, an N, F signal is output.

-17, If S3□ determines that the ending of the basic word is reJ, the discrimination circuit 10! At 70, a signal is output to the search circuit 7. In other words, the declension ending is "d"
And if the basic word ends in reJ, it is the past tense of the verb, so that determination is made using Stella 7' S 31+832.

Further, the discrimination circuit 10 is configured to select from the transformation circuit 3 the Stella 76S.
If a signal indicating a match is given in steps 7 to 810, the process proceeds to step 841 shown in FIG. 4(C);
It is determined whether the part-of-speech information is a verb or not, and if it is not a verb, an N or F signal is output, and if it is a verb, it is output to the OK double signal search circuit 7. In other words, the declension ending is “ad J
, r led J .

In the case of r 1ngko, it shows a change in the verb, so
The determination is made in step 841.

In the above-mentioned embodiment, the description of adjective inflections was omitted, but the inflection can be converted and translated in the same manner as in the case of nouns and verbs described above. In addition, in the case of adjectives, there are cases where the declension ending is 4 characters, such as [1est J, but the inflection can be converted by configuring the control to be performed on the lower four digits of register 2). .

As described above, according to the present invention, for regularly changing words, the basic form is obtained by sequentially deleting the characters at the end of the word. It is something that can be found and translated, and can have extremely great practical effects.

[Brief explanation of the drawing]

The drawings show one embodiment of the present invention, and FIG. 1 is a circuit configuration diagram, FIG. 2 is a circuit configuration diagram showing details of a modified circuit in FIG. 1, and FIGS. (c) is a flowchart showing the operation contents. 0 1... Key human power section, 2... Input buffer, 3...
Deformation circuit, 4...1st ROM15...2nd ROM,
7...Search circuit, 8...Dictionary memory, 21.24
．． 26...Register. Applicant's representative Patent attorney Takehiko Suzue Figure 2 ROM4 ROM4 ROM5 FIOM5jI3 Figure
Figure 4

Claims (1)

[Claims] In an electronic translator that stores words in a first language and words in a second language in a dictionary memory and searches the dictionary memory for the input word to read out the words to be translated, words whose rules change a word ending memory that stores declension endings of a regular declension word; a comparing means that sequentially reads out declension endings from the word ending memory when an inflection form of a regular declension word is input and compares the declension endings with the endings of the input word; A word form conversion method for an electronic translator, comprising means for deleting the matching declension ending from the input word to obtain a basic form when a match detection signal is output from the means.