JP2000163422A - Translating device and computer-readable recording medium where translating process program is recorded - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a translating device which can advance translating opera tion while confirming the translation contents without any troublesome operation and can perform template translation with high translation precision. SOLUTION: The translating device is equipped with a computer and when a character string to be corrected which is indicated by a pointer is corrected (S20, S30) with a template selected by a procedure (S10) for template selection and a jump button is operated (S50: YES), a procedure for the process (S60) of the pointer-indicated part is followed by a previously set processing to perform a process for translation, etc., and automatically correct the process contents of a jump table. Then the position of the character string to be corrected is automatically moved (S90) to a next character string to be corrected according to the stored jump table and the process is repeated until no character string to be corrected is left (S80: NO), thereby completing a translated sentence.

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, since there is a remarkable difference between the first language and the second language, especially in fixed phrases, etc., the template of the first language is converted into a natural sentence which is easy to understand and edit. However, if this first language sentence is corrected and the whole sentence is translated at once with the corrected part taken in, even if the first language is a natural and easy-to-understand sentence, it is not necessarily translated by the translation algorithm There is a problem that the second language does not produce a natural sentence and the translation result is unintended by the operator. When a language template is created, there is a problem that sentences are unnatural and difficult to understand as a first language.

[0004] In this case, if retranslation is performed collectively, there is a problem that translation of only the corrected portion cannot be confirmed.

Further, the operator searches for correction portions one by one from the text of the template in the first language to find a portion to be corrected, and further performs correction and translation processing each time. However, there are problems that the work becomes complicated and that corrections and descriptions are omitted.

SUMMARY OF THE INVENTION The present invention solves the above-mentioned problems, and is easy for an operator to understand by a natural first language input sentence, and performs translation work while confirming translation contents without complicated operation by the operator. And a computer-readable recording medium that stores a translation processing program that performs a machine translation process that can easily obtain a natural translation corresponding to the first language sentence. Aim.

[0007]

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 a pointer indicating the rewriting character string in a character string of a sentence on a display device, and when there are a plurality of the rewriting character strings, the rewriting character string is displayed on the display device by a predetermined operation. Poi indicating rewrite character string Pointer moving means for moving the pointer to the next arranged rewritten character string based on the rewritten character string position information stored in the rewritten character string information storage means; and When the predetermined operation of moving the pointer is performed, a rewritten character string processing unit that processes the rewritten character string specified before the movement by a predetermined processing method is provided.

In the translation apparatus according to this configuration, when the rewritten character string pointed to by the pointer is corrected, only a predetermined operation is performed, and a predetermined processing method is performed on the rewritten character string pointed before the pointer is moved. And the pointer can be moved to the next rewritten character string. Therefore, the translation operation can be performed while the operator confirms the translation content without performing a complicated operation, and the translated sentence can be easily obtained.

According to a second aspect of the present invention, in addition to the configuration of the first aspect, when translating the parallel sentence, only the rewritten character string is processed by the predetermined processing method. And a synthesizing means for generating a translated sentence by synthesizing a character string other than the rewritten character string with the processed rewritten character string as it is in the bilingual sentence.

In the translation apparatus according to this configuration, only the rewritten character string in the bilingual sentence is corrected, and the character strings other than the rewritten character string are not changed by a process such as translation. By having a highly complete bilingual sentence that is easy for the operator to understand, corresponds to the first language sentence, and does not generate the first language sentence with a translation algorithm,
The rewritten character string portion is processed into a desired character string, and a natural translated sentence as a whole can be easily obtained.

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 predetermined processing method includes the steps of: It is characterized by a translation process for translating into a column.

In the translation apparatus according to this configuration, if only a portion to be translated is set as a rewritten character string, translation and confirmation can be performed very efficiently only by moving the pointer.

According to a fourth aspect of the present invention, in addition to the configuration of the translation apparatus according to the first or second aspect, the predetermined processing method of the rewritten character string includes the step of converting the first language character string into a first language character string. Translation processing for translating into a bilingual character string, non-conversion processing for displaying the first language character string without conversion, and translating the first language character string to the corresponding word in the second language in that order Processing method selecting means for selecting one of the predetermined processing methods for each of the rewritten character strings, including at least two of the following word translation processing and Roman character conversion processing for writing a character string in the first language in Roman characters. And a processing method storing means for storing the processing method selected by the processing method selecting means in association with the rewritten character string.

In the translation apparatus according to this configuration, not only the processing of the corrected rewritten character string but also the processing corresponding to the character string can be individually performed, so that the operator can achieve a higher degree of perfection. It can be a translation.

According to a fifth aspect of the present invention, in addition to the configuration of the translation apparatus of the fourth aspect, the rewritten character string information storage means is configured to also serve as the processing method storage means. It is characterized by.

In the translating apparatus according to this configuration, the rewritten character string information storage means also functions as the processing method storage means, so that information on an arbitrary rewritten character string can be collectively and easily processed.

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 bilingual sentence storage means for storing a bilingual sentence paired with a storage means for storing 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. The computer includes a rewritten character string information storage unit that stores, 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. And a procedure of displaying a rewritten character string for displaying a pointer indicating the rewritten character string in the character string of the bilingual sentence on a display device, and, when there are a plurality of the rewritten character strings, by a predetermined operation, Moves the pointer indicating the rewritten character string displayed on the rewriting display device to the next rewritten character string arranged based on the rewritten character string position information stored in the rewritten character string information storage means. When performing the predetermined operation of moving the pointer according to the pointer moving procedure and the pointer moving procedure,
And performing a rewrite character string processing procedure for processing the rewrite character string instructed before the movement by a predetermined processing method.

In a computer-readable recording medium on which the translation processing program according to this configuration is recorded, when the rewrite character string indicated by the pointer is corrected, the computer performs a predetermined operation and moves the pointer before the movement. Is processed by a predetermined processing method with respect to the rewritten character string instructed, and a process of moving the pointer to the next arranged rewritten character string can be executed. Therefore, the translation operation can be performed while the operator confirms the translation content without performing a complicated operation, and the translated sentence can be easily obtained.

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 that stores the translation processing program according to claim 6, when the computer translates the bilingual sentence, only the rewritten character string is processed by the predetermined processing method. In the bilingual sentence, a character string other than the rewritten character string is combined with the processed rewritten character string with the character string as it is to execute a combining procedure of generating a translated sentence.

In a computer-readable recording medium on which the translation processing program according to this configuration is recorded, the computer corrects only the rewritten character string in the bilingual sentence, and converts the character string other than the rewritten character string by a process such as translation. Since it is possible to execute a process that is not changed, it is easy for the operator to understand the input sentence in the natural first language, and it corresponds to the first language sentence and has a perfection degree that does not generate the first language sentence by the translation algorithm. By having a high bilingual sentence as a translated sentence, the rewritten character string portion is processed into a desired character string, and a natural translated sentence as a whole can be easily obtained.

[0021] 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 that stores the translation processing program according to claim 6 or 7, the predetermined processing method to be executed by the computer is configured to convert a character string in a first language into a character string in a second language. It is a translation process for translating into a character string.

In a computer-readable recording medium on which a translation processing program according to this configuration is recorded, if only a portion to be translated is set as a rewritten character string in a computer, translation and confirmation can be performed only by moving a pointer. Processing that can be performed efficiently can be executed.

According to a ninth aspect of the present invention, there is provided a computer-readable recording medium storing the translation processing program, wherein the computer-readable recording medium stores the translation processing program according to the sixth or seventh aspect. The predetermined processing method of the rewritten character string to be executed by the computer includes a translation process of translating the character string of the first language into a character string of the second language, and a non-conversion method of displaying the character string of the first language without conversion. Processing, a word translation process that converts the first language character string into the corresponding word in the second language in that order, and a Roman character conversion process that converts the first language character string into Roman characters. A processing method selecting procedure for selecting the predetermined processing method for each of the rewritten character strings, and a processing selected by the processing method selecting procedure. Law, characterized in that to execute the steps of the rewrite string associated with the processing method storage of storing.

In the computer-readable recording medium storing the translation processing program according to this configuration, the computer causes the computer to execute not only the processing of the corrected rewritten character string but also the processing corresponding to the character string individually. Therefore, it is possible to obtain a highly complete translation desired by the operator.

According to a tenth aspect of the present invention, there is provided a computer-readable recording medium recording the translation processing program, in addition to the configuration of the computer-readable recording medium recording the translation processing program according to the ninth aspect. The rewritten character string information storage means is configured to also serve as the processing method storage means.

In a computer-readable recording medium on which a translation processing program according to this configuration is recorded, information on an arbitrary rewritten character string can be stored because the rewritten character string information storage means provided in the computer also functions as the processing method storage means. It is possible to make the computer execute the processing collectively and easily.

[0027]

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, the first language, which is the source language, here, the character string of the bilingual sentence consisting of Japanese, and the target language, the second language, here, the character string of the bilingual sentence consisting of English, Translated sentences ”.

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. In addition,
An external storage device including a hard disk drive, a flexible disk drive, and a CD-ROM drive, various lines, a printer, and the like (not shown) can be connected to the input / output port.

Here, the contents of 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 of a bilingual sentence in which a Japanese original sentence and an English translated sentence of a fixed form document are paired, and the first character position of a corrected portion of Japanese associated with the template 41a In addition, a jump table 41b in which the first character position and character length of the English language obtained by translating the corrected portion and the processing contents are associated in the form of parameters is stored.

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 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 to a correction target character string. A pointer moving program 45 for moving between columns, a rewriting program 46 for processing a correction target character string of the template 41a according to predetermined processing contents, and a rewriting program for correcting the number of characters stored in the jump table 41b. A replacement program 47 for replacing the character string with the number of characters, and a character string other than the correction target character string ( Lower, unmodified target string hereinafter) and the correction target character string a character string in which the predetermined processing (hereinafter, the synthesis program 48 for synthesizing a called) and the processed character string is stored.

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 532 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), FIGS. 4 (A), (B) and FIGS. 5 (A), (B)
This will be described with reference to FIG. FIG. 2A is a diagram schematically illustrating the contents stored in the database 41 a of the template database 41. Here, one sentence Japanese sentence and one sentence English sentence are stored in parallel with the sentence number, and partial association is performed by the jump table 41b. FIG. 3 is an explanatory diagram showing the selection window 31 of the template 41a. FIG. 4A is an explanatory diagram showing a self-introduction template 41a before correction.
FIGS. 5B and 5A and 5B are explanatory diagrams showing the self-introduction template 41a being modified.

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 a total of eight types of templates 41a are displayed, including inquiries, document requests, self-introductions, instruction manuals, entrance motives, resumes, travel thanks 1 and travel thanks 2. Then, a file having a self-introducing file name is selected from the file names shown in FIG.
1b, when clicked and opened, as shown in FIG.
A window 32 showing the self-introduction template 41a is opened. The self-introduction template 41a is configured by associating N Japanese sentences with their translated English sentences. For example, the Japanese sentence of sentence number 1 “April 1, 1997” and the English sentence "April 1, 1997" is the sentence number 2 of the Japanese sentence "Dear Ken" and the English sentence "De
ar Ken "are associated with each other.

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 parameters of the jump table 41b are as follows:
The first number is the sentence number of 1 to N, the second number is the first character position of the Japanese character indicating the number of characters from the beginning of the character string to be corrected or the corrected character string, and the third parameter is The Japanese sentence length that indicates how many characters the correction target character string or the corrected character string is composed of, and the fourth parameter is the translated text corresponding to the correction target character string or the processed character that has processed the corrected character string. The 5th parameter indicates the English character length indicating how many characters the processed character string, etc. are composed of. The parameter indicates a processing content indicating how to process the first language when processing the pointer indication portion.

For example, the jump table 41b shown in FIG. 2B is for the bilingual sentence of self introduction shown in FIG. 3, and the contents of the window 32 showing the template 41a for self introduction in FIG. Corresponding. Specifically, “April 1, 1997” of sentence number 1 shown in FIG. 4A corresponds to the parameter at the top of FIG. 2B, and the sentence of sentence number 1 Since all are character strings to be corrected, the parameter indicating the first sentence number is 1 first, and the parameter indicating the second Japanese leading character string is 1 because it starts from the first character. The parameter indicating the word character length is 9 because 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. The fifth parameter indicating the English character length is 12 because the character length of the English sentence is the number of characters including spaces and symbols, and the symbol indicating the final processing content is translated into H so that the entire sentence is translated. Is set.

The alphabet indicating the processing contents is as follows:
The template database 41 is composed of four types of characters H, T, R, and M, and predetermined default values are 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. Note that this default value can be changed in a text correction step described later.

Hereinafter, alphabets indicating the processing contents will be described. If the alphabet indicating the processing content is "H", the character string in the first language is translated as
The entire character string is translated using a translation algorithm. For example, the result of translating “April 1, 1997” in the first language character string into “April 1, 1997” in the second language character string is displayed. Such is the case.

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 without any 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.

Next, the translation apparatus 1 configured as described above
0 will be described with reference to the flowcharts of FIGS. 6, 7, 8, 9, and 10. 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 process is started as shown in FIG. 6, first, a template 41a corresponding to a document to be created is selected (step (hereinafter abbreviated as S) 10). First, in this state, if it is not necessary to correct the correction target character string indicated by the pointer, the jump button 3
If no operation other than 2c is performed, it is determined that the editing of the correction target character string indicated by the pointer has not been started (S20: NO), and the jump button 32c is in the operation standby state (S20). : NO, S50: NO),
By operating the jump button 32c (S50: YE
S), the process proceeds to the processing of the character string to be corrected at the part indicated by the pointer 33 (S60).

When the character string to be corrected indicated by the pointer is to be corrected, the jump button 32c is used.
If any other operation is performed, it is determined that the character string to start editing the character string indicated by the pointer is to be corrected (S20:
YES), the template 41 selected as the pointer
The character string to be corrected in the text a is corrected (S30), and when the corrected character string to be corrected is completed (S2).
0: NO), since the jump button 32c is in the operation standby state (S20: NO, S50: NO), the jump button 32c is operated (S50: YES), and the processing of the character string to be corrected (S60) is performed. Transition.

In the processing of the character string to be corrected (S60), the text of the part indicated by the pointer 33 is processed according to the processing contents of the jump table 41b. When the processing of the correction target character string is completed, if there is the next correction target character string (S80: YES), the pointer 33 is moved to the next correction target character string (S90), and the next correction target character string is changed. The processing described above (S20, S30, S5)
0, S60), and the translation is advanced while moving the pointer 33. Then, when the processing of all the correction target character strings is completed and there is no longer a correction target character string to which the pointer 33 should be moved (S80: NO), the template 41a
The processing for is ended (end). In this way,
A desired document is obtained using the template 41a.

Hereinafter, the procedure of these processes will be described in more detail with reference to the flowchart of the defined program in FIG.

First, FIG. 7 is a flowchart for explaining in detail the procedure of the template selection process (FIG. 6: S10) of FIG. First, when the power is turned on by the operator and the program starts after the well-known preparation operation, the template selection process (FIG. 6: S10) is started (FIG. 7: start),
The file name of the template 41a is read from the template database (S101), a window for selecting a template as shown in FIG. 3 is displayed on the screen, the file name of the template 41a is displayed on the screen, and input for selection is possible. Waits for a selection in a proper state (S103, S10
5: NO).

The operator selects the file name of the self-introducing template 41a using a cursor movement key provided on the input device 20 or a pointing device such as a mouse, and clicks an open file button 31b, or When the user double-clicks on the file name, the CPU 12 determines that the template 41a has been selected (S105: YES), and selects the self-selected template from the eight types of templates 41a stored in the template database 41 of the ROM 40. Read the introduction template 41a and the jump table 41b (S
107), the read template 41a is stored in the RAM 5
0 is stored in the template storage area 531, and the related jump table 41b is stored in the jump table storage area 531.
2 (S109) and read out the template 41a
Is displayed on the screen of the display device as shown in FIG. 4A (S111). Then, in accordance with the parameters of the data arranged at the head of the jump table 41b, a pointer is displayed at the position of the first correction target character string (S111), and a template is selected (FIG. 6: S10).
Is completed (end).

Specifically, the jump table 532 as shown in FIG.
9, 1, 12, H), that is, the range from the first character to the ninth character of the first sentence, "April 1, 1997
The character string “day” is selected as the pointer.

The screen displayed in the procedure in S111 is as follows.
In addition to the bilingual sentence and the pointer indicating the character string to be corrected, as shown in FIG. Click the stop translation button 32b
And a jump button 32c to be clicked when the pointer 33 is jumped to the next character string to be corrected. At the bottom, check boxes are displayed as option buttons for designating processing contents to be described later, such as a selection processing designation button 32d, a word translation processing designation button 32e, a Roman character conversion processing designation button 32f, and a non-conversion processing designation button 32g. Be done

FIG. 8 is a flowchart for explaining in detail the procedure of the text correction (S30) shown in FIG. Hereinafter, the procedure of the text correction process will be described with reference to the flowchart of FIG. In this description, the character string to be corrected is the date of sentence number 1 and
It is assumed that the sentence number 2 is “Ken”, the sentence number 4 is “Smith” “Kobayashi”, and the sentence number N is “Kobayashi”. Further, the operator changes the date of sentence number 1 from “April 1, 1997” to “1”.
July 30, 998, "ken" in sentence number 2 is corrected to "John", and "Kobayashi" in sentence number 4 is changed to "Suzuki".

When the process of correcting the text (FIG. 6: S30) is started (FIG. 8: start), the jump button 32c,
A character input key of a keyboard provided in the input device 20,
Translation process designation button 32d, word translation process designation button 32
e, if all of the Romanization conversion process designation button 32f, the non-conversion process designation button 32g, and the template translation button 32a are not operated (S
301: NO, S305: NO, S307: NO, S3
(09: NO, S311: NO), but the processing is terminated (end), but as shown in FIG. 6, a selective standby state is entered for the input of the correction character string and the input of the operation of the jump button 32c. . Therefore, if a character is input from the character input keys of the input device 20 (S20: YES), the text is corrected again (FIG. 6: S30) (FIG. 8: start).

When the processing is started and the addition of the character string or the deletion of the character string is performed for the character string to be corrected indicated by the pointer, it is determined that a character has been input, and the character string to be corrected is corrected (S303). Is performed.

FIG. 10 is a flowchart for explaining in detail the procedure of the process of correcting the character string to be corrected (S303) in FIG. Hereinafter, the procedure of the process of correcting the character string to be corrected in FIG. 8 (S30) according to the flowchart in FIG.
3) will be described. The procedure for correcting the correction target character string (S303) is such that when the processing is started, the character string can be input (FIG. 10: Start). For example, the first correction target character string selected "1997 April
Delete the string "Month 1" with the delete key etc.
If "November 1, 1998" is newly input, the character string to be corrected is edited (S3031), and as shown in FIG. 4B, "November 1, 1998" input with this character string is input.
Is displayed in the window 32. Editing is
Unless the enter key on the keyboard (not shown) of the input device 20 is pressed (S3033: NO), the character string can be repeatedly corrected (S3031).
Edit until it is displayed in 2.

When the character string to be corrected is displayed in the window, when the enter key is pressed (S3033: YES),
The correction is determined in the state of the correction target character string displayed in the window 32. The corrected and confirmed correction target character string 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 (S3034), and the number of characters is counted by a counting means (not shown) to detect the character length of the corrected character string (S3035). . Based on the number of characters found,
FIG. 2 stored in the jump table storage area 532
The third parameter of the jump table 41b, such as that shown in (B), is updated as a parameter representing the length of Japanese characters (S3037). The replacement of the jump table 41b is executed by the replacement program 47. Based on the updated number of characters, the corresponding character string to be corrected in the original text of the template 41a stored in the template storage area 531 is rewritten (S3039), and the processing of the correction character string is corrected (FIG. 8: S303). The process ends (FIG. 10: end).

Rewriting of the character string to be corrected (S3039)
The procedure of the process will be described with a specific example.
“199” displayed in the window 32 shown in FIG.
April 1, 7 "is the character string to be corrected before correction. Then, “November 1, 1998” shown in FIG. 4B is set as the corrected character string. First, the window 32 shown in FIG.
Clicking on the "April 1, 1997" portion displayed in the above section enters the input mode, in which the character is inverted and the cursor appears. Therefore, the user operates the keyboard to delete “7” and inputs “8” by inputting from the keyboard, deletes “4”, and inputs “11” instead of “11” in 1998.
Month 1 ". Since the editing of the correction target character string has been completed (S3031), when the enter key is pressed (S3033: YES), the contents are determined and temporarily stored in the Japanese storage area 51 (S3034).

Here, if only the original text is rewritten as it is, the corresponding jump table 41b of the character string to be corrected "April 1, 1997" 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 the nine characters indicated by the third Japanese character length, and the actually stored character string “
"January 1" has 10 characters, but jump table 4
The numbers will be different from each other with 9 characters of the parameter 1b. Therefore, for example, when the character string to be rewritten is read 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 is used. , 9 characters, "November 1, 1998" and the last 1
Characters are 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, there are inconveniences such as remaining characters, overwriting and erasing the non-correction character string, and disordering the character order.

Returning to FIG. 10, the description is continued. When the enter key is pressed (S3033: YES), the corrected character string "19" is stored in the Japanese storage area 51 (S3034).
For November 1, 1998 "(S
3035) In this case, since there are 10 characters, FIG.
The third numerical value of the corresponding parameter stored in the jump table storage area 532 shown in the top row is changed from 9 to 1
It is changed to 0 (S3037). In this case, if there are multiple character strings to be corrected in one sentence, or if the number of characters to be corrected first is increased or decreased, the number of subsequent characters will be shifted, so the Japanese first character position will be shifted. Have been. The jump table 41b stored in the rewritten jump table storage area 532
The original text in the template storage area 531 is rewritten with the character string stored in the Japanese storage area 51 in accordance with the Japanese leading character position and the Japanese character length designated by (S303).
9). The original sentence is corrected as described above, and the processing procedure of the correction of the correction target character string in FIG. 8 (FIG. 8: S303) ends (FIG. 10: end).

Next, in FIG. 8, when the translation process designation button 32d is clicked and checked as shown in the window 32 of FIG. 4A (S305: YE
S), the processing content at the end of the corresponding parameter of the jump table 41b stored in the jump table storage area 532 is changed to H (S313). In this case, when the correction target character string is corrected (S303), the corrected character string is targeted, but only the processing content can be changed without correcting the correction target character string. FIG. 5B shows an operation in a case where the corrected character string “Suzuki” of sentence number 4 is to be changed to a character string “Suzuki”. In this case, the character string “Kobayashi” is edited (S303, FIG. 10: S3031), the character string is set to “Suzuki”, and the confirmation key is pressed to confirm (FIG. 10: S3033: Y).
ES) Then, by checking the box of the Roman character conversion processing designation button 32f for instructing the Roman character conversion processing (S309: YES), the processing content of the jump table 41b is changed to R (S317), and the jump button 32c is further clicked. (Fig. 6: S50: YE
S), as will be described later, the English character string currently displayed as "Kobayashi" is converted to "Suzuki" (FIG. 6: S60).

Similarly, when the word translation processing designation button 32e is operated (S307: YES), the jump table 4 stored in the jump table storage area 532 is displayed.
If the processing content of 1b is changed to T (S315) and the no-conversion processing designation button 32g is operated (S311:
YES), the processing content of the jump table 41b stored in the jump table storage area 532 is changed to M (S319).

When the correction of the first character string to be corrected is completed in this way, the jump button 32c is operated (S50: YES in FIG. 6), and the procedure of the pointer instruction portion processing (S60) is executed. In addition to processing the correction portion, it is checked whether or not there is a correction target character string to be moved next by referring to the jump table 41b, and if there is a correction target character string to be moved next (S80: YES). Then, the pointer 33 is moved to the next character string to be corrected (S9).
0).

This movement of the pointer (S90) 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 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 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 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 jump button 32
By operating c (S50: YES), processing of the correction target character string (S60) is sequentially performed (S20: YES, S3).
0, S50: YES, S60, S80, S90, S2
0: YES).

Next, FIG. 9 is a flowchart for explaining in detail the procedure of the processing (S60) of the pointer instruction portion shown in FIG. Hereinafter, the template translation (S
The procedure of the process 60) will be described with reference to the flowchart shown in FIG.

First, when the jump button 32c is operated in S50 of FIG. 6, the procedure of the processing (S60) of the pointer instruction portion shown in FIG. 6 is started (FIG. 9: Start).

First, the corrected character string stored in the Japanese storage area 51 is read (S601), and processing is performed according to the processing contents of the jump table 41b stored in the corresponding jump table storage area. (S603). This process is based on the last H of the parameter,
The setting is performed as a default value designated by each of the alphabets of T, R, and M, or is performed according to the processing content designated to be changed in each step of S305, S307, S309, and S311 in the flowchart shown in FIG.

Specifically, as described above, if the alphabet indicating the processing content of the jump table 41b of sentence number 1 is H, the character string to be corrected in the pointer designated portion is
The translation processing program 43 in the ROM 40 translates from Japanese into English according to the translation dictionary 42. Therefore, the part “April 1, 1997” shown in FIG. 4B is translated into a corrected character string by the translation algorithm of “November 1, 1998”, as shown in FIG. 5A. "November 1,199
8 ". As shown in FIG. 5A, the pointer moves to the next character string "John" to be corrected together with the translation processing (FIG. 6: S80: YE).
S, S90). 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. A character string generated by performing a predetermined process from the Japanese corrected character string in this way is called 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-described predetermined processing is completed, the English character string corresponding to the first Japanese character string to be corrected stored in the template 41a and the processed character string generated in this way are It is exchanged (S605). next,
The character length of the processed character string is detected (S607), 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 S607 (S609). Also, in this case, when one sentence number has a plurality of correction target character strings, if the character length is changed, the subsequent English first character position is shifted. Therefore, the fourth parameter indicating the English first character position is set as described above. The parameter is changed so that the position is shifted by the shift based on the change in the English character length of the.

The processed character string of the English sentence is read from the English recording area 52 and the uncorrected character string is read from the template storage area 531 and these are combined (S611). At this stage, the jump table 41b stores the corrected character string and
Since the jump table 4 has been updated corresponding to the processed character string, the jump table 4 stored in the jump table storage area 532 is stored.
1b, the translated words corresponding to the correction target character string of the Japanese character string and the English character string of the template 41a stored in the template storage area 531 are corrected and stored in the Japanese storage area. By simply replacing the character string with the processed character string stored in the English storage area, a bilingual sentence consisting of a completed original sentence and a translated sentence is completed.

As described above, in translation apparatus 10 of the present embodiment, template 41 prepared in advance is used.
Template 4 with the target English content from a
1a and select the pointer 33 in the original Japanese.
Selects the correction / processing method for the character string to be corrected automatically specified by, and when the correction is completed, the jump button 32c
Translate the corrected character string, translate the word,
The character string is converted into a Roman character or a character string that is not converted as it is, and is synthesized with an English sentence corresponding to the character string to be corrected. Then, the pointer automatically moves to the next correction target character string and waits for correction. If there is no need for correction, or if the jump button 32c is operated, the pointer 33 automatically moves to the next character string to be corrected. As described above, if the part automatically pointed by the pointer is corrected one after another, the translation is completed.

As described above, in the translation apparatus 10 according to the present embodiment, when the template 41a is translated, if the original text is easy to understand, as in the case where the conventional whole text is collectively translated in accordance with the translation algorithm, it is unnatural. To avoid the inconvenience that the original Japanese is difficult to understand when trying to generate natural English sentences, and to translate natural Japanese fixed phrases into translations that are not directly translated. In order to complete the sentence by synthesizing the fixed phrase and the corrected phrase to correct the date and proper noun that does not break the syntax, It can be a natural English sentence with a high degree of perfection.

When correcting the original Japanese,
Since the jump table 41b stores the position information and the processing contents regarding the character string to be corrected, which is the part to be corrected, the processing is performed one by one by operating only one jump button 32c, and the character to be corrected next is simultaneously displayed. Pointer to column 3
3 can be moved automatically. Therefore, the correction processing can be performed very easily, and no omission of correction occurs.

Further, the processing of the corrected portion can be selectively performed by translation, word translation, Romaji conversion, or no conversion according to the operator's request, instead of performing uniform translation. Usually, the processing is preset as a default value. It is possible to perform appropriate processing if left to the machine, and the operator does not need to set each time. Especially if the operator wants
By simply changing the check of the check box for a specific character string to be corrected, it is possible to perform an appropriate process adapted to the sentence intended by the operator. Therefore, the translation device 10 having a high degree of freedom that can not only make the correction work extremely easy, but also can be set to perform the desired processing.
It can be.

The template 41a is stored in the template database 41 in the jump table 41b.
When the translation window 31 is opened at the start of translation, the 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 the translation apparatus of this embodiment, the RA
The template storage area 531 of M50 corresponds to a bilingual sentence storage unit, and the translation dictionary of the ROM 40 corresponds to a translation dictionary. Further, the jump table storage area 532 corresponds to a rewritten character string information storage unit. Further display program 44
S111 in FIG. 7 or S6 in FIG.
The procedure 13 is a procedure for displaying a rewritten character string, and the CPU 12 executing this procedure constitutes a rewritten character string display means. Further, S305 to S in FIG.
The procedure executed by the CPU 12 in 319 corresponds to a procedure for selecting a process, and the CPU 12 executing this process corresponds to a process selecting unit. The procedure executed by the CPU 12 in S60 of FIG. 6 by the rewriting program 46, the replacement program 47, and the synthesizing program 48 is the procedure of the rewriting character string processing of the present invention, and the CPU 12 executing this processing corresponds to the rewriting character string processing means. The procedure executed by the CPU 12 in S90 of FIG. 6 by the pointer movement program 45 corresponds to the pointer movement procedure, and the CPU 12 executing this processing corresponds to the pointer movement means.

As described above, the present invention has been described based on one embodiment. However, the present invention is not limited to the above-described embodiment, and various improvements and modifications can be made without departing from the gist of the present invention. Can be easily inferred.

For example, the first language and the second language have been described using Japanese and English as examples, but the reverse case is, of course, applicable to other languages.

In the process of this embodiment, translation, word translation, Romaji conversion, and non-conversion are selected and performed. It may be configured to convert to phonetic characters, symbols, and the like.

Further, the arrangement and storage location for storing the processing contents and the position and length of the character string such as the character string to be corrected are not limited to the present embodiment, but can be variously changed by those skilled in the art. Needless to say,

[0080]

As is apparent from the above description, claim 1
In the translation device according to the invention, when the rewritten character string designated by the pointer is corrected, the rewriting character string designated by the pointer before the movement is processed by the predetermined processing method only by performing a predetermined operation. There is an effect that the pointer can be moved to the rewritten character string that has been performed and is arranged next. Therefore, it is possible to proceed with the translation work while confirming the translation content without complicated operation by the operator, and it is possible to easily obtain a translated sentence.

In the translation apparatus according to the second aspect of the invention, in addition to the effects of the translation apparatus according to the first aspect, only the rewritten character string in the bilingual sentence is corrected, and the character string other than the rewritten character string is translated. There is an effect that it is not changed by the processing. Therefore, by having as a translation a highly-completed bilingual sentence which is easy for the operator to understand with a natural first language input sentence, corresponds to the first language sentence, and does not generate the first language sentence by the translation algorithm, The rewritten character string portion is processed into a desired character string, and a natural translated sentence as a whole can be easily obtained.

According to a third aspect of the present invention, in addition to the effect of the first or second aspect of the present invention, the predetermined processing method includes the steps of: Because it is a translation process that translates into columns,
If only a portion to be translated is set as a rewritten character string, translation and confirmation can be performed very efficiently only by moving the pointer.

According to a fourth aspect of the present invention, in addition to the effect of the first or second aspect of the present invention, the translating apparatus is provided with a plurality of processing means. There is an effect that not only the processing of the string but also the processing corresponding to the character string can be individually performed. Therefore, there is an effect that it is possible to obtain a highly complete translation desired by the operator.

According to a fifth aspect of the present invention, in addition to the effect of the fourth aspect of the present invention, the rewritten character string information storage means is configured to also serve as the processing method storage means. Since the rewritten character string information storage means also functions as the processing method storage means, there is an effect that information on an arbitrary rewritten character string can be collectively and easily processed.

In the computer-readable recording medium storing the translation processing program according to claim 6, when the rewrite character string indicated by the pointer is corrected, the computer moves the pointer only by performing a predetermined operation. There is an effect that the processing is performed on the rewritten character string specified previously by a predetermined processing method, and the processing of moving the pointer to the next arranged rewritten character string can be executed. Therefore, it is possible to proceed with the translation work while confirming the translation content without complicated operation by the operator, and it is possible to easily obtain a translated sentence.

A computer-readable recording medium on which the translation processing program according to the invention of claim 7 is recorded,
In addition to the effects of the computer-readable recording medium on which the translation processing program according to claim 6 is recorded, the computer corrects only the rewritten character string in the bilingual sentence, and converts character strings other than the rewritten character string into translations. There is an effect that a process that is not changed by the process can be executed. Therefore, by having as a translation a highly-completed bilingual sentence which is easy for the operator to understand with a natural first language input sentence, corresponds to the first language sentence, and does not generate the first language sentence by the translation algorithm, The rewritten character string portion is processed into a desired character string, and a natural translated sentence as a whole can be easily obtained.

In a computer-readable recording medium recording the translation processing program according to the present invention,
In addition to the effect of the computer-readable recording medium on which the translation processing program according to claim 6 or 7 is recorded, the predetermined processing method to be executed by the computer is characterized by converting a first language character string into a second language character string. Characteristically, this is a translation process that translates into a character string.If only the part to be translated is set as a rewritten character string on the computer, translation and confirmation can be performed very efficiently simply by moving the pointer. There is an effect that it can be executed.

According to a ninth aspect of the present invention, there is provided a computer-readable recording medium recording a translation processing program, in addition to the effects of the computer-readable recording medium recording the translation processing program according to the sixth or seventh aspect. The predetermined processing method of the rewritten character string to be executed by the computer includes a plurality of processes, and the computer selects a processing method for selecting the predetermined processing method for each of the rewritten character strings; And a processing method for storing the processing method selected in accordance with the procedure described above in association with the rewritten character string. However, there is an effect that the processing suitable for the character string can be executed individually. Therefore, there is an effect that a translated sentence with a higher degree of completion desired by the operator can be obtained.

According to a tenth aspect of the present invention, there is provided a computer-readable recording medium storing the translation processing program according to the ninth aspect, in addition to the effect of the computer-readable recording medium storing the translation processing program according to the ninth aspect. Since the rewritten character string information storage means also serves as the processing method storage means, there is an effect that the computer can execute a process in which information on an arbitrary rewritten character string is easily understood in a lump.

[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 contents stored in a database 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. 4A shows a self-introduction template 41 before correction.
It is explanatory drawing which shows a. (B) It is explanatory drawing which shows the self-introduction template 41a under correction.

FIG. 5A shows a self-introduction template 41 being modified.
It is explanatory drawing which shows a. (B) It is explanatory drawing which shows the self-introduction template 41a under correction.

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 (S60) of a pointer instruction portion in 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 a rewriting character for displaying, on a display device, the bilingual sentence and a pointer indicating the rewriting character string in the character string of the bilingual sentence. Column display means, and when there are a plurality of the rewritten character strings, a pointer pointing to the rewritten character string displayed on the display device by a predetermined operation, and the rewritten character stored in the rewritten character string information storage means. Column position information Pointer moving means for moving the pointer to the next arranged rewritten character string; and when the predetermined operation for moving the pointer is performed by the pointer moving means, the rewritten character designated before the movement. A rewriting character string processing unit for performing processing on a column by a predetermined processing method. 2. When translating the bilingual sentence, only the rewritten character string is processed by the predetermined processing method, and a character string other than the rewritten character string in the bilingual sentence is a character string as it is. 2. The translation apparatus according to claim 1, further comprising: a combining unit configured to combine the processed rewritten character string to generate a translated sentence. 3. The translation apparatus according to claim 1, wherein the predetermined processing method is a translation process of translating a character string in a first language into a character string in a second language. 4. A method for processing a rewritten character string, comprising: translating a character string in a first language into a character string in a second language; and displaying a character string in the first language without conversion. One of a conversion process, a word translation process of converting a character string of a first language into a corresponding word of a second language in that order, and a Roman character conversion process of writing a character string of a first language in Roman characters. A processing method selecting means for selecting the predetermined processing method for each of the rewritten character strings, and a processing method for storing the processing method selected by the processing method selecting means in association with the rewritten character string 3. The translation apparatus according to claim 1, further comprising a storage unit. 5. The translation apparatus according to claim 4, wherein said rewritten character string information storage means is configured to also serve as said processing method storage means. 6. 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 storage unit storing a translation dictionary for translating from a language to a second language, a rewritten character string for rewriting among character strings composed of the first language constituting the bilingual sentence, and a rewritten character string corresponding to the rewritten character string. A computer having a rewritten character string information storage means for storing as a table position information of a character string composed of a second language to be rewritten as a table, and instructs the bilingual sentence and the rewritten character string in the character string of the bilingual sentence. A rewriting character string display procedure for displaying a pointer and a rewriting character string on a display device, and, when there are a plurality of rewriting character strings, a pointer indicating a rewriting character string displayed on the display device by a predetermined operation, the rewriting character string Column information storage A pointer moving procedure for moving the pointer to the next arranged rewritten character string based on the position information of the rewritten character string stored in a row; and the predetermined pointer moving the pointer by the pointer moving procedure. A computer readable recording of a translation processing program characterized in that when the operation is performed, a rewriting character string processing procedure for processing the rewriting character string instructed before the movement by a predetermined processing method is executed. Storage medium. 7. The computer, when translating the bilingual sentence, processes only the rewritten character string by the predetermined processing method, and in the bilingual sentence, a character string other than the rewritten character string is directly processed. 7. A computer-readable recording medium recording a translation processing program according to claim 6, wherein the translation processing program is combined with the rewritten character string processed as described above to generate a translated sentence. 8. The method according to claim 6, wherein the predetermined processing method executed by the computer is a translation process of translating a character string in a first language into a character string in a second language. A computer-readable recording medium on which the described translation processing program is recorded. 9. A predetermined processing method for the rewritten character string to be executed by the computer, the method comprising: translating a character string in a first language into a character string in a second language; A non-conversion process that is displayed by conversion, a word translation process that converts the first language character string in the same order into a corresponding word in the second language, and a romanization conversion process that converts the first language character string into romaji. Including any two or more of these processes, the computer comprising: a processing method selection procedure for selecting the predetermined processing method for each of the rewritten character strings; and a processing method selected by the processing method selection procedure.
8. A computer-readable storage medium storing a translation processing program according to claim 6, wherein the storage medium stores the translation processing program according to claim 6 or 7, wherein the processing method stores the processing method in association with the rewritten character string. 10. The computer-readable storage medium according to claim 4, wherein the rewriting character string information storage unit is configured to also serve as the processing method storage unit. Possible recording medium.