JPH041848A - Kana/kanji converter - Google Patents

Abstract

PURPOSE:To save the dictionary capacity by providing a conversion means which converts a part or the whole of plural KANJI (Chinese characters) of words into HIRAGANA (cursive forms of Japanese syllabary) based on a table stored in a KANJI/HIRAGANA description storage means and a display means which displays the words converted by the conversion means. CONSTITUTION:When an identification code 102 is added to the word to be read out, a conversion means 107 converts successively the description of the word into plural types of declensional KANA (Japanese syllabary) endings based on a table stored in a declensional KANA ending storage means 103. At the same time, a part or the whole of plural KANJI of the word is converted into the HIRAGANA description based on a table stored in a KANJI/ HIRAGANA description storage means 104. This HIRAGANA description is displayed by a display means 108. Thus the declensional ending of the word is converted based on a table set previously and a part or the whole of KANJI of the word is converted into HIRAGANA. Therefore the conventional correction is not needed for the declensional endings and descriptions. As a result, the dictionary capacity can be saved.

Description

[Detailed Description of the Invention] (a) Industrial Application Field The present invention is mainly used in information processing devices equipped with a kana-kanji conversion dictionary, such as Japanese word processors, to convert input kana character strings into kanji and kanji. This article relates to a kana-kanji conversion device that converts into mixed sentences.

(B) Prior Art In general, there are cases in which a word in Japanese has a plurality of permissible spellings depending on the okuri-gana-no-zuke-ha-kata.

For example, in the case of the word "memoir", there are many words such as "memorandum", "memorandum", "memorandum", "memorandum", etc. Also, regarding the notation, ``Omoekaki'',
There are various expressions such as ``oboegaki'', ``memory writing'', and ``memory writing''.

In conventional kana-kanji conversion devices, in order to input a word with many types of okurikana in the desired okurikana, ■ Register all words with different okurikana in a kana-kanji conversion dictionary, and then input the word with the desired okurikana from there. Select.

■Register only one okurikana notation for one word in the kana-kanji conversion dictionary, and after the kana-kanji conversion, modify the desired okurigana.

■Delete Okrigana using an algorithm. That is, only the notation with all the okigana added is registered in the dictionary, and this is set as the first candidate for conversion, and the okigana are deleted in order from there. For example, like the above-mentioned "Omoekaki", if there are four possible okori kana, "memorandum", "memorandum", "memorandum", and "memo", then the okori kana with the largest number of characters The notation is the first candidate, and the first candidate (memorandum) → the second
Candidate (memorandum or memorandum) - 3rd candidate (memorandum), and the okigana will be automatically deleted.

A method like this is used.

However, as in (2) above, registering all words with different okurikana in the kana-kanji conversion dictionary is limited and results in a decrease in the number of registered words within the f-co dictionary capacity.

Also, as in (■) above, if only one okurikana notation is registered for one word, the okurigana must be corrected (added or deleted) each time the word is read. However, since corrections are made after the conversion is confirmed, there is a problem that the learning function does not work.

Furthermore, as in (■) above, when deleting Okigana using an algorithm, it is difficult to process the notation in the direction of adding Okigana. For example, in the case of ``Omoekaki'', the first candidate is In cases such as "memorandum", there is a problem in that it is difficult to select "memorandum" as the next candidate (additional process for sending kana).

Therefore, in order to solve this problem, the inventors of the present invention memorized the Okurigana patterns as a table separate from the Kana-Kanji conversion dictionary, and changed the Okurigana based on that table. We have applied for a kana-kanji conversion device that eliminates the need for correction operations such as addition and deletion (Japanese Patent Application No. 1-133737).

(c) Problems to be solved by the invention However, in this kana-kanji conversion device, for example, if the word "omekaki" is written as "memorandum", "
Memorandum”, “memorandum”, “memorandum”, “memoir”,
Even if it could be converted into something like ``oboegaki,'' it could not be converted into something like ``memorization'' or ``memorization.'' In other words, for example, if the word is ``ladder ruler'', it is ``shiyukushi ruler'', or if ``narrow down'' is ``shiboromi'' or ``narrow down'', some of the multiple kanji notation can be used. It was not possible to convert it to hiragana notation.

This invention was made in consideration of the above circumstances, and for words that have multiple spellings, the pattern of the letter is stored as a table separate from the kana-kanji conversion dictionary, and the kanji notation is stored as a table. There are multiple
Even for words whose notation is partially changed to hiragana, the kanji/hiragana notation pattern is stored as a table separate from the kana-kanji conversion dictionary, and when those words are read, To provide a kana-kanji conversion device that changes the okurikana and notation based on each table, thereby eliminating the need for the conventional correction operation of okurikana and notation.

(d) Means to solve the problem FIG. 1 is a block diagram showing the configuration of the present invention.

As shown in the figure, the present invention includes a dictionary means 101 that stores a large number of words including kanji along with their pronunciation information, and words having multiple types of okurikana and multiple types of kanji/kanji for the words stored in the dictionary means 101. An identification code 102 attached to a word having a hiragana notation, an okurikana storage means 103 that stores the okurikana pattern of the word with the identification code 102 as a table, and a kanji/kanji of the word with the identification code 102. A kanji/hiragana notation storage means 104 that stores hiragana notation patterns as a table, a reading means 106 that reads words corresponding to reading information inputted from the input means 105 from the dictionary means 101, and a reading means 1.
The identification code 1027 for the word read by 06)
- When the word is attached, the notation of the word is sequentially converted into the plurality of types of okurigana based on the table stored in the okurikana storage means 103, and is stored in the kanji 7/hiragana notation storage 104. A kana-kanji conversion device comprising a conversion means 107 for converting some or all of the plurality of kanji of a word into hiragana based on a table, and a display means i08 for displaying the word converted by the conversion means 107. It is.

Note that the dictionary means 101 in the present invention may be any device that can store a large number of hayashi words including kanji together with their pronunciation information, and an external storage medium such as RO~1 or a floppy disk device or a magnetic disk device may be used. It will be done.

Further, as the identification code 102, various types of codes such as identifiable numbers and symbols are used.

Furthermore, the okurikana storage means 103 and the kanji/hiragana notation memory 1ift 104 can store the okurikana pattern and the kanji/hiragana notation pattern of the word with the identification code 102 as tables, respectively. As with the dictionary means, an external storage medium such as a ROM, a floppy disk device, a magnetic disk device, etc. can be used.

The input means 105 may be any device that can input hiragana character strings as kana and kanji reading information, such as a keyboard, tablet device, OCR, etc.
A magnetic tape device or the like is used.

Further, the reading means 106 may be any device that can read the word corresponding to the pronunciation information inputted from the input means 105 from the dictionary means 101. When an identification code 102 is attached to a word to be written, the notation of the word is sequentially converted into multiple types of okurigana based on the table stored in the okurikana storage means 103, and then the kanji/hiragana notation is stored. Any device may be used as long as it can convert some or all of the plurality of kanji of the word into hiragana based on the table stored in the means 104, and the reading means 106 and the converting means 107 are generally
It is convenient to use a microprocessor.

The display means 108 may be any device as long as it can display the words converted by the conversion means +07, such as a printer, display device, magnetic tape device, magnetic disk device, etc., but can quickly confirm the processing contents. As a device, it is preferable to use a display device.

(e) Effect As shown in FIG. 1, according to the present invention, the input means 10
When the reading information is input from 5, the word corresponding to the reading information is read out from the dictionary means 101 by the reading means 106.

At this time, if an identification code 102 is attached to the read word, the conversion means 107 converts the word's notation into multiple types of okigana based on the table stored in the okigana storage means 103. At the same time, some or all of the plurality of kanji of the word are converted into hiragana based on the table stored in the kanji/hiragana notation storage means 104, which is displayed in the display means 108. displayed by.

Therefore, after the kanji of the word is converted into hiragana based on the 1-ni table set in advance, some or all of the kanji in the word are converted into hiragana, so there is no need for the conventional correction of okurikana and notation. As a result, words with different kana and writing patterns only need to be registered in one word, which saves dictionary space.

(f) Examples Hereinafter, the present invention will be described in detail based on examples shown in the drawings. Note that this invention is not limited to this.

FIG. 2 is a block diagram showing an embodiment of the present invention.

In this diagram, l short keys, function keys,
The keyboard is also equipped with a kana-kanji conversion key for instructing kana-kanji conversion or an execution key for confirming input contents, and the reading information of words in kana is transferred to the control unit 2.
Enter.

The control unit 2 is composed of a microprocessor, and performs various data processing described below in accordance with a control program written in a program memory 3 consisting of a ROM.

Reference numeral 4 denotes an input buffer for storing word reading information inputted from the keyboard 1 in Otsukana.

5 is a kana-kanji conversion dictionary consisting of ROM, which includes an independent word dictionary 6 that stores many words including kanji along with their pronunciation information, a part-of-speech table 7 that stores part-of-speech information, an okurigana table 8 that stores okigana information, and an okurikana table 8 that stores okigana information. It has a kanji/hiragana notation table 9 that stores information for writing kanji in hiragana.

Among the words stored in the Independent Word Dictionary-6, there are words that have multiple types of Okurigana (hereinafter referred to as words with fluctuations in Okurigana), and words that have multiple types of Kanji/Hiragana notation (hereinafter, words that have multiple types of Kanji/Hiragana notation). Words with fluctuations (words with fluctuations) are assigned writing pattern numbers as described below.

In addition, the okurikana table 8 stores okurikana patterns for words with orthographic pattern numbers in the independent word dictionary 6, and the kanji/hirakana notation table 9 stores the okurikana patterns with the orthographic pattern numbers. Is it a kanji/hiragana writing pattern for converting some or all of the multiple kanji for the word marked with into plain writing?
It is stored in S2 as a table.

IO is a display device such as a CRT display, LC (liquid crystal) display, or EL display.

The control unit 2 stores the pronunciation information of the word input from the keyboard l, that is, the kana character string, in the input buffer 4, and when the kana-kanji conversion is instructed for the kana character string, the control unit 2 stores the reading information of the word input from the keyboard l, that is, the kana character string, and when the kana-kanji conversion is instructed for the kana character string, The word to be read is read from the independent word dictionary 6.

When a notation pattern number is attached to the read word, the notation of the word is changed to multiple types of okurigana based on the okurikana pattern located at the pointer indicated by the notation pattern number in the okurikana table 8. In addition to sequentially converting to kanji/hiragana notation table 9
Based on the notation pattern located at the pointer indicated by the kanji/hiragana notation number, part or all of the kanji of the word is converted into hiragana notation, and this is displayed on the display device 9.

FIG. 3 is an explanatory diagram showing the storage format of the independent word dictionary 6.

As shown in the figure, in the independent dictionary 6, one word, the length 10, the heavy? II L reading! 2. Part of speech number 13
, notation 14 are provided, and an item with notation pattern number 15 is provided only for words with irregular kana or notation.

Word length 10 contains - record length for the word, weight * 11
contains information that only the changed parts of the same notation are memorized to avoid memorizing duplicate parts of words, and yomi-12 stores the hiragana notation as a heading. .

In addition, the part of speech number 13 is where information on parts of speech such as nouns and verbs is stored, but the part of speech information for each word is separately stored in the part of speech table 7.
A pointer (numerical value) indicating the record number in the part-of-speech table 7 in which the part-of-speech information of the word is stored.

The notation 14 stores the notation of a word including kanji.

These word lengths of 10, double readings of 12, part of speech numbers of 13, and notations of 14 are based on the structure of a conventionally known independent word dictionary.

The notation pattern number 15 contains a pointer (numerical value) indicating in which record in the okigana table 8 the okigana pattern and the genitive/hiragana notation pattern of the word are stored, similar to the above-mentioned part of speech table 7. ) is memorized.

Whether or not notation pattern number 15 is added to a word is determined based on whether part-of-speech number X3 exceeds a certain value. In other words, by registering the part-of-speech information for words with fluctuations in kana and orthography in the latter half of the part-of-speech table 7, and checking the part-of-speech number 13, it is possible to determine whether orthographic pattern number 15 has been added to the word. This makes it possible to judge.

FIG. 4 is an explanatory diagram showing the storage format of the okugana table 8.

As shown in the figure, in the okurigana table 8, the okurikana pattern and the kanji/hiragana notation pattern are focused patterns in the order of the notation pattern number, the first candidate, the second candidate, the third candidate, etc. , etc. are stored sequentially.

For example, if the notation pattern number is n, the first candidate (00
010000), second candidate (01010000), third candidate
Candidate (00000000).

The contents of the okurikana table 8 correspond to the kanji notation in 1-byte units for the okurikana pattern part. For example, in the case of the word ``Omoekaki'', which has a kana pattern with notation pattern number n in Figure 4, the reading character data is (Kaku = 2) (E = 1) (Ki = 1) (Ki = 1). =1)=2zt, so l bits are allocated from the beginning to each of these four-digit representations, as shown in FIG.

Then, as shown in Fig. 6, the bit is “l” (on).
Delete the notation that is .

In the second processing method, if you store the pattern of the selected word in the learning buffer, from the second time onwards, you will be able to obtain the desired word with one conversion. You can get the notation.

In this way, FIG. 4 shows a table in which the okurikana pattern and the kanji/hiragana notation pattern are made into a table as 1-byte bit pattern information.

FIG. 7 is an explanatory diagram showing the contents of the feed speed table 8 shown in FIG. 4.

As shown in the figure, in the case of the above-mentioned "memorization" example, which has the notation pattern number n in Figure 4, the first candidate (memorandum) → the second candidate (memorandum) - the second candidate (memorandum) - 3
Candidates (memorandum) - 4th candidate (memorandum) - 5th candidate (remembering) - 6th candidate (opoe gaki) are converted in order.

In this way, for the bit pattern of the okugana, for example, in the case of "remembering", the first 4 bits are humanized and registered with the information "l (on)" and "0 (off)". Then, "Ohoekaki" is entered,
When converting it to kana-kanji, the bit pattern of the okurikana corresponding to the reading data of the first four characters is “
Delete the character "l (on)".

Among these conversions, for the fifth and sixth candidates, the first character of the word is usually not deleted, so
Using this, if the first word is "1 (on)", that is, the deletion bit, all the pronunciations of that word can be changed to the plain form.
Or write it in katakana.

Then, for the seventh and subsequent candidates, the first bit is “l(
If the first hit is "l (on)", there are 6 bits that can be expressed in other than hiragana or katakana, as shown by the cross in the figure. And, if any one of the 6 bits from the 2nd bit to the 7th bit is "1 (on)", it is regarded as a kanji/hiragana notation number, and the kanji shown in Figure 8 is /Refer to Hiragana notation table 9.

That is, the Kanji/Hiragana notation number serves as a pointer to the Kanji/Hiragana notation table 9, and the Kanji/Hiragana notation table 9 is referred to by this pointer.

The Kanji/Hiragana notation table 9 is stored in the format of 8 hint patterns in the order of Kanji/Hiragana notation numbers. That is, for example, in the case of the word ``Shiborikomu Σ'', it is registered in the independent word dictionary 6 with the notation pattern ``Narrow down'', and its reading character data is (Shibori-2) (S = l) (Include = 1) (mu=l)=2111
It is.

Note that when only the stem of a word is registered, there may be no information on the final "mu".

Therefore, when this character string "Shiborikomu" is converted into kana-kanji, the okurikana table 8 shown in FIG. 9 is searched from the notation pattern number 15 added to the word in the independent word dictionary 6, The first and second candidates are converted into kana-kanji in order, and when it comes to the fourth candidate, the bit pattern of the fourth candidate is converted back into a binary number with the first 1 bit and last 1 bit removed. , a kanji/hiragana notation table 9 as shown in FIG. 10 is referred to. Here, the fourth candidate Kanji/Hiragana notation number in the Okurigana table 8 is number 1 in binary code, and the first notation pattern in the Kanji/Hiragana notation table 9 in Figure 1O is “
toooooo''T-, the first kanji in the kanji notation is changed to hiragana notation.In other words, depending on the reading character data, the readings of the first kanji are the first and second reading characters. Therefore, it is changed to ``shibo'' or ``shibo,'' and is converted into the notation ``shiboromi,'' as shown in Figure 1θ.

Similarly, for the fifth candidate, the kanji/hiragana notation number of the fifth candidate is number 2 in binary code, and the second notation pattern in the kanji/hiragana notation table 9 is “0010”.
0000'', so ``inc'' is changed to ``ko'', and ``
It is converted into the notation "Narrow down".

As a result, for example, in the case of the word "Shiyakushi Shogi", the reading character data is (Ladle - 3) (Chi -
1) (Condition = 3) (Convention - 1) - 3131 times, so the first
If you set the kanji/hiragana notation number so that it corresponds to the nth notation pattern of the kanji/hiragana notation table 9 shown in Figure O, you can convert it to the notation ``1 square ruler''. .

If the number of types of Okrigana and Kanji/Hiragana notation patterns is within 255, the notation pattern number will be 1 byte of information, the pit pattern information will be a fixed length, and the number of Okugana and Kanji/Hiragana notation patterns will be If the number of types is 256 or more, the notation pattern number becomes 2-byte address information, and the hit pattern information becomes variable-length data that is an integral multiple of 1 byte.

Also, the 1-byte information of the pit pattern shown in Figure 7 is just an example, and for example, in the case of "Memorandum",
For the first 4 bits, "1 (on)" and "0 (off)" may be reversed, and the example in this case is shown in the first section.
Figure 1.

Next, the contents of the processing operation of the control unit 2 are shown in FIGS. 12 and 13.
This will be explained according to the flowchart shown in the figure.

FIG. 12 is a flowchart showing the processing contents when kana-kanji conversion is performed.

When performing kana-kanji conversion, first press the keyboard
A character string is input from (step 201), and after that character string is stored in the input buffer 4, when kana-kanji conversion is instructed (step 202), the control unit 2 determines whether or not there are homophones. (step 203)
If there are homophones, candidates for the homophones are extracted and displayed on the display device 9 (step 204), and their selection is performed (step 205).

Next, the part of speech number 13 of the independent word dictionary 6 is searched to determine whether there is any fluctuation in the okurigana or notation (step 206), and if there is any fluctuation in the okurigana or notation, the fluctuation in the okurigana or notation is determined. They are extracted and displayed on the display device 9 (step 207), and their selection is made (step 208).

And if the string is re-entered manually, step 20
1, and if no character string is input, the kana-kanji conversion process ends (step 2o9).

FIG. 13 is a detailed flowchart in the case shown in FIG. 12, in which f koji kana and notation fluctuations are extracted.

When okurikana and orthographic fluctuations are extracted, first, it is determined whether or not a notation pattern number is added in the independent word dictionary iF6 (step 301), and if a notation pattern number is added, , the okurigana table 8 is referred to based on the notation pattern number (step 302) It is determined whether the pit pattern of the okurigana notation, which is the Ll byte information, is a kanji/hiragana notation number (step 303), and the fi character/ If the number is not written in hiragana, information on the corresponding hiragana pattern is searched from the hiragana table 8 (step 304).
).

And the okurigana pattern corresponds to the kanji notation! Based on the byte information, an okurigana is created and output (step 305).

In addition, if it is a kanji/hiragana notation number, the corresponding notation pattern information is searched from the kanji/hiragana notation table 9 (step 306), and the kanji/hiragana/hiragana notation number is searched from the notation pattern information and reading character data. A hiragana notation pattern is created and output (step 307).

In this way, only for the words for which the orthographic pattern number has been added to the independent word dictionary 6, the okrigana pattern and the kanji/hiragana notation pattern are registered in advance in the okurikana table 8 and the kanji/hiragana notation table 9, respectively. By converting the kana and notation of words based on these tables, words can be written in the desired form with a simple conversion operation without increasing the number of words registered in the independent word dictionary 6. becomes possible.

(G) Effects of the Invention According to this invention, for words having multiple types of patterns in okurikana and notation, the patterns are stored as a table separate from the dictionary means, and when the word is read out, the patterns are stored as a table. Based on the table, the notation of the word is converted into multiple types of patterns1.Now,
In addition to eliminating the need for adding or deleting Okokana or modifying notation such as converting kanji to hiragana, it is also possible to register words with multiple types of notation patterns with just one word, making it easier to use dictionaries. Capacity can be saved.

In addition, for Okigana, the candidate order of the notation is, for example, in the case of "memorizing", 1st candidate (memorandum) - 2nd candidate (memorandum) - 3rd candidate (memorandum) - 4th candidate.
Since it can be set arbitrarily like a candidate (memorandum), it is not only possible to delete okurigana like the conventional algorithm, but also to add and delete okurigana for each word. It becomes possible.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing the configuration of the present invention, Fig. 2 is a block diagram showing an embodiment of the invention, Fig. 3 is an explanatory diagram showing the storage format of an independent word dictionary, and Fig. 4 is a forwarding table. FIG. 5 is an explanatory diagram showing an example of bit assignment, FIG. 6 is an explanatory diagram showing an example of deleting bits of the forwarding speed, and FIG. 7 is an explanation showing the contents of the forwarding speed table. Figure 8 is an explanatory diagram showing the storage format of the Kanji/Hiragana notation table, Figure 9 is an explanatory diagram showing another example of the content of the Okigana table, and Figure 1O is the specific example of the Kanji/Hiragana notation table. Explanatory diagram showing an example, i-th
Figure 1 is a diagram equivalent to Figure 7 showing the case where the bit pattern is reversed;
FIGS. 12 and 13 are flowcharts showing the operation of the embodiment. l...keyboard, 2...control unit, 3...program memory, 4...input buffer, 5...kana-kanji conversion dictionary, 6...independent word dictionary, 7...part of speech table,
8...Origana table, 9...Kanji/Hiragana notation table, lO...Display device. :is 1 Figure 2 [/l Figure 1641ri 1 Figure +1 Figure TA) Figure 13

Claims (1)

[Claims] 1. Dictionary means that stores a large number of words including kanji along with their pronunciation information, and words that have multiple types of okurigana and multiple types of kanji/hiragana for the words stored in the dictionary. an okurikana storage means that stores the okurikana patterns of the words with the identification codes as a table; and a kanji/hiragana storage means that stores the kanji/hiragana writing patterns of the words with the identification codes as a table. reading means for reading a word corresponding to the reading information inputted from the input means from the dictionary means; and when the identification code is attached to the word read by the reading means, it is stored in the digit storage means. The notation of the word is sequentially converted into the plurality of types of okurikana notation based on the table stored in the kanji/hiragana notation storage means, and some of the kanji of the word are converted based on the table stored in the kanji/hiragana notation storage means. Or a kana-kanji conversion device comprising a conversion means for converting all words into hiragana notation, and a display means for displaying the words converted by the conversion means.