JPH03119464A - Kana/kanji conversion system for word processor - Google Patents

Abstract

PURPOSE:To reduce the time and the labor required for the search of a desired character out of many candidates when the character having a special reading manner is used in a document by storing and taking out the characters forming a pair based on a first-in/last-out rule and then displaying successively the stored characters. CONSTITUTION:When the characters are displayed in a certain reading manner, the characters AB is swept out to a working area 23 from a 1st candidate storing area 21 which stores the 1st candidate characters. Then the characters EF selected out of plural candidates are stored in the area 21. Then the storing order of characters is put close toward a lower level so that the first area of a semi-candidate storing area 22 is defined as an idle area. When a special reading manner is used to display a symbol, e.g., a parenthesis symbol where two characters are used in a pair, the final position is decided as CD of the area 22 as well as the area 21. Thus, the character to be paired with the character selected finally is displayed as the first candidate of the conversion result.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a kana-kanji conversion method, and in particular, inputs the "reading" of a kanji in hiragana, and selects several characters corresponding to the input "reading" as candidates. This invention relates to a function for creating a document containing a mixture of kanji and kana characters by repeatedly displaying and selecting the desired character, and to a kana-kanji conversion method in a word processor that has a so-called learning function.

[Conventional technology]

This type of conventional kana-kanji conversion method memorizes the last character used for one "reading" when any character is selected from a group of candidate characters corresponding to the input "reading". If the same 1゛ reading is input, the memorized character will be displayed as the first candidate among multiple candidates, and if the same ``reading'' is used repeatedly, the character that has been memorized will be displayed as the first candidate among multiple candidates. This had the advantage of saving the effort of searching for the desired character from among the group. It also has a function to memorize the last character used for each ``pronunciation'' of regular characters, making it possible to create documents smoothly.

[Problem to be solved by the invention]

However, in the conventional kana-kanji conversion method described above, characters that are not treated as words in a document (for example, parentheses, etc.) are generally not treated as words. Because the number of characters to be read becomes long and it takes time and effort to create a document, one special ``1-reading'' has been determined, and many characters may be displayed as candidates for the conversion result for one special ``reading. be.

Therefore, when inputting such a special r reading, it is almost always necessary to select the desired character from a large number of candidates.

Furthermore, in documents, these parentheses etc. are usually used as pairs of two types of characters, so they have the same "reading".
(Special "reading" for converting bracket symbols etc.)
When repeatedly using , even if the last character used is displayed as the first candidate among multiple candidates, the actual required character is a pair with the character displayed as the first candidate. It is often a letter, and there are also many cases in which pairs of different types of letters (pairs of different types of parentheses) are used in layers, and in the end, the necessary character is found from among a large number of candidates. This method has the drawback that it requires a lot of work and documents cannot be created smoothly.

[Means to solve the problem]

The method of the present invention is to input the first reading of a kanji in hiragana, display several characters corresponding to the input reading as candidates, and select the desired character, which is repeated. It has a function to create a document with a mixture of characters, and it memorizes the last character selected from among multiple candidates for the input "reading", and when the same "reading" is input again, In the kana-kanji conversion method in a word processor that has a so-called learning function that displays memorized characters as the first candidate, a group of characters that correspond to an arbitrary reading J and are candidates for selection are selected as the first candidate and the first candidate. A means for distinguishing and storing the two and subsequent candidates, and a special 1-reading 1 for displaying characters that are not treated as words in a document as a conversion result is stored in the storage area when manually written. means for displaying a plurality of candidates and searching for a character that pairs with an arbitrarily selected character from among the candidates; means for storing the searched character in an area of the storage area that stores the first candidate; Arbitrarily expand the storage capacity of the area that stores the first candidate.
Each time a character other than the character 1-6= displayed as the first candidate is selected when the special reading 1, which is the same as the reading 1, is selected, the first candidate obtained by the means for arbitrarily expanding the storage capacity of the area for storing the first candidate for the character to be paired with the selected character found by the means for searching for a character to pair with the selected character; When the candidate is stored in an empty area in the memory area and the same "reading J" as the special "reading" is input again, the above display is performed each time the character displayed as the first candidate is selected. The above-mentioned special It is characterized by a function in which when the same "reading" as "reading" is input again, the character that pairs with the last selected character is displayed as the first candidate for the conversion result.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a relationship diagram provided in the present invention for managing a group of characters used when converting from an arbitrary reading j to a kanji or symbol.

In FIG. 1, 1 is a candidate character group management table corresponding to [pronunciation 1], and 2 is a candidate character group storage area that stores character groups in the order of displayed characters. Each entry in the candidate character group management table 1 stores an address indicating where the candidate character group storage area 2 corresponding to reading J is located in the entire storage area.

Next, FIG. 2 is a diagram showing the inside of the candidate character group storage area 2 in detail, and 21 is a first candidate that stores the first candidate character when displaying a character for a certain "reading". This is a storage area. 22 is a quasi-candidate storage area in which characters from the second candidate onwards are stored in the same way as the first candidate storage area 21. The semi-candidate storage area 22 also stores characters from the second candidate onwards in the order in which they are displayed. Reference numeral 23 denotes a work area that is reused to replace the characters in the first candidate storage area 21 with new characters when converting the reading into kanji or symbols.

Here, FIG. 3(A) shows the processing flow when the character rEFJ is selected from several candidates for "rabcd" which is the "pronunciation" of a word when using the method of the present invention. It is a diagram. FIG. 3(B) is a state transition diagram showing state changes of the candidate character group storage area 2 for each process.

By process 31, the character rABJ initially stored in the first candidate storage area 21 is swept out to the work area 23. Next, in step 32, the character "EF" selected from the plurality of candidates is stored in the first candidate storage area 21. Then, in process 33, the character rEFJ is stored in the quasi-candidate storage area 22.
The empty area is repacked so that the part where it was stored becomes an empty area. At this time, the characters are rearranged one by one in order to make the first area of the quasi-candidate storage area 22 a vacant area.

In the example of FIG. 3, when the process 32 is finished, the candidate character group storage area 2 is as shown in 302 in FIG. 3(B), so the character rCD is stored in the process 33.

will be lowered in storage order in the quasi-candidate storage area 22. Then, I'A 111, which had been temporarily stored in the work area 23, is stored in the first area of the semi-candidate storage area 22, which has become a vacant area through process 34.

By the above processes 31 to 34, reading r a, t+ c
When r EF is selected from several candidates for "d", the state of the candidate character group storage area 2 changes as shown at 304 in FIG. 3(B). Therefore, if there is an instruction to display characters for the same reading r a b c d, 1 again, the characters will be displayed using the candidate character group storage area 2 which is in the state 304. letter rE
FJ will be displayed as the first candidate.

Now, the input [Yomi-kata] is not normally treated as a word, but a special ``Yomi-kata'' is used to display symbols that are used as pairs of two characters (for example, parentheses [[1 and "]1)". ”, arrangements should be made to perform the processing according to FIG. 4. Now, with reference to FIG. 4, we will explain the process when the character [XJ] is selected from among several candidates for the special ``pronunciation'' of rxyz.

FIG. 4(B) is a state transition diagram showing state changes of the candidate character group storage area 2 for each process, similar to FIG. 3(B).

The character r X , 1 selected by process 41 is swept out onto the work area 23 . Next, in process 42, since the area where the character [XJ was stored becomes empty, a repacking process is performed on the candidate character group storage area 2 including the first candidate storage area 21. Next, processing 43 is the selected character r
, 1 is searched for in the candidate character group storage area 2, and the character rYJ is stored in the first candidate storage area 21. Here, the method of searching for the character [Y, 1 that forms a pair with the character "X" from the candidate character group storage area 2 is not specifically mentioned, but for example, the character "Y" for the character "X" is previously searched for -
There is also a method of storing them in the candidate character group storage area 2 in combination. In the subsequent process 44, the part where the characters "YJ" were stored in the quasi-candidate processing storage area 22 becomes an empty area, so the empty area is refilled in the same way as the process 33 in FIG. 3 (A>).At this time, The area to be repacked is the semi-candidate storage area 22. Then, in process 45, the characters "XJ" temporarily stored in the work area 23 are moved to the first area of the semi-candidate storage area 22 which has become an empty area. Store.

Above is the special ``pronunciation J r X 3/ 7. J
When the character "χ" is selected from among several candidates, the state of the candidate character group storage area 2 is 405 in FIG.
It changes like this. Therefore, read again r x y z
, 1, the character is displayed using the candidate character group storage area 2 which is in the state 405, so the character "Yl" is a character that forms a pair with the character "X". will be displayed as the first candidate.

Figures 5 and 6 show the processing according to the present invention when another character "V" is selected when the character "Y" is displayed as the first candidate when there is an instruction to display characters for the same reading rX3/ZJ. This will be explained using figures.

When the character "■" is selected, as described above, the characters r W and + which form a pair with the character [YJ are searched for and stored in the first candidate storage area 21 according to the flow shown in FIG. Adding the process 51 in FIG. 5 before performing the process 42 in FIG. 4,
In process 51, it is checked whether or not there is a character that is a pair of the characters stored in the first candidate storage area 21.

At step 501 in FIG. 5(B), it is checked whether there is a matching character for the character "Y", and since the character "X" exists in the candidate character group storage area 2, processing 52 is subsequently performed.

In process 52, since the area where the character [v] was stored becomes empty, a repacking process is performed on the entire candidate character group storage area 2 including the first candidate storage area 21, and at this time, the -th candidate storage area Expand the storage capacity of 21 by one. Then, in process 53, the character r that is paired with the character rJ selected by the same method as in process 43 as described above.
W, is searched from the candidate character group storage area 2, and the character rW, is stored in the enlarged empty area of the first candidate storage area 21. Further, in steps 54 and 55, the empty area is refilled and the work area 23 is released. If in process 51 there is no character that pairs with the character stored in the first candidate storage area 21, process 42 of FIG. 4 is performed.

Now, the state of the candidate character group storage area 2 is 5 in FIG. 5(B).
05, the reading [X3'ZJ is input and the character r W J displayed as the first candidate is selected. The character "■" and the characters r W J were used in pairs. At this time, the character "W" is stored in the work area 23 by process 61 in FIG. 6, and the empty areas are refilled in the entire candidate character group storage area 2 including the first candidate storage area 21. At this time, the -th candidate storage area 2
1 and reduce the storage capacity by one. Then, in process 62, the free area created by reducing the storage capacity of the first candidate storage area 21 is incorporated into the semi-candidate storage area 22, and the beginning of the semi-candidate storage area 22 is brought into an empty area state. Then, in process 63, the work area 23 is opened. As a result, the state of the candidate character group storage area 2 is 6 in FIG. 6(B).
Transition to state 03. The above means that inside the pair of letters "XJ 3 4 and letter "Y",
'' and the character r W , and when creating a document, the desired character will always be displayed as the first candidate when the same "reading" is input repeatedly.

〔Effect of the invention〕

As explained above, in the present invention, when a special "reading" is specified for displaying a symbol that is not normally treated as a word but is used as a pair of two characters, the same "reading" is specified. Instead of remembering the last character used, it searches for the character that pairs with the last specified character, and displays the last character used as the first candidate. Considering the case where many types of characters are used in combination, each pair of characters found is stored in memory so that they can be stored and retrieved according to the first-in, last-out rule, and when displayed. By displaying the characters stored in the memory area in order,
This method has the effect of saving the trouble of searching for the desired character from among a large number of candidates when using characters that require reading in a document.

[Brief explanation of drawings]

Figure 1 is a relational diagram for managing character groups corresponding to any [Reading style J] used when converting from reading style 1 to kanji or symbols, etc. Figure 2 is a detailed diagram of the storage area 2 for 7 candidate sentence groups. 3, 4, 5, and 6 are diagrams showing processing flows and transition diagrams when the method of the present invention is used. DESCRIPTION OF SYMBOLS 1... Candidate character group management table, 2... 7 candidate sentence group storage area, 21... First candidate storage area, 22... Semi-candidate storage area, 23... Work area.

Claims (1)

[Claims] By repeatedly inputting the "reading" of a kanji in hiragana, displaying several characters corresponding to the input "reading" as candidates, and selecting the desired character, kanji and kana characters can be distinguished. It has a function to create a document with a mixture of characters, and it memorizes the last character selected from among multiple candidates for the input "reading", and when the same "reading" is input again, In the kana-kanji conversion method in a word processor that has a so-called learning function that displays the memorized character as the first candidate, a group of characters that correspond to an arbitrary "reading" and are candidates for selection are displayed as the first candidate and the first candidate. A means for distinguishing and storing the two and subsequent candidates, and a method for storing the plurality of characters stored in the storage area when a special "reading" is input to display characters that are not treated as words in a document as a conversion result. means for displaying candidates and searching for a character that pairs with an arbitrarily selected character from among them; means for storing the searched character in an area of the storage area for storing the first candidate; You can arbitrarily expand the storage capacity of the area that stores candidates.
and a means for reducing the size of the arbitrarily selected character each time a character other than the one displayed as the first candidate is selected when the same "reading" as the special "reading" is input again. The first candidate obtained by means for arbitrarily expanding the storage capacity of the area for storing the first candidate for a character paired with the selected character found by the means for searching for a character paired with the selected character. Each time the character displayed as the first candidate is selected when the same "reading" as the special "reading" is input again.
By arbitrarily reducing the storage capacity for storing the first candidate of the displayed character, the storage area is moved from the storage area that is insufficient to the storage area for storing the second and subsequent candidates. This kana-kanji conversion method in a word processor is characterized by a function of displaying a character paired with the last selected character as the first candidate for the conversion result when the same reading as a special "reading" is input again.