JPS6177969A - Paging system for correction - Google Patents

Abstract

PURPOSE:To attain the comparison between the 1st and 2nd languages to improve the correcting efficiency by giving identification marks to the prescribed units of a text of the 1st language and displaying these marks together with the identification marks given to the prescribed units of the interpreted 2nd language on the same screen. CONSTITUTION:The identification codes are given to an English sentence file of an external memory 6 of a paging system for each sentence. The same codes are given to the translated Japanese words of a file for translated sentences in response to each sentence of an English sentence text. A processor 3 is connected to the memory 6. Then a memory 4 containing the original and a translation text and a display device 1 containing a screen buffer 5 and an input device 2 like a keyboard, etc. are connected to the processor 3. Then an English sentence to which the identification codes are given for each sentence of an English sentence file of the memory 6 is read out and displayed on the same screen of the device 1. The Japanese words are displayed in response to said identification codes. Then the subjects are compared with each other between an English sentence and the Japanese words by means of said identification codes.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention is applicable to proofreading of a second language in a system that machine translates text in a first language (for example, English) into a second language (for example, Japanese). This relates to a paging method.

[Background of the invention]

In machine translation systems using computers.

It is essential to check and proofread the translation results when the computer is busy. In a system that performs machine translation from a first language to a second language, what is the method for proofreading the second language using correspondence information of both languages?

It is disclosed in Japanese Patent Application Laid-Open No. 58-101365. It describes the interlocking scrolling machine 11@ for both languages, but since it scrolls line by line, the correspondence relationship due to the difference K in text length between the first language and the second language is not necessarily easy for proofreaders to understand. (There were cases where it did not take shape.)

[Purpose of the invention]

In view of the above points, it is an object of the present invention to provide a display method that allows easy comparison of texts in both languages during proofreading of a translated text in translation processing.

[Summary of the invention]

In order to achieve the above object, the present invention provides a first language text in a predetermined unit (for example, a sentence unit) that is given an identification symbol, and a second language text that corresponds to the above unit in the first language through a translation process. Predetermined units of text in each language are given the same identification symbol, and texts in both languages are displayed in correspondence on the same screen.

[Embodiments of the invention]

The present invention will be explained in detail below using five examples.

FIG. 1 represents a block diagram illustrating an embodiment of a device for implementing a paging method according to the present invention. In the figure, 1 is a display device, 2 is an input device such as a keyboard, and 3 is a processor.

4 represents a memory, 5 a screen buffer, and 6 an external memory such as a magnetic disk. In this example, for convenience of explanation, 5
With English as the wc-language and Japanese as the second language, nine paging methods used during proofreading in translation from English to Japanese will be described.

The external memory 6 contains English files that are managed by assigning identification numbers to each sentence of English texts, and English files that are managed by assigning identification numbers to each sentence of English text, and files that have been converted by the translation process 9 and are assigned the same identification number corresponding to each sentence of the English texts. Japanese text files (hereinafter referred to as translated files) managed by the system are accumulated, and can be read out by R number, and can also be read out in ascending or descending order, and at the same time, the read identification number can be known. It is in a format that allows you to

The structure of such a text file is shown in Figure 3.
What are the English file and translation file in external memory 6? As shown in Figure X3, 5i (is a file consisting of an identification number, an index section consisting of a group of pointers that locates which data section busy data is stored, and a data section that stores the identification number and English or translated data. Yes. 3rd
The index set (I S ) 1101 in the figure stores the maximum number of identification numbers stored in each sequence set (S S ) 1102 and a pointer indicating which sequence set. The maximum identification number in the control interval (CI) of each control area (CA) 1103,
Stores a pointer indicating which control interval.

This two-hour control interval corresponds to one track of a magnetic disk device. By searching the index section, arbitrary data can be looked at, and can also be read in ascending order or descending order.

Also, and ascending order.

When read in descending order, record 1104 in the data section
has a 1wt-specific number, so it is possible to know the job-specific number of the read data.

The operation of the embodiment having the above configuration will be explained with reference to the processing schematic diagram in FIG. 2 and the processing flowcharts in FIGS. 4 and 5. FIG. 4 is a flowchart of the process of checking English sentences and their translations. First, when an identification number is specified using the keyboard 2.

The processor 3 stores the designated identification number in the memory 4, the English sentence final display centiphus number variable area LES, and the translation final display sentence number variable area LNS (30
1). Next, save the English sentences and translation sentences of the identification numbers of LES and LNS to the English file in the external memory 6.
Read each from the translation file 7 and transfer it to memory 4 (
302). Continuing with the English sentences from Memory 4,
Check whether the translated sentences fit into each display area as shown in Figure @2.

The size of the display screen is fixed and the maximum number is known. Therefore, the maximum value area MXE of the original text (English text) display area and the maximum value area yixN* of the translated text area of the memory 4 are each set to predetermined values.

Record 1104 includes information indicating the data length,
From this we can calculate the sentence length. The read English sentence length is stored in area LEL, and the translated sentence length is stored in area LNLVC.

On the other hand, the cumulative length storage area CEL for English sentences and the cumulative length storage area CNL for translated sentences are initialized to 0 before the processing shown in FIG.

and VcCEL each time a sentence is read.

The values of LEL and LNL are accumulated in CN L. At this time, the identification number of the read sentence is stored in LES or LNSK, and the length of the sentence is stored in LEL or LNLK.

By comparing the sum of the lengths of the sentences read from the English file or translated file obtained in this way with the value of \(XE or MXN, it is determined whether the sentence fits within the display area.

If it fits, the English text display area continuation flag ESF.

Alternatively, the numerical value O is transferred to the translation display area flag NSF, and the sentence is transferred to the screen buffer 5. If it does not fit, or if the read sentence is stored in the display area so that the next sentence character does not fit in the display area, the 1 display area continuation flag ESF or N5FI/C sets the value 1 and displays 1. Transfer the sentence data that fits in the area to the screen buffer 5 (
303). Next, check ESF or NSF, and if either is O, that is, if there is still space to display in the English text or translated text display area, control (
305). If the display area is filled with sentences, control is transferred to (306) (304). ESF, N.S.
The sentence of the text whose F value is O is stored in the external memory 6.
There is an English file (.) is read from the translation file and transferred to the reading memory 4 in ascending order based on the identification number when it was read last time.At this time, the identification number of the read sentence is stored in LES or LNS.And Control (
303) Return to (305). FIG. 2(α) is a display screen created by repeating one or more processes. Various proofreading processes such as insertion, deletion, replacement, movement, and copying are performed using this screen (306), but the paging method directly related to the present invention will be described below. Figure 2 shows 1 with (α) displayed on display 1.
This is an example in which screen Ib) is displayed using the paging method of the present invention. At this point, if the operator wants to continue the calibration after completing the process of the flow shown in FIG. 4, the operator presses a key indicating paging.

Then, the process moves to the flow shown in FIG. The identification numbers of the sentences displayed at the bottom of each display area, that is, the LES and LNS are compared in size (401). Figure 2 (
In the case of α), the English text and the translated text are the same (1m division number 4), so the control moves to (402).

In step (402), it is checked whether the English text and translated text displayed in the area are displayed to the end of the sentence. This is done by comparing the values of MXE and MXN with the accumulated characters of the read English text and the translated text, respectively. In Figure 2 (α),
Both the English and translated sentences do not display the entire final display sentence (403'l), so perform the process (409) and display the fourth sentence.
Returning to the beginning of the second and subsequent screens in the figure, the process is performed and a display screen is created and displayed as shown in FIG. 2(h).

This process is repeated until the text to be proofread is completed.

The other cases are as explained in detail in FIG. If I could add a little more explanation.

The judgment case on the left in step 404, the YES case in 406, and the YES case in 407 indicate cases in which the original text or translated text is too long to display even one sentence completely on one screen. In this case, even if the same sentence is displayed next time, the same thing will be repeated, so we decided to display the sum of the next screen from the remaining part of the screen, knowing that there would be an unforeseen problem with one proofreading. .

In addition to the above embodiments, a code for identifying a sentence may also be displayed.

〔Effect of the invention〕

As explained above, according to the present invention, text in the first language and text in the second language always correspond to each other on the same screen, and sentences with the same number are displayed at the beginning of each display area.

Target comparison is easily possible and efficient calibration processing is possible.

[Brief explanation of drawings]

1 is a block diagram showing an embodiment according to the present invention; FIG. 2 is an explanatory diagram showing an outline of processing in an embodiment according to the present invention; 311iJ is a diagram showing the structure of an English file or a translated file; ff141M+ is. FIG. 5 is a flowchart showing a processing flow of a display rule in paging according to an embodiment of the present invention; FIG. ■... Display device 2... Input device such as keyboard 3... Processor, 4... Memory 5...
Screen buffer 6: External memory such as a magnetic disk.

Claims (1)

[Claims] In a system for proofreading a second text written in a second language, which is a translation of a first text written in a first language, the first text is divided into predetermined units, and identification symbols are assigned to each part. a first storage area to be assigned and stored;
a second text that assigns and stores an identification symbol corresponding to a predetermined unit of a second text that corresponds to the unit of the first text;
has a storage area of 1, reads texts from the first and second storage areas, displays the first and second texts simultaneously on the same screen of the display device, and displays them on the current display screen during paging. Based on the comparison of the identification symbols of the texts displayed at the bottom of the first and second texts, and the display state, a predetermined unit of the second text corresponding to the first text is displayed at the top of each display area on the next screen. A paging method in proofreading, which is characterized in that it can be displayed on the screen.