JPH03179550A - Kana/kanji converting device - Google Patents

Abstract

PURPOSE:To reduce the memory capacity by securing the matching between the inputted KANA (Japanese syllabary) strings and plural words added with the registered connection information and outputting an extracted KANA string. CONSTITUTION:A connection information register part 12 rewrites the data on a connection information register memory 17. The converted words including the input headers, the output headers, and the connection information are previously registered into a dictionary 16. A dictionary retrieving part 13 performs the matching between the character strings inputted via an input device 11 and the words registered in the dictionary 16 and the memory 17. Then the character strings extracted through the matching are displayed on a display device 15. Thus the memory capacity can be reduced and a memory area can be effectively used.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a kana-kanji conversion device for Japanese processing, and more specifically, it is capable of providing connection information different from normal connection to multiple words in a dictionary. This relates to a kana-kanji conversion device.

[Prior Art] A conventional kana-kanji conversion device for Japanese processing has a dictionary in which conversion words that have connection information between grammatical parts of speech are registered, and by performing a conversion operation, it only uses the grammar in the device's internal dictionary. By connecting the parts of speech according to the following, kana was converted into sentences containing kanji, kana, etc., and then output.

[Problems to be Solved by the Invention] However, since the connection information between parts of speech cannot be manipulated by the user, there is a problem in that even if it is possible to convert one word at a time, it is difficult to convert multiple words at once.

Also, in order to convert multiple words that cannot be converted at once into -degrees, there is a method of registering two words as one word in the user dictionary, but in that case, you need to register a new character string. Therefore, there was a problem in that a large amount of memory was required.

The present invention has been made in order to solve the above-mentioned problems, and the 5! Of the multiple words recorded,
Regarding the grammar of the dictionary in the device that has connection restrictions,
E1 To provide a kana-kanji conversion device that can convert compound words intended by a user, reduce the use of memory for user registration, and easily and quickly convert compound words. target

[Means for Solving the Problems] 1- In order to achieve the above object, the present invention provides an input means for inputting a kana character string, and a conversion word consisting of an input heading, an output heading, and connection information is registered in advance. The kana character string inputted by the dictionary and the input means is inputted into the 'A? In a kana-kanji conversion device comprising a conversion means for converting into a string of kanji-kana mixed sentences using a calligraphy and an output means for outputting the converted kanji-kana mixed sentences, connection information between multiple words in the dictionary is provided. , a rewriting means for registering or deleting in a rewritable memory, a kana character string input by the input means, a registered word in the dictionary and a plurality of words to which connection information is registered in the memory. and a matching means for performing matching, and the character string extracted by the matching means is output to the output means.

[Operation] According to the above configuration, a function called connection information registration is provided so that words that are registered in the dictionary but are not allowed to be connected can be converted even if they are connected. Connection information registration 91m function stores the word number in the specified city dictionary (It OM) by specifying the word you want to connect even if the parts of speech are not connected in the grammar in the device, and from now on. When the input character string matches a character string that is a series of registered input headings of multiple words, it is converted into a registered output heading of multiple words and output.

In addition, the connection information registration function deletes the connection information, contrary to the above, even if the connection is allowed between parts of speech in the grammar of the device's internal dictionary. In subsequent kana-kanji conversion of those multiple words, do not convert them in a connected form.

By doing this, the information stored in the dictionary is used effectively, requiring less memory for registration, and the connection information desired by the user can be registered, which improves conversion efficiency. In the direction of , L can be plotted.

``Example 1'' An example embodying the present invention will be described below with reference to the drawings.

FIG. 1 shows an example of the block configuration of this device. This device includes an input device W11 such as a keyboard or a character recognition device, a connection information registration section 12 that rewrites data in a connection information registration memory (RAM) 17, and a dictionary search section 13 that refers to a dictionary (ROM>16). A display candidate extraction generation unit 14 that generates converted display candidates, and a display device (consisting of σ15) consisting of CR, T, etc. that displays the candidates.The connection information registration unit 12 connects ↑/i using a connection information registration key. You can register multiple word numbers in the dictionary 16 by specifying whether to add or delete information.The dictionary search unit 13 performs matching between the character string input from the input device 11 and the dictionary 16 and connection information registration memory 17. Do this.

FIG. 2 conceptually shows the structure within l'LOM of the dictionary 16. The dictionary 16 has word numbers 16a for identifying individual words.
, an input heading 16b in which the pronunciation of the registered word is stored in hiragana in order to match it with the input character string, an output heading 16C in which the notation of the registered word drawn by the input heading 16b is stored, and any word that the registered word is. It consists of connection information 16d that stores information on whether it is possible to connect to.

FIG. 3 does not conceptually show the configuration of the connection information registered word memory 17, and the connection information registered word memory 17 stores continuous data of the word number 16a of the word specified by the user.
7a, user connection information 17b indicating whether the registered compound type adds or deletes a connection, and compound type 17a.
The composite heading 17c is generated by searching the input heading 16b of the dictionary 16 from the word number 16a. The display candidate generation section 14 checks whether or not the candidates matched by the dictionary search section 13 should be used as display candidates, and outputs them to the display 'A' 15 for display.

FIG. 4 is a flowchart showing the procedure for registering connection information. Hereinafter, an example of registration of connection information will be explained with reference to FIGS. 1 to 4. ``In order to convert word processor pioneer club j, input ``Warburusaki Gake Club'' on the input device 11 (step Sl, abbreviated as 81. The same applies hereafter), and press the kana-kanji conversion key. (32)
, first, the word "warp-soutage is converted into hair club j", which consists of multiple words. '' cannot be connected, so no matter how many times I type ``Waburu Saki Gake Club,'' it cannot be converted to ``Word Processor Pioneer Club.'' Therefore, before learning, press the connect + nn all registration keys and specify "word processor" and "sakigake" with the cursor (34).
The two word numbers 16a of 16 are registered in the compound form, and connection addition information is entered in the user connection information 17b. At the same time, the composite heading 17c is entered and registered as ``Wa-brosakigake'' (S5).

In addition, when deleting connection information, for example, "Purchased equipment J
When trying to convert ``Shiretabihin J'', first, ``Purchase 1t!l! Equipment'' becomes a conversion candidate, but
If the user does not need a candidate for "purchasing ability" for "purchasing", do not allow the connection of "purchasing" and "other". The registration method is to press the connection information registration key when the conversion candidate for "R Purchased Equipment" is selected, and then
is specified with the cursor, two word numbers 16a in the dictionary 16 are registered in the compound form, and connection deletion information is entered in the user connection information 17b. At the same time, it is sufficient to write in the compound heading 17c as "Ishita".

FIG. 5 is a flowchart showing the operating procedure for kana-kanji conversion. See Figures 1 to 5 below! (2) The kana-kanji conversion operation by this device will be explained.

When you input "Wavuru Saki Gake Club J" into the input device 11 and press the Kana-Kanji conversion key (321), move the dictionary search pointer to the beginning of the character string to be converted and move it toward the end.
522), and converts the character string from the pointer to the end (323).

Then, the dictionary search unit 13 matches the conversion target character with the compound heading 17c of the connection information registered word memory 17 and the input comparison 16b of the dictionary 16 (S'24, 325).
. Initially, if there is no corresponding character string in the connection information registered word memory 17, the process moves to S27, and matching with the dictionary 16 is performed (327°828). If there is still no corresponding word, the process moves to S29, and the character string to be converted is Delete one character from the end of the column and return to S24. Here, connection information registration memory 1
If there is a character string to be converted that corresponds to the compound heading 7, the user connection information 17b is added to rI+? It is checked whether it is the first report (S26), and if it is additional information, the compound heading "Wa-
The corresponding output heading ``Word Processor Sakigake'' is derived as a display candidate from ``Brussakigake'' (330).

Next, check whether there are any remaining character strings to be converted (331)
, if so, set the dictionary search pointer immediately after the previously detected word (532) and return to 323. Here, in the above example, "Club J becomes conversion pair 1, and S24.325.
After 327, in 828, there is a corresponding input heading in the dictionary 16, and the output heading "Club" is derived as a display candidate <333). Next, this display candidate is added to the deletion information of the user connection information 17b in the connection information registration memory 17I)
If the word is not in the deletion information, it is checked whether it is a word (334, 335), and if the word is not in the deletion information, the display candidate is output to the display device 15 (337), and the operation is ended. As a result, the display device 15 outputs "Club is the pioneer of word processing."

As an example of Ike, if you convert "Shireta Tabihin" into kana-kanji, there is deletion information in the user connection information 17b at 834.335 for "Shireta", so "Shishino J is a display candidate. "Purchased" is not output as a display candidate.

As a result, "purchased equipment" will be displayed.

[Effects of the Invention] As is clear from the above detailed description, according to the present invention,
The user can specify the connection between words and words included in the dictionary in the device and add information to connect or not connect them as appropriate. Memory (than string user registration)
R, AM) capacity can be reduced and effective use of memory area can be achieved.

Furthermore, since connection information intended by the user can be added and deleted, a conversion device with high conversion efficiency and precision can be realized for the user.

[Brief explanation of drawings]

Fig. 1 is a block composition diagram of a kana-kanji conversion device according to an embodiment of the present invention, Fig. 2 is a conceptual diagram showing the structure of a dictionary in the device, and Fig. 3 is a conceptual diagram of the structure of a connection information registration memory. Figure 4 is a flowchart showing the process of adding or deleting connection information when registering connection information, and Figure 5 is a flowchart showing the process of adding or deleting connection information when registering connection information. 3 is a flowchart showing the processing of FIG. 11... Input device, 12... Connection information registration unit, 13
... Dictionary search unit, 15... Output coloring, 16... Dictionary, 16b... Input heading, 16c... Output heading, 16d... Connection information, 17... Connection information registration memory , 17b... User connection information, 17c... Composite heading.

Claims (1)

[Claims] (1) An input means for inputting a kana character string, an input heading,
a dictionary in which conversion words consisting of output headings and connection information are registered in advance; a conversion means for converting a kana character string inputted by the input means into a character string containing kanji and kana characters using the dictionary; and a converted kanji character string. A kana-kanji conversion device comprising an output means for outputting a sentence containing kana, the rewriting means registering or deleting connection information between multiple words in the dictionary in a rewritable memory; a matching means for matching a kana character string with a registered word in the dictionary and a plurality of words added with connection information registered in the memory, and a character string extracted by the matching means is outputted to the output means. A kana-kanji conversion device characterized in that it outputs .