JP2000163421A - Translating device and computer-readable recording medium where translation processing program is recorded - Google Patents

Abstract

PROBLEM TO BE SOLVED: To obtain a device which performs a process as an operator intends without performing any uniform translating process and easily obtains a natural translation corresponding to a 1st language sentence by selecting a specific process and processing a rewritten character string among character strings of the 1st language as a source language, and then generating the translation. SOLUTION: The translation is generated after the written character string among character strings of the 1st language as the source language is processed by selecting the specific process. A CPU 12, a ROM 40, etc., are connected to the translating device 10 through a bus line 14. The ROM 40 is stored with a rewriting program 46 which processes an object rewritten character string (object character string to be corrected) as an object of correction in the original text according to the specific process, a composing program which puts together character strings other than the object character string to be corrected and the character string obtained by processing the object character string to be corrected as specified, etc. Then the translating device 10 puts only the corrected part together with parts of English sentences corresponding to uncorrected character strings after translation, word translation, or Roman-character conversion or as they are.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a translation device using a template and a computer-readable recording medium recording a translation processing program.

[0002]

2. Description of the Related Art Conventionally, in the translation of a standard sentence such as a greeting, a template document called a template which is almost completed in a first language is shown, and an operator modifies the template document in the first language and automatically converts it. There has been a translation device that performs a machine translation using a template that can easily obtain a target translation in a second language by performing translation. By performing translation using such a template, the operator can obtain a predetermined translated document by correcting or entering only the necessary items of the template.

[0003]

However, if the template document of the first language is converted into a natural fixed-form sentence that is easy to understand and edit, the operator partially corrects the first-language sentence and converts the entire first-language sentence. When re-translated completely, the grammar of the first language and the grammar of the second language are different, so natural sentences in the first language are not necessarily natural sentences in the second language, and translations not intended by the operator There was a problem that resulted.

On the other hand, if a template document of the first language is created so as to be correctly translated into a natural second language, there is a problem that the first language is unnatural and difficult to understand.

In the case of translating from the first language to the second language, for example, there is a case where it is desired to convert a specific proper noun into a Roman alphabet without translating it. In such a case, there is a problem that the operation may be contrary to the intention of the operator.

Further, there has been a problem that it is difficult for an operator to find a portion to be corrected of the template document in the first language, which results in omission of correction or omission of description.

The present invention solves the above-mentioned problems. If a part guided by a translation device is sequentially edited and selected by a natural input sentence in a first language, the translation is not uniformly performed by the operator. Provided is a translation device for performing a machine translation process capable of easily obtaining a natural translation corresponding to the first language sentence in which a process according to an intention is performed, and a computer-readable recording medium recording a translation processing program. The purpose is to do.

[0008]

In order to achieve this object, the translation apparatus according to the first aspect of the present invention provides a character string composed of a first language as a source language and a character string corresponding to the first language as a target language. A bilingual sentence storing means for storing a bilingual sentence paired with a bilingual character string, a translation dictionary for translating from a first language to a second language, and a character string comprising a first language constituting the bilingual sentence Rewriting character string information storage means for storing, as a table, positional information of a rewritten character string to be rewritten and a character string composed of a second language to be rewritten corresponding to the rewritten character string; Rewriting character string display means for displaying, on a display device, a pointer indicating the rewriting character string specified in the character string of a sentence, processing selecting means for selecting a processing method of the rewriting character string, and the rewriting character string To the processing selection means Ri, characterized in that it comprises a rewrite string processing means for performing selected processing.

In the translating apparatus according to this configuration, a rewritten character string is selected and processed from a character string composed of the first language, which is the original text, to generate a translated text. Can perform desired processing other than translation. Therefore, the inconvenience of being uniformly translated can be eliminated, and a translation desired by the operator can be generated.

According to a second aspect of the present invention, in addition to the configuration of the first aspect, when translating the bilingual sentence, only the rewritten character string is processed by the processing method. It is characterized by being targeted.

[0011] The translation apparatus according to this configuration can translate only the necessary parts without breaking the highly completed translations of the parts other than the rewritten character strings. Therefore, by correcting an easy-to-understand original sentence, it is possible to obtain a translated sentence with a high degree of perfection.

According to a third aspect of the present invention, in addition to the configuration of the translation apparatus according to the first or second aspect, the processing method of the rewritten character string is performed without conversion as a character string of the first language. A translation process of translating from the first language to the second language, a word translation process of translating a character string of the first language into a corresponding word of the second language in that order, It is characterized in that it includes any two or more processes of a Roman character conversion process of writing a language in Roman characters in a second language.

In the translation apparatus according to this configuration, it is possible to provide a translation apparatus capable of performing processing suitable for a rewritten character string in addition to performing uniform translation.

According to a fourth aspect of the present invention, in addition to the configuration of the translation apparatus according to any one of the first to third aspects, when there are a plurality of the rewritten character strings, one operation is performed by a predetermined operation. Pointer moving means for moving the pointer from a rewritten character string to another rewritten character string is provided.

In the translating apparatus according to this configuration, when editing the rewritten character string, the pointer indicates the rewritten character string to be edited next without searching for the rewritten character string. Can be higher. In addition, it is possible to prevent omission of editing or the like.

According to a fifth aspect of the present invention, in addition to the configuration of the translating apparatus according to any one of the first to fourth aspects, the rewritten character string information storage means corresponds to each of the rewritten character strings. The rewriting character string processing method is stored.

In the translation apparatus according to this configuration, the processing method can be stored in the rewritten character string information storage means. Therefore, it is possible to store the processing in advance and set it as a default value, or to store when the setting of the processing method is changed. In addition, it is easy to cooperate with the position information of the rewritten character string in the processing.

According to a sixth aspect of the present invention, there is provided a computer-readable recording medium storing a translation processing program, wherein a character string of a first language which is a source language and a character string of a second language which is a corresponding target language. A translation dictionary for translating from the first language to the second language, a rewriting character string for rewriting among the character strings of the first language constituting the bilingual sentence, and the rewriting character A table storing the position information of the character string composed of the second language to be rewritten corresponding to the column and
A procedure for displaying a rewritten character string that causes the display device to display the bilingual sentence and a pointer indicating the rewritten character string specified in the character string of the bilingual sentence, and a process of selecting a processing method for the rewritten character string A selection procedure and a procedure of a rewritten character string process for performing the process selected by the process selection procedure on the rewritten character string are executed.

In a computer-readable recording medium on which the translation processing program according to this configuration is recorded, the computer stores, in the computer, a character string composed of a first language as an original text.
Since the translated sentence is generated after the rewritten character string is selected and processed by a predetermined process, it is possible to execute a desired process other than the translation on the specific character string. Therefore, the inconvenience of being uniformly translated can be eliminated, and a translation desired by the operator can be generated.

According to a seventh aspect of the present invention, there is provided a computer-readable recording medium storing a translation processing program.
In addition to the configuration of a computer-readable recording medium storing the translation processing program according to claim 6, when the computer translates the bilingual sentence, only the rewritten character string is processed by the processing method. It is characterized in that a target procedure is executed.

In a computer-readable recording medium on which the translation processing program according to this configuration is recorded, the computer stores only the necessary parts without destroying the highly-completed translations of the originals other than the rewritten character strings in advance. Processing such as translation can be executed. Therefore, by correcting an easy-to-understand original sentence, a highly complete translation can be obtained.

In a computer-readable recording medium recording the translation processing program according to the invention of claim 8,
In addition to the configuration of a computer-readable recording medium on which the translation processing program according to claim 6 or 7 is recorded, the computer is provided with a method of processing the rewritten character string without conversion of a character string in a first language. A translation process of translating from the first language to the second language, a word translation process of translating a character string of the first language into a corresponding word of the second language in that order, And performing a procedure including two or more processes of a Roman language conversion process of writing a language in Roman characters in a second language.

In the computer-readable recording medium storing the translation processing program according to this configuration, it is possible to cause the computer to execute a translation process for performing a process suitable for a rewritten character string in addition to a uniform translation. .

According to a ninth aspect of the present invention, there is provided a computer-readable recording medium recording a translation processing program according to any one of the sixth to eighth aspects. In addition, when the plurality of rewrite character strings are present, the computer is caused to execute a pointer moving procedure of moving the pointer from one rewrite character string to another rewrite character string by a predetermined operation.

In a computer-readable recording medium storing the translation processing program according to this configuration, when editing a rewritten character string, the computer can store the rewritten character string to be edited next without searching for the rewritten character string. Since the procedure indicated by the pointer can be executed, the work efficiency of the pre-editing of the translation can be improved. In addition, it is possible to prevent omission of editing or the like.

According to a tenth aspect of the present invention, there is provided a computer-readable recording medium recording the translation processing program according to any one of the sixth to ninth aspects. In addition to the configuration, the procedure of storing the rewritten character string information causes the computer to execute a procedure of storing a processing method of the rewritten character string corresponding to each of the rewritten character strings.

A computer-readable recording medium storing the translation processing program according to this configuration can cause a computer to execute a procedure for storing a processing method in a procedure for storing rewritten character string information. Therefore, it is possible to store the processing in advance and set it as a default value, or to store when the setting of the processing method is changed. In addition, it is easy to cooperate with the position information of the rewritten character string in the processing.

[0028]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of a translation apparatus and a translation processing program according to the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram illustrating a main configuration of a translation apparatus 10 according to an embodiment of the present invention. In the present embodiment, a case in which Japanese is translated into English will be described as an example. In the following description, it is assumed here that the original sentence is a character string of a bilingual sentence composed of Japanese and a character string of a bilingual sentence composed of English.

The translation device 10 includes a CPU 12 for executing a translation process and the like, and a ROM 4 storing a computer program for causing the CPU 12 to execute various procedures.
0 and a RAM 50 for temporarily storing computer programs and the like read from the ROM 40 and for temporarily storing the progress of calculations and the like, are interconnected via the bus line 14. Also, an input / output port 16 serving as an interface is connected to the bus line 14, and the input / output port 16 includes an input device 20 for inputting characters for performing correction of Japanese to be translated and the like. A display device 30 for displaying a template 41a including an original sentence and a translated sentence is connected. In the present embodiment, a keyboard and a mouse are used as the input device 20, and a CRT display is used as the display device 30. The input / output port 16 includes a hard disk drive, a flexible disk drive, and a CD-R (not shown).
An external storage device having an OM drive or various lines can also be connected.

Here, the contents stored in the ROM 40 will be described with reference to FIG. In the template database 41 of the ROM 40, a template 41a which is a template document of a bilingual sentence in which a Japanese original sentence of a standard document and an English translated sentence are paired, and the first character of a corrected Japanese portion associated with the template 41a A jump table 41b is stored in which a position and a character length, an English leading character position and a character length obtained by translating the corrected portion, and processing contents are associated in the form of parameters.

The ROM 40 stores a translation dictionary 42 storing data for translating Japanese into English, and a translation algorithm for translating Japanese into English with reference to the translation dictionary 42. A translation processing program 43, a display program 44 for displaying a pointer 41 to a template 41a and a rewritten character string to be corrected in the original text (hereinafter referred to as a correction target character string), and a pointer 33 A pointer moving program 45 for moving to the correction target character string, a rewriting program 46 for processing the correction target character string in accordance with predetermined processing contents,
When the number of characters stored in the jump table 41b is corrected by the rewriting program 46, a replacement program 47 for replacing the number of characters of the corrected character string with a character string other than the correction target character string (hereinafter, a non-correction target character string) ) And a character string obtained by subjecting the correction target character string to predetermined processing (hereinafter, referred to as a processed character string).

Next, the contents stored in the RAM 50 will be described with reference to FIG.
This will be described with reference to FIG. The RAM 50 is a Japanese storage area 51 for temporarily storing a correction target character string, a corrected correction target character string (hereinafter, referred to as a corrected character string), and the like.
And an English storage area 52 for storing a processed character string obtained by processing the corrected character string. RAM5
0 is a template storage area 531 for temporarily storing a template 41a which is read from the template database 41 of the ROM 40 and is composed of a bilingual sentence composed of a Japanese sentence and an English sentence and which is to be subjected to correction processing;
It has a text storage area 53 including a jump table storage area 532 for temporarily storing the jump table 41b read from the template database 41 of M40.

FIG. 2 shows the template 41a.
(A) will be described with reference to FIGS. 4 and 5. FIG. 2 (A)
Is the template 41 of the template database 41
FIG. 3 is a diagram schematically illustrating the content stored in a. Here, Japanese sentences and English sentences are stored in parallel with the sentence numbers, but there is no correspondence between Japanese and English for each part that needs to be corrected. Real association is performed by the jump table 41b. FIG. 3 is an explanatory diagram showing a window 31 for selecting a template 41a. FIG. 4 is an explanatory diagram of the window 32 showing the self-introduction template 41a before correction, and FIG. 5 is an explanatory diagram showing the self-introduction template 41a being corrected.

As shown in FIG. 3, a window 31 for template selection displayed on the screen of the display device 30 includes:
The file names of eight types of templates 41a stored in the template database 41, including inquiries, document requests, self-introductions, instruction manuals, enrollment motives, resumes, travel thanks 1 and travel thanks 2 are displayed. I have. Then, a file having a file name of self-introduction is selected from the file names 31a shown in FIG.
When b is clicked and opened, a window 32 showing a self-introducing template 41a is opened as shown in FIG.

Here, the self-introduction template 41a is
It is configured by associating N Japanese sentences with the English sentence that is a translation thereof.
April 1, 997 "and the English sentence" April 1,199
7 is associated with the Japanese sentence “Dear Ken” of sentence number 2 and the English sentence “Dear Ken”, respectively.

Next, FIG. 2B shows the jump table 4
It is the figure which represented the content memorize | stored in 1b typically. Hereinafter, the jump table 41b will be described with reference to FIG. As shown in FIG. 2B, the jump table 41 stored in the template database 41 of the ROM 40
b is composed of a plurality of numbers and alphabets (hereinafter referred to as parameters). When the text is corrected, the position of the corrected character string and the processing method are recorded by changing each parameter, and the like. Then, it is stored in the jump table storage area 532.

The number of the first parameter in the jump table 41b is the sentence number of 1 to N, and the number of the second parameter is the number of the character from the beginning of the sentence of the character string to be corrected or the corrected character string. The position of the first character of the word, the number of the third parameter is the Japanese character length indicating how many characters the correction target character string or corrected character string is composed of, and the number of the fourth parameter is the correction target character The position of the first character in English that indicates the number of the first character from the beginning of the processed character string that processed the translated sentence or the corrected character string corresponding to the column indicates the number of the fifth parameter. Indicates the English character length that indicates whether it is composed of characters,
The parameter consisting of the last alphabet indicates the processing content indicating how to process the first language at the time of translation.

For example, the jump table 41b shown in FIG. 2B is for the bilingual sentence of self-introduction shown in FIG. 3, and corresponds to the contents of the window 32 showing the self-introduction template 41a of FIG. is there. More specifically, "April 1, 1997" of sentence number 1 shown in FIG.
Corresponds to the uppermost parameter in FIG. 2 (B), and since the entire sentence is a character string to be corrected, the parameter indicating the first sentence number is 1 first, and the second Japanese leading character position is The indicated parameter is 1 since it starts with the first character, and the parameter indicating the third Japanese character length is 9 since there are 9 characters. The parameter indicating the fourth English leading character position is also 1 since it is also from the beginning of the English sentence. And the fifth parameter indicating the English character length is
Since the character length of the English sentence is the number of characters including spaces and symbols, it is set to 12, and the parameter indicating the last processing content is set to the translation process of H so as to translate the entire sentence.

The parameters indicating the processing contents are H,
The template database 41 includes four types of characters T, R, and M, and a predetermined default value is set in the template database 41 of the ROM 40. For example, since the date is always translated as described above, it is set to the translation process of H. This default value can be changed in the text modification step.

The details of this processing will be described below. If the parameter indicating the processing content is “H”, the character string in the first language is translated using a translation algorithm as a translation process. For example, there is a case where a result of translating a character string of the first language “April 1, 1997” into a character string of the second language as “April 1, 1997” is displayed.

In the case of "T", the word translation process is such that words are replaced one-to-one without analyzing phrases, clauses, and sentences.

If the character string in the first language is "Kobayashi" if the character string in the first language is "Kobayashi", the character string in the second language is converted to Roman character and displayed as "Kobayashi" in the case of "R". It is.

In the case of "M", there is a case where the character string in the first language is displayed as it is on the character string in the second language as the non-conversion processing. For example, there is a case where a portion of a character string in the first language displayed as “KEN” in katakana is displayed as it is in a character string in the second language as “KEN” in katakana. Thus, the jump table 41b
In this example, the position of a correction target character string and the like and its processing are stored in association with each other by parameters, so that the processing is extremely easy to understand and easy.

Next, the translation apparatus 1 configured as described above
0 will be described with reference to the flowcharts of FIGS. 6, 7, 8, and 9. First, the flowchart of FIG. 6 is a flowchart showing an outline of the procedure of the process of the translation apparatus 10. When the processing is started as shown in FIG. 6 (start), first, a template 41a corresponding to a document to be created is prepared.
Is selected (step (hereinafter abbreviated as S) 10), the character string to be corrected of the selected template 41a is sequentially corrected (S30), and the corrected text is translated into a template (S60). In this way, a desired document is obtained using the template 41a. The procedure of these processes will be described in detail below.

First, FIG. 7 shows the template selection (S
It is a flowchart explaining the procedure of a process of 10) in detail. First, when the operator turns on the power and starts the program, a window 31 for template selection as shown in FIG. 3 is displayed on the screen, and the template selection process (S10) in FIG. 6 is started (start). An operator operates a cursor movement key provided on the input device 20, or
When a file name 31a of the self-introducing template 41a is selected using a pointing device such as a mouse, and a file open button 31b is clicked or the file name 31a is double-clicked, the CPU 12
Determines that the template 41a is selected (S1
2: YES), the self-introducing template 41a and the jump table 41b are read from the eight types of templates 41a stored in the template database 41 of the ROM 40 (S14), and the read templates 41a are stored in the template storage area 531 of the RAM 50. The related jump table 41b is stored in the jump table storage area 532 (S16), and the read template 41a is displayed on the window 32 as shown in FIG. 4 (S18).

At this time, in S18, as shown in FIG.
The window 32 includes a translation button 32a that is clicked when executing the translation, a translation interruption button 32b that is clicked when interrupting the translation, and a jump button that is clicked when the pointer 33 is jumped to the next character string to be corrected. 32c is displayed. A character string corresponding to (1,1,9,1,12, H) stored at the beginning of the jump table 41b as shown in FIG. 2B, that is, "April 1, 1997" Is selected.

Next, FIG. 8 shows the modification of the text shown in FIG. 6 (S
30 is a flowchart for explaining the procedure of the process 30) in detail. The procedure of the text correction process will be described below with reference to FIG.
Will be described along the flowchart of FIG.

The character strings to be corrected are the date of sentence number 1, "ken" in the sentence of sentence number 2, and sentence number 4 "Smith".
And "Kobayashi" and sentence number N "Kobayashi". Also,
The operator corrects the date of the sentence number 1 from “April 1, 1997” to “July 30, 1998”, corrects “Ken” in the sentence of the sentence number 2 to “John”, and changes the sentence number. 4. Kobayashi
To “Suzuki”.

When the processing of text correction (S30) is started (start), the jump button 32c and the input device 20
Character input keys of a keyboard provided in the above, a translation process designation button 32d, a word translation process designation button 32e, a Roman character conversion process designation button 32f, and a non-conversion process designation button 32
g processing specification button and template translation button 32
If none of a is turned on (S20: NO, S
35: NO, S41: NO, S42: NO, S43: N
O, S44: NO, S50: NO), and enters a standby state for each button input. Therefore, characters can be input by the input device 20. If characters are input from the character input keys (S35: YES), the text is corrected (S40).

FIG. 10 is a flowchart for explaining in detail the procedure of the process of correcting the character string to be corrected (S40) in FIG. Hereinafter, the procedure (S40) of the process of correcting the correction target character string in FIG. 8 will be described with reference to the flowchart in FIG. The procedure for modifying the text (S40)
For example, if the character string “April 1, 1997”, which is the first selected character string to be corrected, is deleted using a delete key or the like and a new “November 1, 1998” is input, Is started (start), and the character string “November 1, 1998” input as this character string is displayed in the window 32 as shown in FIG. The correction can be repeatedly performed unless the enter key on the keyboard (not shown) of the input device 20 is pressed (S403: NO). Therefore, if an input error is made, the character string to be corrected and newly corrected and input is displayed in the window 32. Editing is performed until displayed (S401).

When the character string to be corrected is displayed on the window 32, the enter key is pressed (S403: YE
S), the correction is determined in the state of the correction target character string displayed in the window 32. The character string whose correction target character string is determined is referred to as a corrected character string as described above.
The corrected character string whose content has been determined is temporarily stored in the Japanese storage area 51, and the number of characters is counted by a counting means (not shown) to detect the character length of the corrected character string (S405). Based on the detected number of characters, the third parameter of the jump table 41b stored in the jump table storage area 532 as shown in FIG.
407). The replacement of the jump table 41b is executed by the replacement program 47. Based on the updated number of characters, the corresponding correction target character string portion of the original text of the template 41a stored in the template storage area 531 is rewritten (S409).

The procedure of the process of rewriting the correction target character string (S409) will be described with a specific example. For example, FIG.
"April 1, 1997" displayed in the window 32 shown in FIG.
Date is the character string to be corrected before correction. Then, “November 1, 1998” shown in FIG. 5 is set as a corrected character string.

First, when the part of "April 1, 1997" displayed in the window 32 shown in FIG. 4 is clicked, the mode is changed to the input mode, and the character is inverted and the cursor appears. Therefore, the user operates the keyboard to delete "7", and instead inputs "8" from the keyboard, operates the keyboard to delete "4", and inputs "11" from the keyboard instead. November 1 ", and the editing of the character string to be corrected has been completed.
1) When the enter key is pressed (S403: YES), the content is determined and temporarily stored in the Japanese storage area 51.

Here, if the original text is rewritten by registering as it is, the corrected character string "April 1, 1997"
Since the corresponding jump table 41b has contents such as the parameters shown at the top of FIG. 2B,
The character length of the correction target character string is determined to be 9 characters indicated by the third Japanese character length, and the character string “1998
Even though “November 1” has 10 characters, the numbers differ by 9 characters in the jump table 41b. Therefore, for example, when the character string to be corrected is called from the Japanese storage area 51 with reference to the information of the jump table 41b in order to rewrite the original text, the character string of "November 1, 1998" consisting of 10 characters , 9
When called as a character, the last character, "November 1, 1998", is missing. Therefore, even if it is configured to call all, when writing to the original text, a character string of 10 characters is written in the space of the first 9 characters to be corrected, which is different from the above example. In the case of the character string to be corrected in
Inconveniences such as overwriting an uncorrected character string and erasing the character string or changing the order of characters occur.

Returning to FIG. 10, the description is continued. The corrected character string stored in the Japanese storage area 51 (S403: Y
ES) The character length of "November 1, 1998" is detected (S405). In this case, since there are ten characters, the third numerical value of the corresponding parameter stored in the jump table storage area 532 shown at the top of FIG. 2B is updated from 9 to 10 (S407). In this case, if there are multiple character strings to be corrected in one sentence,
When the number of characters to be corrected first is increased or decreased, the number of subsequent characters is shifted, so that the position of the first character in Japanese is shifted. Then, in accordance with the character string stored in the Japanese storage area 51 according to the Japanese leading character position and the Japanese character length designated by the jump table 41b stored in the rewritten jump table storage area 532, the template storage area 531 The original text is rewritten (S409). The original sentence is corrected as described above, and the procedure of the process of correcting the correction target character string in FIG. 8 (S40) is completed (end).

Next, as shown in the window 32 of FIG. 4, when the translation processing designation button 32d is clicked and checked (S41: YES), the jump table 41b stored in the jump table storage area 532 is displayed.
The processing content at the end of the corresponding parameter is changed to H (S45). In this case, when the correction target character string is corrected (S40), the corrected character string is targeted, but only the processing content can be changed without correcting the correction target character string. FIG. 5 shows an operation in a case where the corrected character string “Suzuki” of the sentence number 4 is to be changed to a character string “Suzuki”. In this case, the character string "Kobayashi" is edited (S40), the character string is changed to "Suzuki", the confirmation key is pressed down to confirm, and then the box of the Roman character conversion process designation button 32f for instructing the Roman character conversion process is checked. (S43: YES), the jump table 4 stored in the jump table storage area 532
If the processing content of 1b is changed to R (S47) and the template translation button is further clicked (S50: YE
S), as will be described later, the English character string currently displayed as "Kobayashi" is converted to "Suzuki" (end).

Similarly, when the word translation processing designation button 32e is operated (S42: YES), the jump table 41 stored in the jump table storage area 532 is operated.
When the processing content of b is changed to T (S46) and the non-conversion processing designation button 32g is operated (S44: YE
S), the processing content of the jump table 41b stored in the jump table storage area 532 is changed to M (S48).

When the correction of the first character string to be corrected is completed in this way, the jump button 32c is operated (S20: YES), and the pointer 33 is moved to the next character string position to be corrected and displayed (step S20). S31).

The movement of the pointer 33 moves with reference to the jump table 41b. The jump table 41b is arranged in ascending order from the one with the smallest sentence number. If the sentence number is the same, the arrangement is arranged in ascending order from the smallest Japanese character position. Therefore, when the jump button 32c is pressed, the parameter in the next column of the corresponding parameter in the jump table 41b is referred to, the numeral of the first parameter indicating the sentence number, and 2 indicating the Japanese leading character position. The pointer 33 is moved to the position of the first character of the correction target character string of the pointer 33 based on the number of the third parameter. This pointer 3
Reference numeral 3 denotes a character that surrounds the first character of the correction target character string and the last character of the correction target character string. for that reason,
The pointer 33 is enlarged or reduced to the end of the character string to be corrected with reference to the third parameter representing the length of the Japanese character, and the character string to be corrected is indicated without excess or shortage.

Similarly, when the correction of the character string to be corrected which the operator intends to correct is completed, the template translation button 32a is operated (S50: YES), and the processing of text correction (S30) shown in FIG. 6 is performed. Is completed (end), and the process proceeds to the next template translation (S60) processing procedure.

Next, FIG. 9 shows the template translation (S
60 is a flowchart for describing in detail a procedure of a process 60). Hereinafter, the procedure of the template translation (S60) processing of FIG. 6 will be described with reference to the flowchart shown in FIG.

First, when the template translation button 32a is operated in S50 of FIG. 8, the processing procedure of the text correction (S30) shown in FIG. 6 is terminated (end), and the processing of the template translation (S60) of FIG. The procedure starts (start).

First, the corrected character string stored in the Japanese storage area 51 is read (S62), and processing is performed according to the processing contents of the jump table 41b stored in the corresponding jump table storage area 532. (S64). This processing is based on the last H,
The processing is performed in accordance with the processing contents set as default values designated by the respective alphabets of T, R, and M, or changed in the steps S45, S46, S47, and S48 of the flowchart shown in FIG.

More specifically, as described above, if the character string is H, the character string to be corrected is stored in the translation processing program 43 of the ROM 40.
Is translated from Japanese into English according to the translation dictionary 42. Since the translation process itself can be performed by a known method, it will not be described in detail here. If T, word translation processing is performed, if R, Roman character conversion processing is performed, and if M, no conversion processing, that is, a character string as it is, is maintained. An English character string generated by performing a predetermined process from the Japanese corrected character string in this manner is referred to as a processed character string. Therefore, the processed character string includes not only the processed character string translated into English, but also a Roman character and, in some cases, a character string in Japanese.

When the above-mentioned predetermined processing is completed, the English character string corresponding to the first Japanese character string to be corrected stored in the English storage area 52 and the processed character string generated in this way The columns are exchanged (S66). Next, the character length of the processed character string is detected (S68), and the fifth parameter indicating the English character length of the jump table 41b in the jump table storage area 532 is updated based on the character length detected in S68 (S70). ). In this case, 1
If one sentence number has multiple correction target character strings, the character length is updated, and the subsequent English leading character position shifts. Therefore, the fourth parameter indicating the English leading character position is changed to the English character length updating described above. The parameter is updated so as to shift the position by the amount based on the shift. For example, when the template translation button 32a is clicked from the state shown in FIG. 5, the portion "Kobayashi" of the Japanese sentence is replaced by "Suzuki" as shown in FIG. 4, and the Roman character conversion is selected. I am Kobayashi int
reduced by Mr. Smith. "Is an English translation of" I am Suzuki introduce
d by Mr. Smith. ]. In this case, the jump table corresponding to the word “Smith”, which is the character string to be corrected, was (4, 3, 3, 30, 8, R) before rewriting.
(4, 3, 3, 27, 8, R). That is, the part "Kobayashi" is replaced with "S
This is because the position of the first character of “Mr. Smith” has changed because the name has changed to “uzuki”.

If there are a plurality of character strings to be corrected for one sentence number, and the processing of all the character strings to be corrected has not been completed (S72: NO), the next corrected character string is read out (S62). ), S64 to S70 by the same processing as described above.
When the processing of all the correction target character strings is completed (S72: YES), the English storage area 5
2 to English processed character string and template storage area 5
An uncorrected character string is read from 31 and these are combined (S74). At this stage, since the jump table 41b has already been updated corresponding to the corrected character string and the processed character string, the jump table 41b is stored in the template storage area 531 according to the jump table 41b stored in the jump table storage area 532. The translated words corresponding to the correction target character string of the Japanese character string and the correction target character string of the English character string of the template 41a are stored in the corrected character string stored in the Japanese storage area 51 and the English storage area 52. A bilingual sentence composed of a pair of a completed original sentence and a translated sentence is completed simply by replacing the original sentence with the stored processed character string. Then, the processed character string and the non-corrected character string are displayed (S76), and the process ends (end).

As described above, in the translation apparatus 10 of the present embodiment, the original character string in Japanese is not corrected, and the entire sentence is not translated. The translation, the Roman character conversion, or the character string as it is are combined with the English sentence corresponding to the character string to be corrected. Therefore, when the whole sentence is translated, the original Japanese sentence is translated entirely according to the translation algorithm.If the original sentence is easy to understand, unnatural English is translated and natural English sentences are translated. Avoids the inconvenience of making the original Japanese language difficult to understand if you try to generate it, and converts the natural Japanese fixed phrase to the corresponding natural English fixed phrase with a translation that has no actual correspondence Since the nouns and the like are corrected and the fixed phrase in English and the corrected phrase are combined to complete the sentence, the completed English sentence can be made into an extremely natural English sentence.

In particular, the corrected portion is not translated uniformly, but may be translated, word-translated, Romanized,
Since non-conversion is used properly, appropriate processing suitable for each translated sentence can be performed. In addition, the processing can be performed appropriately if the machine is normally left to the default value, and the desired processing can be performed very easily by changing the check box check according to the operator's intention. it can.

Further, the setting is also made in the jump table 4
1b stores information on the character string to be corrected, so that the pointer 33 points to the character string to be processed one by one with one button.
Can be moved, the correction can be performed very easily, and no correction omission occurs.

Since such a template 41a is stored in the template database in association with the jump table 41b, if the template selection window 31 is opened at the start of translation, various templates 41a can be used immediately. .

In this embodiment, the template database 4 constituting the translation processing program of the present invention is used.
1. Translation dictionary 42, translation processing program 43, display program 44, pointer moving program 45, rewriting program 46, replacement program 47, synthesis program 48
Is stored in the ROM 40 and the program is executed.
For example, these programs are recorded on a computer-readable recording medium such as a CD-ROM or a flexible disk, and the translation processing program is read from the recording medium and directly executed, or once stored in the hard disk and executed. Is also possible. In this case, the CD-ROM or the flexible disk on which the translation processing program is recorded corresponds to a computer-readable recording medium on which the translation processing program is recorded.

In translation apparatus 10 of the present embodiment,
The template storage area 531 of the RAM 50 corresponds to the bilingual sentence storage unit of the present invention, and the translation dictionary 42 of the ROM 40 corresponds to the translation dictionary of the present invention. Further, the jump table storage area 532 corresponds to the rewritten character string information storage means of the present invention. Further, the procedure of S18 in FIG. 7 and S76 in FIG. 9 executed by the display program 44 by the CPU 12 is a procedure for displaying a rewritten character string according to the present invention.
2 constitutes the rewritten character string display means of the present invention. Further, the procedure executed by the CPU 12 in S41 to S48 of FIG. 8 by the translation processing program 43 corresponds to the process selection procedure of the present invention, and the CPU 12 executing this process corresponds to the process selecting means of the present invention. The rewriting program 46, the replacement program 47, and the synthesizing program 48 execute S6 in FIG.
The procedure executed by the CPU 12 at 0 is the procedure of the rewritten character string processing of the present invention, and the CPU 12 executing this processing corresponds to the rewritten character string processing means of the present invention. Then, in S30 of FIG.
The procedure executed by U12 corresponds to the pointer moving procedure of the present invention, and the CPU 12 executing this processing corresponds to the pointer moving means of the present invention.

Although the present invention has been described based on one embodiment, the present invention is not limited to the above-described embodiment, and various modifications and changes can be made without departing from the spirit of the present invention. Can be easily inferred. For example, the first language and the second language are not limited to Japanese and English.

[0074]

As is apparent from the above description, claim 1
According to the translation device of the invention according to the first aspect, in order to generate a translated sentence after selecting and processing a predetermined process of the rewritten character string among the character strings of the first language as the original sentence, There is an effect that desired processing other than translation can be performed. Therefore, it is possible to eliminate the inconvenience of being uniformly translated and to produce a translation desired by the operator. Also, there is no need to translate the full text,
It also has the effect of speeding up translation.

In the translation apparatus according to the second aspect of the present invention, in addition to the effect of the translation apparatus according to the first aspect, it is necessary to maintain a high-completed translated sentence in which the original sentence other than the rewritten character string is translated in advance. There is an effect that only the part can be translated. Therefore, there is an effect that by correcting an easy-to-understand original sentence, it is possible to obtain a highly complete translation.

According to a third aspect of the present invention, in addition to the effect of the first or second aspect of the present invention, in addition to performing the translation uniformly, the translation apparatus performs processing for a rewritten character string. There is an effect that a translation device that can perform the translation can be provided.

According to a fourth aspect of the present invention, in addition to the effects of the translation apparatus according to any one of the first to third aspects, when a rewritten character string is edited, the rewritten character string is not searched for. Has the effect that the pointer can indicate the rewritten character string to be edited next. Therefore, there is an effect that the work efficiency of the pre-translation editing can be improved, and the omission of editing can be prevented.

According to a fifth aspect of the present invention, in addition to the effects of the translation apparatus according to any one of the first to fourth aspects, the rewriting character string information storage means performs processing corresponding to each of the rewriting character strings. There is an effect that the method can be stored. Therefore, there is an effect that the processing can be stored in advance and set as a default value, or that the setting when the processing method setting is changed can be stored.
In the process, there is also an effect that it is easy to cooperate with the position information of the rewritten character string.

In a computer-readable recording medium on which a translation processing program according to claim 6 is recorded, a computer stores, in a computer, a character string of a first language which is an original text.
There is an effect that it is possible to execute a process of generating a translated sentence after selecting and processing a predetermined process on the rewritten character string. Therefore, it is possible to execute a desired process other than translation for a specific character string, to eliminate the inconvenience of being uniformly translated, and to produce a translation desired by the operator.

In a computer-readable recording medium recording the translation processing program according to the present invention,
In addition to the effects of a computer-readable recording medium on which the translation processing program according to claim 6 is recorded, a computer is also provided with a necessary part without destroying a highly completed translation of a part other than a rewritten character string. There is an effect that it is possible to execute a process of translating only the data. Therefore, there is an effect that by correcting an easy-to-understand original sentence, it is possible to obtain a highly complete translation.

In a computer-readable recording medium recording the translation processing program according to the present invention,
A translation process for causing a computer to perform a process for a rewritten character string in addition to uniformly translating, in addition to the effect of a computer-readable recording medium on which the translation processing program according to claim 6 or 7 is recorded. Can be executed.

According to a ninth aspect of the present invention, there is provided a computer-readable recording medium having a translation processing program recorded thereon, wherein the effect of the computer-readable recording medium having the translation processing program according to any one of the sixth to eighth aspects is obtained. In addition, there is an effect that, when editing a rewritten character string, the computer can execute a procedure in which the pointer indicates the rewritten character string to be edited next without searching for the rewritten character string. Therefore, there is an effect that the work efficiency of the pre-translation editing can be improved, and the omission of editing can be prevented.

According to a tenth aspect of the present invention, there is provided a computer-readable recording medium storing the translation processing program according to any one of the sixth to ninth aspects. In addition to the effect, there is an effect that the computer can execute a procedure for storing a processing method corresponding to each rewritten character string in a procedure for storing rewritten character string information. Therefore, it is possible to store the processing in advance and set it as a default value, or to store when the setting of the processing method is changed, and to cooperate with the position information of the rewritten character string in the processing. This has the effect of making it easier to take.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a main configuration of a translation apparatus 10 according to an embodiment of the present invention.

FIG. 2A is a diagram schematically showing the contents stored in a template 41a of a template database 41; (B) is a diagram schematically showing the content stored in a jump table 41b of the template database 41.

FIG. 3 is an explanatory diagram showing a selection window 31 of a template 41a.

FIG. 4 is an explanatory diagram of a window 32 showing a self-introduction template 41a before correction.

FIG. 5 is an explanatory diagram of a window 32 showing a self-introducing template 41a being modified.

FIG. 6 is a flowchart showing an outline of a processing procedure of the translation apparatus 10;

FIG. 7 is a flowchart illustrating in detail a procedure of a template selection (S10) process in FIG. 6;

FIG. 8 is a flowchart illustrating in detail a procedure of a text correction process (S30) in FIG. 6;

FIG. 9 is a flowchart illustrating in detail a procedure of a process of template translation (S60) of FIG. 6;

FIG. 10 is a flowchart illustrating in detail a procedure of a process (S40) of correcting a correction target character string in FIG. 8;

[Explanation of symbols]

 REFERENCE SIGNS LIST 10 translation device 12 CPU 20 input device 30 display device 40 ROM 41 template database 41 a template 41 b jump table 42 translation dictionary 43 translation processing program 44 display program 45 pointer movement program 46 rewriting program 47 replacement program 48 synthesis program 50 RAM 51 Japanese Storage area 52 English storage area 53 Text storage area 531 Template storage area 532 Jump table storage area

Claims (10)

[Claims] 1. A bilingual sentence storage means for storing a bilingual sentence in which a character string of a first language as a source language and a character string of a second language as a target language corresponding thereto are stored. A translation dictionary for translating from a language to a second language, a rewritten character string for rewriting among character strings of the first language constituting the bilingual sentence, and a second language for rewriting corresponding to the rewritten character string. Rewriting character string information storage means for storing position information of a character string as a table, and displaying on the display device the bilingual sentence and a pointer indicating the rewriting character string specified in the character string of the bilingual sentence Rewriting character string display means, a processing selection means for selecting a processing method of the rewriting character string, and a rewriting character string processing means for performing a process selected by the processing selection means for the rewriting character string. Translation Location. 2. The translation apparatus according to claim 1, wherein when translating the bilingual sentence, only the rewritten character string is to be processed by the processing method. 3. A method of processing a rewritten character string, comprising: a non-conversion process of displaying a character string of a first language without conversion; a translation process of translating a first language into a second language; Word translation processing for converting the character string to the corresponding word in the second language in that order, and romanization conversion processing for romanizing the first language in the second language. The translation device according to claim 1 or 2, wherein 4. A pointer moving means for moving the pointer from one rewritten character string to another rewritten character string by a predetermined operation when there are a plurality of rewritten character strings. The translation device according to claim 3. 5. The rewritten character string information storage means stores a processing method of the rewritten character string corresponding to each of the rewritten character strings. The translation device according to any one of the above. 6. A bilingual sentence in which a character string composed of a first language, which is a source language, and a character string composed of a second language, which is a corresponding target language, are translated from the first language to a second language. Position information of a translation dictionary for rewriting, a rewritten character string to be rewritten among the character strings of the first language constituting the bilingual sentence, and a character string of the second language to be rewritten corresponding to the rewritten character string A rewriting character string display procedure for causing a computer storing a table for storing the rewriting character string to display on the display device the bilingual sentence and the pointer indicating the rewriting character string specified in the character string of the bilingual sentence. A translation selecting step of selecting a processing method of the rewritten character string; and a rewriting character string processing procedure of performing a process selected by the processing selecting procedure on the rewritten character string. Processing log A computer-readable recording medium beam. 7. The computer according to claim 6, wherein, when translating the bilingual sentence, the computer is caused to execute a procedure for processing only the rewritten character string by the processing method. A computer-readable recording medium on which a translation processing program is recorded. 8. The computer according to claim 1, wherein the rewriting character string processing method includes: a non-conversion processing for displaying a character string in a first language without conversion; a translation processing for translating from a first language to a second language; At least two of a word translation process of converting a character string of a first language into a corresponding word of a second language in the same order, and a Roman character conversion process of converting a first language into a Roman character in a second language A computer-readable recording medium on which the translation processing program according to claim 6 or 7 is executed. 9. The method according to claim 9, wherein, when there are a plurality of rewritten character strings, the computer executes a pointer moving procedure of moving the pointer from one rewritten character string to another rewritten character string by a predetermined operation. A computer-readable recording medium on which the translation processing program according to claim 6 is recorded. 10. The computer according to claim 1, wherein the step of storing the rewritten character string information includes a step of storing a processing method of the rewritten character string corresponding to each of the rewritten character strings. A computer-readable recording medium recording the translation processing program according to any one of claims 6 to 9.