JPH0544701B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a method for detecting and unifying portions of Japanese text where the katakana notation is inconsistent.

(Prior Art) The method of writing foreign words in katakana is not fixed, and in many cases, multiple methods of writing katakana are possible. For example:

piano→piano, piano violin→violin, violininterface→interface, interface, interface, interface
Although guidelines for how to write foreign words have been provided in the March 2019 Japanese Language Council report, ``How to write foreign words,'' the current situation is that the way foreign words are written in katakana differs from person to person. Furthermore, even in sentences written by the same person, the same word may be written in multiple katakana ways.

In recent years, Japanese sentences have been created using word processors, digitized, stored, and reused. It has become easy to partially modify and use it. In such cases, the consistency of the text as a whole becomes a problem, and one of the main reasons for this is variations in katakana notation.

Previously, the only way to detect such deviations in katakana writing was to visually check the katakana portion of the written text and manually rewrite it.

(Problems to be Solved by the Invention) The purpose of the present invention is to provide a method for automatically detecting and unifying variations in katakana notation, which conventionally had no method of detecting other than visually checking. be.

(Means for solving the problem) The present invention includes a text storage means for storing previously input sentences, a katakana string extraction means for extracting a katakana string from the sentences stored in the text storage means, A katakana string storage means for storing the katakana string extracted by the katakana string extraction means, and a method for deleting or replacing a specific katakana or partial katakana string from the katakana string stored in the katakana string storage means. katakana string transformation means for applying the transformation, transformation result storage means for storing the results transformed by the katakana row transformation means in association with the katakana string stored in the katakana row storage means, and the transformation results. transformation result comparison means for comparing transformation results stored in storage means to detect a group of katakana sequences with matching transformation results; and said katakana sequence storage for the group of katakana sequences detected by said transformation result comparison means. A katakana string comparing means detects a group of katakana strings whose deformation results match but the katakana string before deformation is different by comparing the katakana strings stored in the means; A rewriting method storage means that stores in advance a regular katakana notation for the transformation result, and a regular katakana notation stored in the rewriting method storage means for a group of katakana strings detected by the katakana string comparison means. This is a method for unifying fluctuations in notation, which is characterized by comprising a means for rewriting the fluctuation part to rewrite the notation.

(Example) The structure and operation of the present invention will be explained using the drawings.

FIG. 1 is a block diagram showing the structure of an embodiment of the notation variation unification method of the present invention. In FIG. 1, the text storage means 1 is for storing Japanese texts input in advance as character codes, and the IC
Memory, magnetic disk devices, magnetic tape devices, etc. are used.

The katakana string extraction means 2 sequentially searches for character codes corresponding to katakana from the first character of the sentence stored in the sentence storage means 1, extracts consecutive katakana as a group of katakana strings, and stores the katakana string in the katakana string storage means. Write in 3.

The katakana string storage means 3 stores the katakana string extracted by the katakana string extraction means 2 as well as position information in the sentence stored in the sentence storage means 1. Similar to the text storage means 1, an IC memory, a magnetic disk device, a magnetic tape device, etc. are used.

The katakana string transformation means 4 transforms the katakana string stored in the katakana string storage means 3 by deleting or replacing a specific katakana or partial katakana sequence, and stores the transformation result in the transformation result storage means 5. write to. A specific example of the transformation performed here (deletion or replacement of a specific katakana or partial katakana sequence) is as shown in (Example 1). The katakana string transforming means 4 searches the katakana string or katakana string from which the arrow in (column 1) originates from the katakana string stored in the katakana string storage means 3, and searches for the katakana or katakana string at the end of the arrow in (example 1). Replace with or delete.

(Example 1) Vua → Bavui → Bivue → Bevuo → Bohua → Hahui → Hihue → Hehuo → Hoiyi → Yi Kii → Kii Nii → Nii Hii →
Heeei → A K → K Nei → Nei Hei →
Hey ya → ya kiya → kia hiya → here piya →
Pia Eya → Air Keya → Care Hair → Hair Peya →
pair → (delete) -→ (delete) The transformation result storage means 5 is the katakana string transformation means 4
The result transformed by is stored in association with the katakana string stored in the katakana string storage means 3. An IC memory, a magnetic disk device, a magnetic tape device, etc. may be used, and it may be realized by being integrated with the katakana string storage means 3.

The transformation result comparison means 6 compares the transformation results stored in the transformation result storage means 5 and detects a group of katakana sequences with matching transformation results. The transformation results stored in the transformation result storage means 5 are given correspondences with the katakana strings in the katakana string storage means 3, and for a group of matched transformation results, the correspondence information is stored in the katakana string comparison means 7. send to

The katakana string comparison means 7 is the transformation result comparison means 6.
Based on the correspondence information sent from the above, a group of untransformed katakana sequences with matching transformation results is extracted from the katakana sequence storage means 3. Next, the katakana string comparison means 7 compares the untransformed katakana strings with which the deformation results match, and detects a group of katakana strings with which the deformation results match but with which the pre-transformation katakana sequences do not match. Since the katakana string stored in the katakana string storage means 3 is given information on the position in the sentence stored in the sentence storage means 1, the katakana string comparison means 7 detects that the detected deformation results match but are deformed. For a group of katakana sequences different from the previous katakana sequence, position information in the sentence stored in the sentence storage means 1 and the katakana sequence as a result of transformation are sent to the deflection part rewriting means 8.

The rewriting method storage means 9 registers in advance the transformation results by the katakana sequence transformation means 4 for katakana sequences that cause variations in notation, and further associates them with the transformation results and stores the regular katakana notation to be unified. It is a registered device, and IC memory, magnetic disk device, magnetic tape device, etc. are used. FIG. 2 shows an example of the contents of the rewriting method storage means 9. In FIG. 2, 90 is the notation of the transformation result, and 9
1 is a unified notation form. For example, if you want to unify the katakana notation such as "interface", "interface", "interface", "interface" into the katakana notation "interface", use the katakana string transformation means 4 for these. The transformation is "Interges"
Therefore, as shown in Figure 2, the transformation result is expressed as 9
0 should be registered as "interface" and the unified notation 91 should be "interface".

The deviation part rewriting means 8 is a katakana string comparison means 7.
The katakana sequence sent from the katakana string is rewritten into the regular katakana notation (unified notation form 91) stored in the rewriting method storage means 9 for the transformation result.

Next, the operation of this embodiment will be explained using an example.

First, it is assumed that the following sentence is stored in the sentence storage means 1.

It is important to increase the independence of program modules. To this end, the key is to make the interface between modules as simple as possible. A Kana-Kanji conversion module could be an interface that receives a Kana string and returns a string containing Kanji and Kana characters, but in the case of this interface, the problem is how to handle selection operations.

Next, the katakana string extraction means 2 extracts a katakana string from the character storage means 1 and writes it into the katakana string storage means 3, resulting in the following. [ ]
The numbers in parentheses are the serial numbers of the katakana string, and the numbers in parentheses are information about the position of the katakana string in the sentence, and are the number of characters counted from the beginning of the sentence.

[1] (1-5) Program [2] (7-11) Module [3] (36-40) Module [4] (43-50) Interface [5] (58-61) Simple [6] ( 68-71) Point [7] (83-87) Module [8] (117-124) Interface [9] (135-141) Interface For this katakana string, the katakana string transforming means 4 (for example As shown in 1), delete or replace katakana or katakana strings. That is,
"Mojiyuru" becomes "Mojiyuru" by deleting "-"
become. "Interface" becomes "interhesu" by replacing "hue → he", and becomes "interhesu" by deleting "-".
"Interface" becomes "interheis" by replacing "hue → he", then "interheis" by replacing "hey → he", and then "interhes" by deleting "-".
becomes. "Interface" becomes "Interhesu" by replacing "Fue → He", and becomes "Interhesu" by deleting "-". The other katakana strings "program,""simple," and "point" are not transformed by the katakana string transforming means 4 of this embodiment, which performs deletion and replacement as shown in (Example 1). The results are as follows and are stored in the transformation result storage means 5. In addition, the numbers in [ ] are
This corresponds to that of the katakana string storage means 3. However, the deletion/replacement method of the Katakana string modification means 4 is not limited to (Example 1). In addition to (Example 1),
For example, methods such as deleting "n" or changing lowercase letters to uppercase letters may be considered, and if such a method is adopted, a modified result different from this example will be obtained.

[1] Program [2] Module [3] Module [4] Interface [5] Simple [6] Point [7] Module [8] Interface [9] Interface Next, the deformation result comparison means 6 stores the information in the transformation result storage means. A matching result is detected among the stored transformation results. As a result, a group of [2], [3], and [7] and a group of [4], [8], and [9] match, and these numbers are sent to the katakana string comparing means 7.

Therefore, the katakana string comparison means 7 uses [2][3]
The katakana string storage means 3 is searched to determine whether or not the katakana strings before transformation match [7] and [4], [8], and [9]. As a result, [2] [3]
It turns out that [7] matches, and [4], [8], and [9] are different. Position information and transformation results (43-50: Interges),
(117 to 124: interhes) and (135 to 141: interhes) are sent to the fluctuation part unification means 8.

The fluctuation part unification means 8 is the katakana string comparison means 7.
For the katakana string at the position sent from , the regular katakana notation corresponding to the transformation result is retrieved from the rewriting method storage means 9, and the sentence stored in the sentence storage means 1 is rewritten. Here, the regular katakana notation for the transformation result "interface" is searched, and if, for example, FIG. 43rd to 50th characters from the beginning of the memorized sentence, 117 to 124
The 135th to 141st characters are all rewritten as "interface". As a result of this rewriting, the contents of the text storage means 1 are changed as follows, and the katakana notation has been unified.

It is important to increase the independence of program modules. To this end, the key is to make the interface between modules as simple as possible. A Kana-Kanji conversion module could be an interface that receives a Kana string and returns a string containing Kanji and Kana characters, but in the case of this interface, the problem is how to handle selection operations.

The notation is unified as follows.

(Effect of the invention) As explained above, according to the present invention, conventionally,
It is possible to automatically detect deviations in katakana notation, which there is no other way to detect by visual inspection, and standardize the katakana notation to pre-registered katakana notation, thereby improving the efficiency of proofreading work. I can do it.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG. 2 is an example of a rewriting method storage means 9. In FIG. In the figure, 1... text storage means, 2... katakana string extraction means, 3... katakana string storage means, 4
. . . katakana string transformation means, 5 . . . transformation result storage means, 6 . . . transformation result comparison means, 7 .

Claims (1)

[Claims] 1 A text storage means for storing sentences input in advance, a katakana sequence extraction means for extracting katakana sequences from the sentences stored in the text storage means, and a katakana sequence extracted by the katakana sequence extraction means. katakana string storage means for deforming a katakana string stored in the katakana string storage means by deleting or replacing a specific katakana or partial katakana string; transformation result storage means for storing the results transformed by the means in association with the katakana string stored in the katakana string storage means;
a deformation result comparing means for comparing the deformation results stored in the deformation result storage means and detecting a group of katakana strings with matching deformation results, and a group of katakana strings detected by the deformation result proportional means. a katakana string comparing means for detecting a group of katakana strings that have matching transformation results but different katakana strings before transformation by comparing katakana strings stored in the katakana string storage means; a rewriting method storage means storing in advance a transformation result and a regular katakana notation for the transformation result; and a rewriting method storage means storing a group of katakana strings detected by the katakana string comparison means. and a means for rewriting the deviation part to rewrite the original katakana notation.