TRANSLATION SYSTEM

Abstract: A translation system performing translation from a first language into second language under an interaction mode between said translation system and an operator, compris­ ing means for inputting original sentence to be translated, means for translating the input sentence of said first language into output sentence of said second language, wherein the operator inputs information relating to at least one word of the input sentence such as part of speech or then the translation is performed on the basis of said input information.

Description: The present invention relates to a translation system, and more particularly to a bilingual translation machine performing translation from a first language into a second language and comprising means for inputting an original sentence to be translated and means for translating the input sentence of said first language into an output sentence of said second language. In general, a bilingual translation using a translation machine is performed in a manner shown in Fig. 1, wherein the original sentence of a language to be translated must be analyzed in various ways in the process of translation in a translation machine. These analyses can be classified into morpheme analysis, sentence construction analysis or syntax analysis and meaning analysis. The morpheme analysis is to classify each of the words into the person, number and sequence of the sentence by referring the grammatical information and translation information and a part of speech from a dictionary contained in the translation machine. The sentence construction analysis is to analyze the construction of the sentence by checking the grammatical relation of each of the words. The meaning analysis is to determine correct analysis and incorrect analysis on the basis of a plurality of sentence construction analyses. The machine translation is made by performing the morpheme analysis, sentence construction analysis and the meaning analysis up to a predetermined level to obtain an internal construction of the sentence of the original language and thereafter the machine converts the inner construction of the original language into an internal construction of the sentence of the translation language corresponding to the predetermined level, then the machine generates the output translation of the desired language. The accuracy of the translation in the machine depends on the degree of the predetermined level of the analysis. The translation made by using only the morpheme analysis can not realize the translation of the sentence basis, and the translation is limited to the word basis translation as performed in a handy type electronic translator. A translation machine performing the morpheme analysis and the sentence construction analysis can translate with a grammatical correctness, but generates a plurality of translation results, so that the operator must select the correct translation among them, therefore the works of the operator increases. The translation machine performing up to the meaning analysis is theoretically able to output only one correct translation result, but there must be provided a great deal of information in the translation machine, therefore it may be impossible to manufacture such translation machine. The present invention is directed to the translation system of performing up to the sentence structure analysis. The translation system according to the present invention can perform translation by a sentence basis and can produce all of grammatically correct translations. Fig. 2 shows a typical translation system, wherein there are provided a processor 1, key board 2 having a plurality of keys for inputting necessary data to the processor 1, a memory 3 for storing the data relating to the processor 1, a display unit for displaying the results obtained by the processing in the processor 1 and a translation module 5 for storing various information necessary for translation. The translation module 5 contains an original sentence buffer 51 for storing inputted original sentence, a dictionary buffer 52 for storing the result of consulting the dictionary, a sentence analysis buffer 53 for storing the result of analysis of the sentence structure of the original sentence, sentence output buffer 54 for storing the content of the sentence analysis buffer 53 in the form of the output language, a result buffer 55 for storing the result of the morpheme generation of the output language and a table including a dictionary, rule of grammar used in the translation machine and so on. Figs. 3 (1) to 3 (3) show the contents stored in the buffers 51 to 55 when the input sentence is Time flies like an arrow. Fig. 3 (1) shows the contents of the original sentence buffer 51 and dictionary buffer 52. The dictionary buffer 52 takes the grammar information and translation information such as a part of speech corresponding to the input word stored in the original sentence buffer 51. In the sentence analysis buffer 53 shown in Fig. 3 (2), the sentence structure is analyzed according to the information of the part of speech defined for each word. Fig. 3 (3) shows the content of the sentence analysis buffer 53 and result buffer 55, wherein the result of the conversion of the content of the sentence analysis buffer 53 into the information for the output language is stored in the sentence forming buffer 54. Figs. 4 (1) to 4 (3) show an example of display of the display device of the conventional translation machine. As shown in Fig. 4 (1), when the sentence to be translated is inputted , the result of the translation is displayed as shown in Figs. 4 (2) and 4 (3). The translated sentences as shown are the results of the translation performed under recognition of the parts of speech of each word as shown in the table 1 in which result of translation of Japanese and German are listed. The translations are correct so far as the grammatical rule concerns. Apparently, man can determine that the translation shown in the item 5 is correct. However, the translation machine can not determine which translation is correct. If the meaning analysis is perfect, the translation machine can output the translation of the item 5. However in order to make the correct translation, it is necessary to store the following information with respect to the meaning analysis, (a) an arrow does not resemble a fly, (b) an arrow is not provided with an ability of measuring time, (c) it can not considered that a fly likes an arrow. Apparently it is almost impossible to store all the information of the real world in the translation machine, Accordingly, in the conventional translation machine, there have not been avoided to produce several translated sentences having different meanings from one input sentence although only one translation should occur from one input sentence. Since there occur several translations occur in the conventional translation machine, the operator of the translation machine must repeat several operations for obtaining a correct translation, Furthermore, in the machine translation, all possible solutions of the translation are searched and the translation machine acts to obtain all possible solutions, whereby it takes much time to obtain the correct translation. Therefore, the conventional translation machine acts to output each of the solutions every time a solution is found. Accordingly, in the case shown in Figs. 4 (1) to 4 (3), for example, when the first solution shown in Fig. 4 (1) is displayed, the operator can not know how many solutions remains. Therefore, the conventional translation machine has another disadvantage that the operator can not estimate how many times he must operate the translation key at most for obtaining the correct solution in addition to the disadvantage that frequent operation of the translation key for obtaining the correct solution is necessary. These disadvantages bear mental burden on the operator. Thus, it is desired to decrease number of operation of the translation key for obtaining the correct solution. In FR-A-2 446 517 from which claim 1 starts, there is disclosed a translation system in which each word of an original sentence to be translated and inputted through a key board is transformed to data comprising a word information and a coded information. For example the coded information relates to a memory address at which an information concerning the syntax and a translation of the word of the original sentence are stored. The syntax information and, thus, the coded information are achieved by the syntax analysis which leads to a plurality of possible results. Among these results the "correct" one must be identified. In what way this is done is not disclosed in the above reference. Basically, the two above mentioned methods are given in that either all translations according to the possible variations in syntax of the original sentence are generated or only one translation is generated for which a detailed meaning analysis with many information concerning the meaning of the words also with regard to their positions in the original sentence are necessary. Therefore, the disadvantages of the known translation machine are the same as in case of the known systems mentioned above. From EP-A-138 619 which relates to a European patent application filed before but published after the instant invention and which is cited according to Art 54 (3), a sentence forming apparatus is known in which a plurality of semantically equivalent sentences are formed simultaneously in a plurality of languages by a conversational system. In this apparatus a first matter or sentence in a first or source language is converted to a second sentence in a second or target language. However, the first sentence is not inputted into the apparatus directly by the operator. The matter to be translated is inputted in the apparatus by successively selecting one of a plurality of options listed in successive selection menues, respectively, generated by the apparatus according to previously selected options and displayed at a display means. At the beginning of such a selection-menue-controlled input operation, the operator must select among several expression image keys which field or theme the matter to be translated relates to. After having selected the correct field, the apparatus successively outputs a plurality of questions and simultaneously gives several answers for each question among which the operator can select that answer which relates or at least most closely relates to the matter to be translated. By means of this "question and answer process" the apparatus itself forms a sentence which should reflect the matter to be translated. Thus an input means for (directly) inputting an original sentence through the operator by means of character keys or the like is not provided in the known apparatus. By means of the above-mentioned selection-menue-controlled input operation, the apparatus itself generates information concerning the content of action (verb), the subject of action (subject noun), the object of action (object noun), and the tense in an internal expression storage control device. However, this information is not directly inputted by the operator and the amount as well as the kind of information generated by the apparatus cannot be controlled by the operator. In contrast the amount and kind of information are determined by the menue-controlled input operation itself which in turn is determined by the matter to be translated because the operator must successively enter ever more specified selection menues as necessary for indirectly inputting each word of the sentence representing the matter to be translated. However, in order to generate the correct translation it is often sufficient to merely input information relating to one or some words of the source sentence. Accordingly, the known apparatus is neither provided with an input means for directly inputting an original sentence to be translated nor an input means for directly and interactively inputting various information through the operator relating to at least one word of the input sentence. It is the object of the invention, to provide a translation system which is able to easily obtain a correct solution of the translation with a descreased number of key operation. This object is solved according to the invention by a translation system having the features mentioned in claim 1. Preferred embodiments of the invention are characterized by the features of the subclaims each. Fig. 1 is a block diagram showing a process of a bilingual translation, Fig. 2 is a block diagram of a translation machine used in the present invention, Figs 3-(1) to 3 (3) are schematic diagrams showing the conventional way of storing various informations in the buffers used in the translation machine, Figs. 4 (1) to 4 (3) are schematic diagram showing various outputs of the result of translation in the conventional translation system, Fig. 5 is a flow chart showing operation of the translation system according to the present invention, Figs. 6(1) to 6 (4), 7 (1) and 7 (2) and 8 (1) to (5) are respectively schematic diagrams showing examples of the display according to the present invention, Figs. 8 (1) to 8 (3) are schematic diagrams showing the way of storing various informations in the buffers according to the present invention, Figs. 9 (1) to 9 (3) show the contents of the buffers used in the translation system according to the present invention, Fig 10 is a flow chart showing another embodiment of the present invention, Figs 11 and 12 are respectively schematic diagrams showing examples of the display employed in the embodiment shown in Fig. 10, Fig. 13 is a flow chart showing a still further embodiment of the present invention, Figs. 14 to 16 are schematic diagrams showing examples of the display used in the embodiment shown in Fig. 13, Fig. 17 is a flow chart showing a still further embodiment of the present invention, Figs 18 to 20 are schematic diagram showing examples of the display used in the embodiment shown in Fig. 17, and Figs 21 and 22 are flow charts showing still further embodiments of the present invention. Fig. 2 shows a typical translation system, wherein there are provided a processor 1, key board 2 having a plurality of keys for inputting necessary data to the processor 1, a memory 3 for storing the data relating to the processor 1, a display unit 4 for displaying the results obtained by the processing in the processor 1 and a translation module 5 for storing various information necessary for translation. The translation module 5 contains an original sentence buffer 51 for storing inputted original sentence, a dictionary buffer 52 for storing the result of consulting the dictionary, a sentence analysis buffer 53 for storing the result of analysis of the sentence structure of the original sentence, sentence output buffer 54 for storing the content of the sentence analysis buffer 53 in the form of the output language, a result buffer 55 for storing the result of the morpheme generation of the output language and a table including a dictionary, rule of grammar used in the translation machine and so on. According to the present invention there are provided a plurality of keys in the key boad 2 including keys for inpuitting vaious information of the sentence such as keys for inputting parts of speech, for examples noun, verb, adverb or the like, name of the elements of the sentence such as subject, object adverbial phrase and so on. The operation of the translation system according to the present invention is explained with reference to Fig. 5. In the step n1, a sub candidacy flag (SC flag) is reset prior to the input of the original sentence to be translated. The sub candidacy flag represents an error when no translation solution is obtained even if possible sentence construction analyses are made using possible combinations of the part of speech of each word of the original sentence. When the word of the original sentence is input by the key board 2, it is judged in the step n 2 whether the signal thus entered is the word input or the instruction from the translation key for starting the translation. With the word input, the word thus entered is displayed on the display device 4 through the processor 1, which transfer the character code of the word to the translation module 5. The character code of the word is stored in the original sentence buffer 51, and the translation module 5 performs the morpheme analysis consulting the dictionary in the step n4. According to the present invention, an instruction for designating the kind of the part of speech of the input word (referred to as PSD instruction hereinafter) can be entered by the operator at the time of inputting the word. Presence or absence of the PSD instruction is judged in the step n5. With absence of the PSD instruction, the step moves to n8. With presence of the PSD, the step moves to n6 wherein the name of the part of speech of the word is displayed on the display device 4 and the word or words which are taken from the dictionary but are not designated by the PSD instruction are excluded in the step n7. In the flow charts, UPS is abbreviation of undesignated part of speech and PS is part of speech. In case the PSD instruction, is absent in the step n5, all the results taken out of the dictionary corresponding to the input word are stored in the dictionary buffer 52 in the step n8. In case the PSD instruction is present in the step n5, the content of the dictionary buffer 52 becomes only the results corresponding to the part of speech designated by the input PSD instruction. In case of absence of the PSD instruction while the words of the original sentence are consecutively entered, the steps n2, n3, n4 n5 and n8 are repeated and in case of presence of the PSD instruction while the words of the original sentence are consecutively entered, the steps n2, n3, n4, n5, n6, n7 and n8 are performed and returns to the step n2 and the operation is repeated. When the input of the original sentence is completed, and it is in the step n2 judged that the translation instruction due to operation of the translation key is present, the step advances to n9, wherein the combination of the part of speech is initially set and the step advances to n10. In the step n10, the sentence construction analysis is performed referring to the analysis rules of the table 56 and the sentence analysis buffer 53 is completed. In the step n11, it is judged whether or not the sentence construction analysis (referred to as S.A. in the flow chart) is successful. When the sentence analysis is successful, the step goes to n12, wherein the conversion of the sentence construction is made referring to the conversion rule and generation rule stored in the table 56 of the translation module 5. Subsequently, the formation of the sentence construction is made in the step n13 to complete the sentence forming buffer 54. Then the result buffer 55 is completed and the content of the result buffer 55 is displayed by the display unit 4 in the step n15. Subsequently it is judged in the step n16 whether or not the key input of the sub candidacy for forming the sub candidacy. With the presence of the sub candidacy input, a sub candidacy flag is set in the step n17. Thus the sub candidacy flag is set when the operator requests another translation after a translation is once completed. Then the process is returned to n10 from n17 for the sentence construction analysis, the sentence analysis buffer 53 stores the previous combination of the part of speech and the result of the previous sentence construction analysis, so that the translation machine according to the present invention is provided with the function of searching a further result of the sentence construction analysis which is different from the previous sentence construction analysis. If there is no different analysis of the original sentence for the different combination of the part of speech, it is judged that the sentence analysis is failure, and the process advances from n11 to n18. In the step n18 it is judged whether or not the sentence construction analyses are completed for all of the combinations of the part of speech. In case the sentence construction analysis for all combinations of the part of speech is not completed, the process is moved to n19, wherein a new combination of the part of speech is formed and in turn the sentence construction analysis in the step n10 is performed. When the sentence construction analysis is successful, the steps n11 to n15 are performed. On the contrary the sentence construction analysis thus performed is still unsuccessful, the step goes to n17 from n16 and to n10 again by the instruction of the sub candidacy entered by the operator. In this case if there is another solution for the same combination of the part of speech, the process of the steps n11 to n15 are performed. If the result of the analysis is again unsuccessful, the process moves to n17 from n16 by the instruction of the operator, and in the step n10 the sentence construction analysis is performed. In general, when there occur two different results of the analysis for the same combination of the part of speech, the steps n17, n10, n11, n12, n13 n14 and n15 and the result of the operation can be performed with the results displayed, waiting the instruction of the operator. In case there is only one result of the analysis for the combination of the part of speech, the steps n17, n10, n11 and n18 are performed. Then it is judged whether or not the sentence construction analysis for all combinations of the part of speech are completed, and if it has not been completed, the new combination of the part of speech is formed in the step n19 and the process returns to n10. If the sentence construction analysis is successful for the new combination of the part of speech, the steps n11, n12, n13, n14 and n15 are performed and the result of the sentence construction analysis is displayed and the machine waits the subsequent instructions of the operator. If the sentence construction analysis is unsuccessful, the process moves to n18 from n11 and it is judged whether or not the sentence construction analyses for all combinations of the part of speech are completed. In case the sentence construction analysis is successful and a correct translation is obtained, the step is moved to n22 from n16. Then it is judged in the step n22 whether or not a further sentence is input. If subsequent sentence is input, the process goes to the step n1, to the contrary, if no sentence is input, the translation is finished. In case it is determined in the step n18 that the sentence construction analyses are completed for all combination of the part of speech, the process moves to n20, wherein it is judged whether or not the sub candidacy flag is set. If the sub candidacy flag is set, the process moves to n9, and if the sub candidacy flag is not set, the process is moved to n21. In case the sentence construction analyses are failure for all combinations of the part of speech, the sub candidacy flag is remained reset since the steps are circulated in the loop of n10, n11, n18, n19 and n10. In this case the error is displayed in the step n21. Figs. 6 to 8 show various examples of the display of the result of the translation. Fig 6 is an example when the word " Time " is designated by noun. Fig. 7 is another example when the word "flies" is designated by noun. Fig. 8 is a further example when the word "like" is designated by preposition. In these cases, the designation of the part of speech is made at the time of input of one word. As shown in Fig. 7, in case the word "flies" is designated by verb, only one solution of the translation can be obtained, so that the correct translation can be obtained at the first candidacy. In the present invention, only one word may be designated by a part of speech or a plurality of words may be designated by the plurality of kinds of the part of speech respectively. For example, the word "Time " is designated by noun and the word "like" may be designated by preposition simultaneously. Fig. 9 shows the contents of the buffers 51 to 56. The original sentence to be translated is stored in the original sentence buffer 51 and when the word "like" is designated by preposition, as shown in Fig 9 (1), in the dictionary buffer 52, noun is absent for the word "flies" but verb is present. Under such state, if the word "time" is designated by noun, "flies" by verb, "like" by preposition, "an" by article and "arrow" by noun initially, in the translation module 5 the sentence construction analysis is made as shown in Fig. 6 (2) referring to the rule of analysis stored in the table 56. In this case according to the first construction level, the combination of the part of speech is noun, verb, preposition, article and noun. In the second level, the combination of the part of speech is subject, verb, adverb phrase. In the third level it can be analyzed that with subject and predicate, a sentence can be constructed. Fig. 9 shows the content of the sentence forming buffer 54. The content of the sentence forming buffer 54 becomes subject and predicate in the first level. In the second level, the content of the sentence forming buffer 54 becomes noun phrase, adverb phrase and verb. Thus, the content of the translated sentence is stored in the result buffer 55 on the basis of the sentence formation. As described above, according to the present invention, when the sentence to be translated is entered in the translation machine, the part of speech can be designated for the necessary words, and the translated sentence can be produced according to the designated part of speech. Fig. 10 shows another embodiment of the translation system according to the present invention, wherein interrelation between constructive elements of any words of the input sentence (referred to as construction interrelation hereinafter) can be entered into the translation system and the translation is performed on the basis of the construction interrelation. It is noted that the description of like operations shown in Fig. 5 is omitted. Table 2 shows various examples of the construction interrelation. In the step n55 the result of the morpheme analysis is stored in the dictionary buffer 52 and the step is moved to n56 to judge whether or not there is the instruction of the construction interrelation. With absence of the instruction of the construction interrelation the process returns to n2, while with presence of the instruction, the process goes to n7, wherein the construction interrelation is displayed on the display unit 4. Fig. 11 shows an example of the display to show that the words "Time" and "flies" are in the relation of the subject and verb. In the step n58, the content of the construction interrelation thus instructed is stored in the sentence analysis buffer 53. These operations of the steps n2 to n8 are continued while the input operation of the original sentence is continued. When the input of the original sentence to be translated has been completed and the translation instruction is entered by the translation key, the processes n9 to n11 are performed. If the sentence construction analysis is successful, the process goes to n59 wherein it is judged whether the result of the sentence construction analysis thus obtained in the step n10 complies with the condition stored in the sentence analysis buffer 53. If the result of the sentence construction analysis does not comply with the condition stored in the sentence analysis buffer 53 in the step n58, the process returns to the step n10 to repeat the sentence construction analysis again. If the result of the sentence construction analysis comply with the condition stored in the sentence analysis buffer 53, the process goes to n12 to convert the original sentence into the translated sentence construction so as to obtain the translation. Fig. 11 (2) shows an example of the display of the translation thus obtained by the operations mentioned above. Fig. 12 (1) shows an example of the display by the operation of the step n56 of the construction interrelation instructed by the operator. Fig. 12 (2) shows the result of the translation by the instruction of the construction interrelation showing that the phrase "like an arrow" has a relation of the adverbial modification to the word "flies". The instruction of the construction interrelation may be made in such a manner that two desired parts a and b in the sentence are first designated by region designation operation by the operator, then a direction c of the modification between two phrases is instructed by the key operation and by operation of the instruction of the construction interrelation, the construction interrelation d between two elements of the sentence can be displayed. Although only one construction interrelation is designated in this embodiment, two or more construction interrelation between two elements of the sentence can be designated. Fig. 13 shows a further embodiment of the translation system according to the present invention, wherein the name of the designated element of the sentence can be entered and the translation is performed on the basis of the input name of the element. It is noted that the description of like operations shown in Fig. 5 is omitted. Table 3 shows examples of the name of the element. Referring to Fig. 13, in the step n61 it is judged whether or not the name of the input element of the sentence is input. If the name of the element is not inputted, the step returns to the step n2. If the name of the element is inputted, the step is moved to n62 to display the name thus inputted by the display unit 4. In the step n63, the name of the elements thus designated is stored in the sentence analysis buffer 53. The designated name of the sentence element stored in the sentence analysis buffer 53 is used as the condition for the translation. So far as the input of the original sentence is continued, the steps n2 to n5 and n61 to n63 can be repeated. After input of the original sentence has been completed, the process goes to n64 through the steps n9 to n11 performing the same operation as mentioned with reference to the embodiment shown in Fig. 5. In the step n64, it is judged whether the result of the sentence construction analysis performed in the step n10 comply with the condition stored in the sentence analysis buffer 53. The the step goes to either n12 or n17 depending of the result of the judgement in the step n64. these operation after the step n12 and n17 are the same as those performed in the embodiment shown in Fig. 5. Fig. 14 (2) shows an example of the display of the original sentence and the state that the word "Time" is designated as the subject. Fig. 15 (1) shows an example of the display of the name of the element of the original sentence instructed by the operator in which the word "flies" is designated by the verb. Fig. 15 (2) shows that the phrase "like an arrow" is designated by the adverbial phrase. The instruction of the name of the element of the sentence may be made in such a manner that the operation of a key for designating the element of the sentence causes a cursor to move by every word and the name of the element designated by the cursor is displayed. In Fig. 15 (2) only the name of verb of the element for the word "flies" is designated. In this example, the correct translation can be solely obtained by designating the name of the part of speech of only one word of "flies". In case the phrase "like an arrow" is designated by the name of adverbial phrase, the correct translation can be obtained through two candidacies as shown in Figs. 16 (2) and (3). Two or more number of names of the elements of the sentence may be designated. For example, it is possible to designate the name of the elements of "Time" as subject and "like an arrow" as adverbial phrase. Referring to Fig. 17 showing a still further embodiment of the translation system according to the present invention, wherein after the morpheme analysis in the step n4 of the embodiment shown in Fig. 5, the primary part of speech of the input word which is the result of consulting the dictionary is displayed in the display unit 4 in the step n71. Subsequently, it is judged in the step n72 whether or not the displayed primary part of speech of the input word is accepted by the operator. Acceptance or correction of the displayed part of speech can made by operating the keys 8 or 9. If the instruction of the acceptance or correction by the keys 8 or 9 is absent, the process goes to n76 to eliminate the display of the part of speech of the input word. If the instruction of the acceptance or correction is present, the step goes to n73 to display the accepted or corrected part of speech. Then the parts of speech except for the accepted or corrected part of speech are eliminated from the result of the consultation of the dictionary, then the content of the dictionary buffer 52 becomes only the part of speech thus accepted or corrected. In the examples shown in Fig. 18, the operator accepts the noun which is displayed as the part of speech of the word "time". then the verb, the part of speech of the word "Time" except for the noun, is eliminated. Since the verb is excluded from the part of speech stored in the dictionary buffer 52, the results of the translation are those shown in Figs. 18 (5) to (7). Thus, the solutions shown in the items (iii) and (vi) of the table 3 are excluded, so that the number of the operation of the keys 6,7,8 and 9 can be decreased by two times. Figs. 19 and 20 show further examples of the display on the display unit 4 according to this embodiment. In Figs 19 (1) and 20 (1), the input words and the name of the part of speech in the step n71 are displayed. Figs. 19 (2) and (3) show that the result of correction by the operator from the noun of the displayed part of speech for the word "flies" to the verb. Figs. 20 (2) and (3) show the result of the acceptance by the operator for the displayed part of speech of the preposition for the word "like". Figs. 19 (4) and 20 (4) show the original sentence and the respective parts of speech for the words of the original sentence. In case the part of speech of the word "flies" is corrected into the verb, the result of the translation becomes as shown in Fig. 19 (5), so that one correct translation can be solely obtained. In case the word "like" is designated as the preposition, the results of the translation are as shown in Fig. 20 (5) to (8), so that the wrong translation of the item (4) in the table 3 can be excluded, so that the number of key operation can be decreased one time. In this embodiment, the operation of the instructions of acceptance and correction against the displayed part of speech may be made two or more words. For example, in the embodiment shown in Fig. 18, after input of the acceptance instruction of the noun for the word "Time" is made another acceptance instruction of the preposition for the word "like". Although the name of the part of speech of the word stored in the dictionary buffer 52 is displayed and the operator accepts the desired part of speech, it may be employed to input the name of the part of speech of the word by the operation of the key by the operator, so that the translation is made on the basis of the part of speech thus inputted. In this modification, the inputted part of speech may not be stored in the dictionary buffer 52. Referring to Fig. 21 showing a still further embodiment of the translation system according to the present invention, wherein the processes of the steps n72 to n74 shown in Fig. 17 are put after the process of the display of the content of the result buffer 55 performed in the step n16 with the steps n76 and n77 added. In the step n76, each of the part of speech of each word in the sentence analysis buffer 53 is displayed. In the step n77, the combination of the parts of speech of the words are arranged again. Referring to Fig. 22, showing a still further embodiment of the translation system according to the present invention, wherein processes of the steps n80 to n 83 are put after the step n15 shown in Fig. 10. In the step n80, the names of the elements of the sentence to be translated is displayed. In the step n81, it is judged whether or not an instruction of the sentence element is present. With yes in the step n81 the step goes to n82 wherein the name of the element of the sentence thus instructed is displayed. In the step n83, the name of the element of the sentence thus instructed is stored in the sentence analysis buffer 53, then the step goes to the step n18. Although various embodiments are described, othe modification of the translation system of the invention may be made by combining input operations mentioned above. For example, in the embodiment shown in Fig. 12 in place of designating the name of the element of the sentenc, the name of parts of speech and so on may be used. Also, the translation system according to the present invention can be applied to bilingual translation between two languages such as English to German, German to French or the like.

Claims: Translation system for performing a translation from a first language into a second language, comprising means (2) for directly inputting an original sentence to be translated, means (5) for translating the input sentence of said first language into an output sentence of said second language, said means (5) for translating executing the steps of consulting a translation dictionary with respect to every word of the input sentence, morphemic analysing for obtaining grammatical data such as a part of speech and an equivalent of every word of the input sentence, constructional analysing for determining the construction of the input sentence such as the interrelation of the words of the input sentence and generating the output sentence according to the results of the forgoing analyses, and display means (4), characterized in that the means (2) for inputting includes keys for directly interactively inputting various information through the operator relating to at least one word of the input sentence, such as keys for inputting the part of speech of the word (noun, verb, adverb or the like) and/or name of the element of the word within the sentence (subject, object, adverbial phrase or the like) and/or the interrelation of the construction of the sentence of at least between two words or phrases of the input sentence, said means (5) for translating using said interactively inputted information when generating the output sentence. Translation system according to claim 1, characterized in that the translation is performed after judgement of whether or not the operator accepts or corrects said information. Translating system according to claim 1 or 2, characterized in that said input information can be displayed on said display means (4).

Inventors: ASANO, HAZIME, KUGIMIYA, SHUZO, MIYAO, KOUJI, SUZUKI, HITOSHI, TAKIGUCHI, YASUHIRO, TOKUNAGA, SHINJI
Applicants: SHARP KABUSHIKI KAISHA
Application year: 1985
Main classification: G06F15
IPC codes: G06F17