JPH0131229B2 - - Google Patents

Description

[Detailed Description of the Invention] <Technical Field> The present invention relates to a kana-kanji conversion device that converts kana characters or kana or meibun (or Roman characters) into corresponding kanji or kanji-mixed sentences according to a kana-kanji conversion dictionary. In particular, the present invention relates to a kana-kanji conversion device having a function (shortening conversion function) of converting shortened kana characters or sentences into corresponding kanji or sentences mixed with kanji in response to the input of shortened kana characters or sentences.

<Prior Art> Recently, Japanese document processing devices (Japanese word processors) have been put into practical use for the purpose of improving document processing efficiency. This Japanese document processing device inputs a kana sentence using an input device such as a kana keyboard, searches a kana-kanji conversion dictionary, and outputs the corresponding kanji or a sentence mixed with kanji. In such a device, when creating a document, 1.
The same kanji or sentences containing kanji may appear many times in one sentence.

Previously, it was necessary to input a kana sentence each time, regardless of whether the same kanji existed or not, so even if you input the same kanji several times, you had to input the number of kana characters for that sound. However, there was a problem that the operation was complicated. One way to solve these problems is for the operator to register frequently occurring characters or sentences in advance with specific keywords, and then input only the specific keyword each time that character or sentence appears. In some cases, methods of registering the characters or sentences have been considered. However, even with this method, it is necessary to predict in advance the characters or sentences that will appear frequently and register them, and it is necessary for the operator to remember the registered sentences for the keywords. For this reason, conventional kana-kanji conversion devices either require the operator to perform complicated operations, or the operator registers characters or sentences with specific keywords and then memorizes them to convert only the keywords. Since input is required, the operation becomes complicated and there is a problem that prompt input cannot be performed.

Therefore, in order to solve the above problem, the same applicant filed Japanese Patent Application No. 57-211089 (Japanese Unexamined Patent Publication No. 59-100941).
proposed a kana-kanji conversion device with a shortening conversion function.

This abbreviation conversion function is when a certain kanji or a sentence mixed with kanji is input as a pronunciation, it automatically registers a kanji or a sentence with kanji mixed in that is equivalent to the pronunciation by a certain number of characters shortened from the pronunciation. For kanji or kanji-mixed sentences that have been converted once, simply input the shortened kana reading, and the corresponding kanji or kanji-mixed sentences will be read from the abbreviated conversion memory where the registration was performed. It is designed so that it can be instantly converted into the desired kanji or a sentence mixed with kanji.

For example, if you first input and convert "Shinseihin", the kanji (registered word) corresponding to "new product" will be registered in the abbreviation conversion dictionary (memory) as the headword "shi", and then " If you enter ``Kaihatsu'' and convert it, the headword ``Ka'' and ``Development'' will be registered in the abbreviation conversion dictionary.

Therefore, if you later want to obtain the kanji for "new product," enter the kana character "shi" and operate the conversion key, and the abbreviated conversion dictionary will be searched for words that have "shi" as a headword. , and “shi”
The registered word ``new product'' corresponding to ``new product'' is read out.

However, even with this shortening conversion, the following problems still remain.

That is, if the registered word shown in the above example is registered in the abbreviation conversion dictionary and you want to obtain the phrase "new product development," first enter the kana "shi" to convert it, and then enter the kana "shi". ” and perform the conversion operation. And on the first conversion you get a "new product",
In addition, by obtaining "development" in a later conversion, the series of words "new product development" is obtained for the first time.

As you can understand from this input operation, even in abbreviation conversion for compound words such as ``new product development,'' each independent word is separated into kana characters, and then converted into corresponding kanji in sequence. This input operation is troublesome and the processing time increases accordingly.

<Purpose> The present invention is intended to solve the above-mentioned problems in shortening conversion, and to enable processing by shortening conversion to be performed more efficiently.

That is, in the case of a compound word, the corresponding compound word can be immediately obtained by inputting a plurality of abbreviated kana characters along with delimiter symbols and giving a conversion instruction. Then, at the time of conversion, by referring to the example dictionary, it is determined whether or not the kanji strings can be connected, and the desired conversion result can be immediately obtained without outputting any extra conversion results. be.

For example, in the place to get the phrase "new product development" mentioned above, by inputting "shi", "/", and "ka" and converting it, you can get the series of words "new product development". This is what I did. Note that the "/" indicates a delimiter between abbreviated kana characters.

<Embodiment> FIG. 1 is a block diagram showing an outline of a kana-kanji conversion device according to an embodiment of the present invention. In structure, the kana-kanji conversion device of this embodiment includes a kana keyboard 1, which is an example of a kana character input means.The kana keyboard 1 has kana keys arranged in the order of the 50 syllabary. Key signals input by operating the kana keyboard 1 are given to the encoding circuit 3. Key signals from the function keyboard 2 are further input to the encoding circuit 3 .

This function keyboard 2 includes editing control keys. The editing control keys include a conversion key for instructing conversion of kana characters into kanji or a sentence mixed with kanji, a no-conversion key for instructing that conversion to kanji is not necessary, and a previous candidate key.

The encoding circuit 3 encodes the key signals of the kana keyboard 1 and the function keyboard 2,
Kana character data (kana character code) is temporarily stored in an input buffer 4, and coded signals of each key included in the function keyboard 2 are directly provided to a central processing unit (hereinafter referred to as CPU) 5.

The CPU 5 includes a kana-kanji conversion function, a writing function, and a reading function. A CRT display 6 and a printing device (printer) 7 are connected to the CPU 5.

The CRT display 6 displays kana sentences input in kana, and converted kanji or kanji-mixed sentences (hereinafter collectively referred to as kanji-mixed sentences, etc.).
used to display. The printer 7 is used to print sentences mixed with kana or kanji.

Furthermore, the CPU 5 includes a kana-kanji conversion processing unit 8,
Document buffer 11 and kana-kanji conversion dictionary section 12
is connected. A shortened conversion dictionary memory 13 is connected to the kana-kanji conversion processing section 8 .

The kana-kanji conversion processing section 8 works as a kana-kanji conversion means in cooperation with the CPU 5, and includes various buffer registers.

The document buffer 11 stores, as document data, a sentence mixed with kanji that is input in kana and converted by the kana-kanji conversion processing unit 8.

The kana-kanji conversion dictionary section 12 includes, for example, a read-only memory (ROM), and includes a storage area for storing a word dictionary, a storage area for storing a conjugation ending list,
It also includes a storage area for storing adjunct word tables.
This word dictionary storage area stores kana headers arranged in alphabetical order, kanji notation parts corresponding to the kana headers, part-of-speech data, and the like. In the kanji notation section,
Word stems and unchanged parts are memorized.

As the shortening conversion dictionary memory 13, a RAM or the like including a plurality of storage areas is used. In the abbreviation conversion dictionary memory 13, sentences with kanji mixed in, etc. that have been converted in conversion units (for example, segment units) of input sentences are stored with the first character of the reading kana (i.e., kana input characters) as a kana headword, and can be converted as needed. Accordingly, data on the frequency of use of the sentence (the number of times the same clause unit of kanji-mixed sentences, etc. is used in the sentence) is stored. That is, the shortening conversion dictionary memory includes an area for storing a plurality of shortened kana sentences, and an area for storing kanji-mixed sentences corresponding to the shortened kana sentences corresponding to the storage area for each shortened kana sentence. Contains an area to store the frequency of use for each.

Next, FIG. 2 is a block diagram showing in detail the constituent parts that operate during the abbreviation conversion process in the above-mentioned kana-kanji conversion apparatus.

Reference numeral 20 indicates input means corresponding to the kana keyboard and function keyboard shown in FIG.
It shows.

21 is an input means 20 including the encoding circuit shown in FIG.
This is a key control unit that controls key signals from the

22 corresponds to the CPU in Figure 1,
This is a conversion control unit having a short conversion processing program (a program for performing the operations shown in FIG. 4).

Reference numeral 23 denotes a conversion kana input buffer for holding kana characters inputted from the input means 20, that is, abbreviated kana characters here, and 24 is an abbreviation conversion dictionary memory, which corresponds to the memory 8 in FIG.

25 is a comparator for comparing the kana character data in the conversion kana input buffer 23 with the headword in the abbreviated conversion dictionary memory 24; 26 is a comparator for storing the registered word corresponding to the headword matched by the comparator 25; This is the shortened conversion result buffer.

Reference numeral 27 denotes a usage dictionary memory in which idiomatic expressions such as derived words and compound words are registered in advance, and holds various usage examples such as derived words and phrases of two clauses with strong connections as homophone selection information, for example.

28 is a comparator for comparing the contents of the abbreviated conversion result buffer 26 and the example dictionary memory 27, and 29 is a conversion result buffer that stores valid registered words selected based on the comparison.

Each component that operates during the shortening conversion shown in FIG. 2 operates based on the flowchart shown in FIG. 4, and the shortening conversion processing will be specifically explained below.

A specific example of this shortening conversion process is shown in FIG. 3. In the example shown in FIG. Also, the registered words corresponding to the headword ``ka'' are ``development,''``venue,'' and ``meeting,'' indicating a case in which the desired word is ``new product development.''

Therefore, the key operations at this time include first inputting "shi" using the kana key 20A, then giving delimiter information using the delimiter key 20B, and then inputting "ka" using the kana key 20A.

As a result, "shi/ka" is input into the conversion kana input buffer 23, and the conversion key 20C is operated here.

In response to the conversion instruction, first, the first kana character "shi" delimited by the delimiter information is retrieved, and the abbreviation conversion dictionary memory 24 is searched to see if there is a headword for "shi". If so, the registered word corresponding to this is read out to the abbreviation conversion buffer 26.

In this case, there are registered words "new product" and "new release" for the headword "shi", and these are sent to the buffer 26.

Subsequently, the second kana character "ka" from the kana input buffer 23 is taken out, and all registered words corresponding to the entry word "ka" in the abbreviation conversion dictionary memory 24 are read out to the abbreviation conversion result buffer 26.

This operation is performed for all kana characters input into the kana input buffer 23, and all the corresponding registered words are stored in the abbreviation conversion result buffer 26.

On the other hand, the abbreviation conversion result buffer 26 sets all combinations of registered words corresponding to the headword "shi" and registered words corresponding to the headword "ka", and in this example, "new product" is set to "new product". There are combinations of ``Product Development,'' ``New Product Venue,'' and ``New Product Conference,'' and these combinations are similarly set for ``New Release.''

Then, regarding the combinations of registered words set in the shortening conversion result buffer 26, the example dictionary memory 27 is sequentially referred to to check whether the combinations are possible or not.

In this case, "new product" is stored in the example dictionary memory 27.
Examples have been registered that allow the connection of ``development'' and ``presentation.''

Therefore, the first combination "new product development" is sent from the shortening conversion result buffer 26 by the comparator 28, and this connection relationship is sent to the example dictionary memory 27.
Since this connection is “possible”, the combination of registered words “new product development” is extracted to the conversion result buffer 29.

Further, if the connection relation is determined to be "no" in the example dictionary memory 27 for the first combination, the next combination is taken out from the buffer 26 and checked in the example dictionary memory 27, and this operation is continued in sequence.

Then, for each registered word set in the abbreviation conversion result buffer 26, the connection relationship between them is investigated in the example dictionary memory 27 for all combinations, and all combinations for which the connection is "possible" are identified. The conversion result is taken out to buffer 29 and this operation is completed.

The combinations of registered words taken out into the conversion result buffer 29 as candidates for conversion are called up to the CRT display 6 based on sequential key operations simultaneously with the normal conversion operation to determine the target word.

Therefore, for example, if the sentence ``Results of research on new product development'' has been created in advance, to obtain the kanji string ``Results of new product research'',
You can get it just by typing ``shi'', ``/'', ``chi'', ``/'', ``ke'', and ``conversion''.

<Effects> As described above, in the present invention, in a kana-kanji conversion device having a shortening conversion function, inputting a compound kanji string is easy, and a compound kanji string different from a previously created kanji string can be shortened. It is easy to obtain by using the conversion dictionary memory, and it also selects candidates by checking not only the shortened conversion results one by one, but also the mutual connection relationships, so the conversion rate is high, and input processing can be made more efficient. It has unique characteristics.

[Brief explanation of drawings]

Fig. 1 is a block diagram showing the overall general configuration of the device of the present invention, Fig. 2 is a block diagram specifically showing the components that operate during the shortening conversion process of the same device, and Fig. 3 is a shortening of the same device. FIG. 4 is a block diagram showing a specific example of the operation during the conversion process, and is a flowchart of the short conversion operation of the same apparatus. 1: Kana keyboard, 2: Function keyboard, 5: CPU, 8: Conversion processing unit, 13: Short conversion dictionary memory, 20: Input means, 22: Conversion control unit, 23: Kana input buffer for conversion, 24:
Short conversion dictionary memory, 26: Short conversion result buffer, 27: Example dictionary memory.

Claims (1)

[Scope of Claims] 1. A shortening conversion dictionary memory that stores headings of shortened kana characters obtained by shortening a kana sentence to a certain number from the beginning, and kanji or kanji-mixed sentences for regular kana sentences corresponding to the shortened kana characters. When the abbreviated kana character is input by operating the kana character input means, the kanji or kanji-mixed sentence (registered word) with the input abbreviated kana character as a headword is stored in the abbreviated conversion dictionary memory. A kana-kanji conversion device for reading out a target kanji or a sentence mixed with kanji, comprising: a conversion kana input buffer into which the abbreviated kana characters input by the kana input means are introduced; and a plurality of abbreviated kana characters in the input buffer. control means for controlling reading from the abbreviation conversion dictionary memory of registered words whose headwords are each kana character for each delimiter when inputted by being separated by delimiter information; It is equipped with a shortening conversion result buffer that stores all registered words for each headword, and a usage dictionary memory that stores idiomatic expressions (examples) such as derived words and compound words. For each registered word for each headword, the connection relationship (combination) between the registered words corresponding to the combination of abbreviated kana characters held in the input buffer is referred to in the example dictionary memory, and the registered word that matches the example is searched. A kana-kanji conversion method characterized by outputting a combination of characters.