JPS62290965A - Detecting system for display flickering - Google Patents

Abstract

PURPOSE:To automatically detect an area having high possibility for flickering of KATAKANA (square form of Japanese syllabary) display, by providing a sentence memory means, a KATAKANA string deforming means, a deforming result memory means, a deforming result comparing means, a KATAKANA string comparing means and a partial display means respectively. CONSTITUTION:This system consists of a sentence memory part 1, a KTAKANA string extracting means 2, a KATAKANA string memory means 3, a KATAKANA string deforming means 4, a deforming result memory means 5, a deforming result comparing means 6, a KATAKANA string comparing means 7 and a flickering part display means 8. the means 7 detects a group of KATAKANA strings having coincidence among deforming results but no coincidence among these KATAKANA strings before deformation by comparing a group of KATAKANA strings detected by the means 6 with those KATAKANA strings stored in the means 3. Then the means 8 displays a group of KATAKANA strings detected by the means 7.

Description

DETAILED DESCRIPTION OF THE INVENTION Detailed Description of the Invention (Field of Industrial Application) The present invention relates to a method for detecting portions of Japanese text where the katakana notation varies.

(Prior Art) Japanese is an extremely flexible language, and it is possible to incorporate words from various other languages. Words introduced into Japanese in this way are called foreign words and are usually written using katakana.

However, the way foreign words are written in katakana is not fixed, and there are often multiple ways to write katakana. For example:

piano-piano, violin-violin, violin 1nterf
ace-4 interface, interface, interface, interface
Monthly Japanese Language Council Report [Although some guidelines on how to write foreign words have been provided, such as the written form of 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,
Now that it is being digitized, stored, and reused, it is easy 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 began to be held in In such cases, the consistency of the text as a whole becomes a problem, and one of the major causes of this is fluctuations in the katakana omote technique.

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

(Problems to be Solved by the Invention) An object of the present invention is to provide a method for automatically detecting fluctuations in katakana notation, for which there has conventionally been no way to detect it other than checking visually.

(Means for Solving the Problem) The present invention provides a text storage means for storing sentences inputted in advance, a katakana string extraction means for extracting a katakana string from the sentences stored in the text storage means, and a katakana string extraction means. katakana string storage means for storing the katakana string extracted by the katakana string; katakana string transformation 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 transformation result storage means for storing a result transformed by the katakana sequence transformation means in association with a katakana sequence stored in the katakana sequence storage means; and a comparison between the transformation results stored in the transformation result means so that the transformation results match. The transformation results are matched by comparing the transformation result comparing means for detecting a group of katakana sequences detected by the transformation result comparison means with the katakana sequences stored in the katakana sequence storage means. A notation characterized in that the katakana string before transformation comprises a katakana string comparing means for detecting a group of different katakana strings, and a fluctuation part displaying means for displaying a group of katakana strings detected by the katakana string comparing means. This is a vibration detection method.

(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 spelling deviation detection 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 (column 1). The katakana string transforming means 4 searches for the katakana or katakana string on the left side of the arrow below from the katakana strings stored in the katakana string storage means 3, and replaces it with the katakana or katakana string on the right side of the arrow below, or Perform deletion.

(Example 1) How-how-E-Bee-V-o-bo-Fa → Huff-E-Hiff-Ni-Fu-O → Whi-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-K-E-E-E-E interface
Kyaakia Hear Hear Beya-Bea-Ya-Air Carea-Care Hair-Hair-Bear-Bear-Two (Delete) -1 (Delete)... The transformation result storage means 5 stores the results transformed by the Katakana string transformation means 4 in the Katakana string storage means 3. It is stored in association with the katakana sequence.

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 comparing 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. The previous katakana string sends position information in the sentence stored in the sentence storage means 1 to the fluctuation part display means 8 for a group of different katakana strings.

The deviation part display means 8 displays the katakana string at the position sent from the katakana string comparison means 7 as a candidate that is likely to have a deviation in writing.

As the display means 8, a CRT display, a liquid crystal display, a kanji printer, etc. can be used. Display methods include marking the detected katakana string by highlighting it or displaying it in color, or displaying the detected katakana string as a keyword in KWIC format (using the keyword as a keyword). It is also possible to cut out and display the text along with its surrounding context.

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

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

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 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 [ ] are the serial numbers of the katakana string, and the numbers in ) 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] (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" becomes "module" by deleting "-".

[Interface] becomes [interface j by replacing "fehe", and becomes "interhes" by deleting rJ. "Interface" becomes "interheis" by replacing "fehe",
Next, by replacing [hey heh], it becomes "interhes", and then by deleting "-", it becomes [interhes].
becomes. "Interface" becomes "interhes" by replacing "fehe", and further becomes "interhes" by deleting [-]. The other katakana string "Program J "Simple"[Point"] is not transformed by the katakana string transforming means 4 of this embodiment, which performs the deletion/replacement 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 the Katakana string modification means 4 is not limited to (Example 1). In addition to (Example 1), there are other methods that can be considered, such as deleting "n" or changing lowercase letters to uppercase letters, and if such methods are adopted, a different transformation result than this example will be obtained. It will be done.

[1] Program [2] Module [3] Module [4] Interface [5] Simple [61 points [7] Module [81 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]
A group of [8] and [9] 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], the katakana string storage means 3 determines whether the katakana strings before transformation match.
Search and find out. As a result, [2] [3] [7]
It turns out that [4], [8], and [9] match, and that [4], [8], and [9] are different, and the transformation results match, but the position information in the sentence regarding [4], [8], and [9], which have different katakana sequences before transformation. (43-50), (117-124), (135-1
41) is sent to the fluctuation portion display means 8.

The fluctuation part display means 8 displays the katakana string at the position sent from the katakana string comparison means 7. Examples of the display by the shaking portion display means 8 are shown in FIGS. 2 and 3. Figure 2 shows an example where the detected part is displayed with underlining, and Figure 3 shows the KWI with the detected part as the center.
This is an example of C display.

(Effects of the Invention) As explained above, according to the present invention, it is possible to detect deviations in katakana notation that are likely to be caused by deviations in katakana notation, which conventionally had no method of detecting other than visual check. It becomes possible to automatically detect parts, making it possible to improve the efficiency of proofreading work.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG.
The figure and FIG. 3 are examples of the fluctuation portion display means. 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...Deformation result comparison means 7...Katakana string comparison means 8...Wobble part display means Fig. 1 Fig. 2 Wobble part display means 8 Fig. 3

Claims (1)

[Claims] text storage means for storing sentences input in advance; katakana string extraction means for extracting katakana strings from the sentences stored in the text storage means; katakana string storage means for storing katakana strings extracted by the katakana string extraction means. , a katakana string transforming 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 transformation result storage means for storing the transformation result by the katakana sequence transformation means in association with the katakana sequence stored in the katakana sequence storage means; a transformation result storage means for comparing the transformation results stored in the transformation result storage means; a transformation result comparing means for detecting a group of matching katakana strings; the transformation results match by comparing the group of katakana strings detected by the transformation result comparing means with the katakana strings stored in the katakana string storage means; A notation characterized in that the katakana string before transformation comprises a katakana string comparing means for detecting a group of different katakana strings, and a fluctuation part displaying means for displaying a group of katakana strings detected by the katakana string comparing means. Shake detection method.