JPS62290968A - Unifying system for display flickering - Google Patents

Abstract

PURPOSE:To improve the sentence correcting efficiency by detecting automatically the flickering of KATAKANA (square form of Japanese syllabary) display and unifying these flickering displays into a KATAKANA display registered previously. CONSTITUTION:A deforming result comparing means 6 compares the deforming results stored in a deforming result memory means 5 with each other to detect a group of KATAKANA strings having coincident deforming results. The deforming results stored in the means 5 have correspondence to the KATAKANA strings stored in a KATAKANA string memory means 2. Then the correspondence information is sent to a KATAKANA string comparing means 7 for a group of KATAKANA strings having coincident deforming results. A flickering part unifying means 8 retrieves a normal KATAKANA display corresponding to the deforming result out of a rewriting method memory means 9 to the KATAKANA string at the position sent from the means 7 and then rewrites the sentence stored in a sentence memory means 1.

Description

DETAILED DESCRIPTION OF THE INVENTION Detailed Description of the Invention (Field of Industrial Application) The present invention relates to a method for detecting and unifying portions of Japanese text that have variations in katakana notation.

(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, there is an example of speed.

piano-piano, pianoviolin-violin, violin 1nterf
ace→interface, interface, interface, interface
Monthly Japanese Language Council Report [Although guidelines for writing foreign words have been provided in the "How to Write Foreign Words," the current situation is that people use different ways of writing foreign words in katakana.

Also, 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,
Now that it is being digitized, stored, and reused, it has become easier to combine sentences created by multiple people into a single sentence, or to partially modify and use sentences and example sentences created by others. It started to be done. 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.

(Intersets 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 way to be detected 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 katakana string storage means for deforming the katakana string stored in the katakana string storage means by deleting or replacing a specific katakana or partial katakana string. a katakana string transformation means for adding a katakana string; a transformation result storage means for storing the results transformed by the katakana string transformation means in association with the katakana string stored in the katakana string storage means; a transformation result comparison means for comparing transformation results to detect a group of katakana sequences with matching transformation results; and a katakana sequence stored in the katakana sequence storage means for the group of katakana sequences detected by the transformation result comparison means. A katakana string comparison means detects a group of katakana strings that have the same transformation result but a different katakana sequence before transformation by comparing the katakana strings; A rewriting method storage means that is stored in correspondence in advance, and a deviation part rewriting means that rewrites a group of katakana strings detected by the katakana string comparison means into regular katakana notation stored in the rewriting method storage means. This is a system that unifies variations in notation.

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

FIG. 1 is a block diagram showing the configuration of an embodiment of the notation variation unification method of the present invention. In FIG. 1, a text storage means 1 stores previously input Japanese texts as character codes, and uses an IC memory, a magnetic disk device, a magnetic tape device, etc.

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 writes the transformation result into the transformation result storage means 5. . 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). Katakana string transformation means 4 performs (
Search the katakana or katakana string that is the source of the arrow in column 1) from the katakana string stored in the katakana string storage means 3, and replace it with the katakana or katakana string that is at the tip of the arrow in (Example 1), or delete it. .

(Example 1) '7''A-ha-ha-e-bive-be-vu-o->bo-fa-ha-fi->hi-fe->he-for-ho-i-i-i-ki-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-n-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-i-n-i-i-i-i-i-i-i-i-i-i-i-a----- ya → hair paya bean (delete) - one (
Deletion) The transformation result storage means 5 stores the result transformed by the katakana sequence transformation means 4 in association with the katakana sequence stored in the katakana sequence 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 extracts from the katakana string storage means 3 a group of untransformed katakana strings with matching transformation results based on the correspondence information sent from the transformation result comparison means 6. 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 strings stored in the katakana string storage means 3 are given position information in the sentences stored in the sentence storage means 1, the katakana string comparison means 7 determines that the detected transformation results match. For a group of katakana strings in which the katakana strings before transformation are different, the position information in the sentence stored in the sentence storage means 1 and the katakana string as a result of transformation are
It is sent to the wobbling portion 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 registered and I
C 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 j, "interface", and "interface 1" into the katakana notation "[interface j", the transformation by the katakana sequence transformation means 4 for these is ”, so as shown in Figure 2, the notation 90 of the transformation result is [INKHESU], and the unifying notation 91 is
All you have to do is register it as [Interface].

The deviation part rewriting means 8 rewrites the katakana string sent from the katakana string comparison means 7 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.

The Kana-Kanji conversion module takes the Kana string,
An interface that returns a string containing kanji and kana characters can be considered, but the problem with this interface is how to handle selection operations.

Next, the katakana string extraction means 2 extracts katakana () from the character storage means 1, and writes it into the katakana string storage means 3. The result is as follows. The number in () is the information about the position of the katakana sequence in the sentence, and is the number of characters counted from the beginning of the sentence.

[11 (1-5) Program [2] (7-11) Module [3] (36-40) Module [4] (43-50) Interface [5] (5
8-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 deletes or replaces the katakana or katakana string as shown in (Example 1).

That is, [module j becomes [module j by deleting [-4].

``Interface J'' becomes ``Interface'' by replacing ``FaheJ'', and further becomes ``Interface J'' by deleting ``-''. "Interface" is "Interface".
Replacement of [heihe-1] becomes "interheis", followed by replacement of "heihe-1", which becomes "interheis", and further deletion of r-J becomes "interheis". "Interface" becomes "interhes" by replacing "fehe", and further becomes "interhes" by deleting rJ. Other katakana strings "Program" [Simple] [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. Note that the numbers in [ ] correspond to those in the katakana string storage means 3.

However, the deletion/replacement method of Katakana string transformation means 4 is (
It is not limited to example 1). In addition to (Example 1), for example, [
Methods such as deleting the letter j or changing lowercase letters to uppercase letters may also be considered, and if such a method is adopted, a transformation result different from this example will be obtained.

[1] Program [2] Module [31 module [4] Interface [5] Simple [61 points [7] Module [8] Interface [9] Interface Next, the transformation result comparison means 6 stores the results in the transformation result storage means. Detect matching results among the transformed results. As a result, a group of [2] [3] [7], and [4]
[8] A group of 91 matches, and these numbers are sent to the Katakana string comparison means 7.

Therefore, the katakana string comparison means 7 performs [2] [3] [
7], and [4], [8], and [9] by searching the katakana listing jib means 3 to check whether or not the katakana strings before transformation match. As a result, [2] [3] [
It turns out that [7] matches and [4] [8] [9] differs, and the transformation results match, but the positions in the sentence of [4] [8] [9] with different katakana sequences before transformation information and transformation results (43 to 50: interface), (11
7 to 124: interhes) and (135 to 141: interhes) are sent to the fluctuation portion unifying means 8.

The deviation part unification means 8 searches the rewriting method storage means 9 for the regular katakana notation corresponding to the transformation result for the katakana string at the position sent from the katakana string comparison means 7, and stores it in the text storage means 1. Rewrite memorized sentences. Here, if the modification result ``regular katakana notation for interface J is searched, and if, for example, FIG. 43-1-50 characters from the beginning of the sentence, 117-124
The 135th to 141st characters are all rewritten to [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.

The Kana-Kanji conversion module takes the Kana string,
An interface that returns a string containing a mixture of kanji and kana characters is conceivable, but in the case of this interface, the problem is how to handle selection repetition.

The notation is unified as follows.

(Effects of the Invention) As explained above, according to the present invention, it is possible to automatically detect deviations in katakana notation, which conventionally had no way to detect other than visual check, and It becomes possible to standardize the notation, and it is possible to improve the efficiency of proofreading work.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG.
The figure shows an example of the rewriting method storage means 9. In the figure, 1...Text storage means 2...Katakana string extraction means 3...Katakana string storage means 4...Katakana string transformation means 5...Transformation results Storage means 6...Transformation result comparison means 7...Katakana string comparison means 8...Wave portion rewriting means 9...Rewriting method storage means Fig. 1 Fig. 2 Fig. 2 Deformation results Unified notation 90 Notation form 91 Rewriting method storage means 9

Claims (1)

[Claims] a text storage means for storing sentences inputted in advance; a katakana sequence extraction means for extracting a katakana sequence from the sentences stored in the text storage means; and a katakana sequence for storing the katakana sequence extracted by the katakana sequence extraction means. storage means,
A katakana string transforming means deforms the katakana string stored in the katakana string storage means by deleting or replacing a specific katakana or partial katakana string; A transformation result storage means that stores the transformation result in association with the katakana string stored in the sequence storage means, and a transformation result that compares the transformation results stored in the transformation result storage means and detects a group of katakana sequences with matching transformation results. By comparing the katakana strings stored in the katakana string storage means with respect to a group of katakana strings detected by the comparison means and the deformation result comparison means, a katakana string whose deformation results match but the katakana string before deformation is different is determined. katakana string comparison means for detecting a group; rewriting method storage means for storing in advance a transformation result by the katakana string transformation means and a regular katakana notation for the transformation result; 2. A writing variation unification method, comprising: a variation part rewriting means for rewriting a group of katakana strings into regular katakana notation stored in the rewriting method storage means.