JP2744241B2 - Character processor - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a character processing device for creating a Japanese document by inputting a kana and converting it to kanji, in particular, by inputting a reading of a name (person name). The present invention relates to a character processing device that converts characters into kanji.

2. Description of the Related Art Conventionally, as an apparatus for converting a name reading into a kanji and inputting it, there is a device which has a dictionary in which the name reading is stored in association with a notation and converts the kana to kanji. For example, the names "Jiro" and "Junpei" are "Jiro" respectively.
This is a device that registers in a dictionary based on the reading of “junpui” and converts kana to kanji.

[Problems to be Solved by the Invention] However, since the names can be freely assigned and the variations are abundant, in the above-described conventional technique of storing each name as a word, the storage capacity required for the dictionary is enormous. . However, since the pronunciation and kanji used for one name have a common part with a plurality of other names, in the above-described conventional technology, the storage contents of the dictionary are often duplicated, and the memory use efficiency is poor. Also, in the above-described conventional technology, for a name that has not been hitherto, even if each part of the name is common to the existing name, it is not registered in the dictionary as a whole. Could not.

[Means for Solving the Problems] In order to solve the above problems, in the present invention, the character processing device includes a reading element that is a component that is less than the word of the reading of the name, a type of the reading element, A reading element dictionary that stores the notation of the reading elements in association with each other, a connection rule dictionary that stores connection rules between the reading element types, input means for inputting a name reading, and a name input from the input means. Reading means for decomposing the reading into a plurality of reading elements with reference to the reading element dictionary, and whether the plurality of reading elements decomposed by the decomposing means can be combined is stored in the reading element dictionary. Based on the types of the plurality of reading elements, a combination determining unit that determines by referring to the combination rule dictionary, and each of the plurality of reading elements that are determined to be connectable by the combination determining unit, in the reading element dictionary. Associated Conversion means for converting into notation.

[Operation] With the above configuration, the decomposing means decomposes the reading of the name input from the input means into a plurality of reading elements with reference to the reading element dictionary. Based on the types of the plurality of reading elements stored in the reading element dictionary, the connection determination unit determines whether or not the plurality of decomposed reading elements can be combined with each other by referring to the combination rule dictionary. The conversion unit converts each of the plurality of reading elements determined to be connectable into a notation associated with the reading element dictionary.

EXAMPLES Hereinafter, the present invention will be described in detail with reference to the drawings.

 FIG. 1 shows an example of the overall configuration of the present invention.

In the configuration shown in the figure, the CPU is a microprocessor, performs calculations for character processing, performs logical decisions, etc., and is connected to those buses via an address bus AB, a control bus CB, and a data bus DB. Control the components.

The address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU.
The control bus CB transfers and applies a control signal of each component to be controlled by the microprocessor CPU. The data bus DB transfers data between the components.

Next, the ROM is a fixed read-only memory.
The control procedure and the like by the microprocessor CPU, which will be described later with reference to FIGS.

The RAM is a writable random access memory having a structure of 16 bits per word, and is used for temporarily storing various data from each component.

EDIC is a reading element dictionary, and stores a reading element of a name in association with a reading element type and a reading element notation.

RDIC is a binding rule dictionary that stores the binding rules between each reading element.

Y1TBL is a first reading table. The candidate of the first reading element of the name is stored.

Y2TBL is a second reading table. The candidate of the second reading element of the name is stored.

CTBL is a combination table. A candidate for a combination of the first reading element candidate and the second reading element candidate is stored.

HTBL is a conversion candidate table. The candidates output as a result of the kana-kanji conversion are stored.

TBUF is a text buffer and is an area for temporarily storing document data being edited.

KB is a keyboard. Alphabet key, hiragana key, katakana key and other character symbol input keys, and
Various function keys for instructing various functions to the character processing apparatus such as a conversion key are provided.

DISK is an external storage for storing document data and dictionary data, and stores created documents. The stored documents are called up when necessary according to keyboard instructions. The dictionary data is loaded into the area DIC on the RAM at an appropriate timing, and is referred to.

CR is a cursor register. The CPU can read and write the contents of the cursor register. A CRT controller CRTC described later displays a cursor at a position on the display device CRT corresponding to the address stored here.

DBUF is a display buffer memory for storing patterns of data to be displayed.

The CRTC plays a role of displaying the contents stored in the cursor register CR and the buffer DBUF on the display CRT.

The CRT is a display device using a cathode ray tube or the like, and the display pattern of the dot configuration and the display of the cursor on the display device CRT are controlled by a CRT controller. Further, CG is a character generator, and the display device CR
This stores the pattern of characters and symbols displayed on T.

The character processing device of the present invention comprising such components operates in response to various inputs from the keyboard KB. When an input from the keyboard KB is supplied, first, an interrupt signal is generated by the microprocessor. CPU
The microprocessor CPU reads various control signals stored in the ROM, and performs various controls in accordance with the control signals.

 FIG. 2 is a diagram for explaining the principle of the present invention.

(A) is a sample of the reading element dictionary. For example,
The reading "Jun" has the notation of "pure""order",
The reading element type is 1.

(B) is a sample connection rule. The fact that the first reading element is “3” and the second reading element is “4” means that the type 3 and type 4 reading elements can be combined, and specifically, This means that the names "Jiro" and "Jiro" are possible. Here, the combination of the reading elements of the unregistered type cannot be a name. For example, “Jihei” is not converted as a name because “3-5” is not registered in the combination rule.

FIG. 3 is a diagram showing a configuration of a reading element dictionary (EDIC).

 Each reading element is composed of 8 bytes.

The first four bytes are reading. Yomi is stored in one byte per character. For hiragana, use the lower byte of the JIS X 0208 code and use 20H for the space. Extra space is left in the space.

The next two bytes are a reading element notation. Notation is JIS X 08
Stored in 2 bytes per character using 08 code.

 The next byte is the reading element type.

The last byte is the frequency. Expresses whether it is often used as part of a name. Takes a value from 0 to 255,
The larger the value, the higher the frequency.

 FIG. 4 is a diagram showing a configuration of the combination rule dictionary.

One combination column is composed of 3 bytes, and corresponds to the combination of two reading elements.

 The first byte indicates the type of the first reading element.

 The next byte indicates the type of the second reading element.

The last one byte indicates the likelihood (likelihood) of the combined sequence. It takes a value from 0 to 255, and the larger the value, the more likely the combination is.

FIG. 5 is a diagram showing the configuration of an input buffer (IBUF).

All pseudonyms entered from the keyboard are temporarily stored in IBUF. After that, it is converted and output on a document. IB
Characters on the UF are described in JIS X 0208 code and are composed of 2 bytes per character. OFF H is filled after the last character.

FIG. 6 is a diagram showing the configuration of the first reading table (Y1TBL) and the second reading table (Y2TBL).

Y1TBL is a table that stores candidates for the first reading element (first reading element) obtained by searching the reading element dictionary obtained by decomposing the input reading string.

Y2TBL is a table storing second reading element (second reading element) candidates obtained by searching a reading element dictionary obtained by decomposing an input reading string, and has the same configuration as Y1TBL.

 One reading element candidate is composed of 4 bytes.

The first byte indicates a reading start position. Describe the character of the input buffer where the starting point of the reading element is.
For example, when the input is “juni”, the starting point of the reading element “pi” is four characters from the beginning, so “4” is stored as the reading start position.

The next byte indicates the number of readings, and stores the number of readings of the reading element. For example, the reading element “ぺ” stores the number of readings “2”.

The last two bytes are the reading element dictionary (EDIC) of the reading element.
Store the address up.

 FIG. 7 is a diagram showing the configuration of the combination table.

6 is a table that stores a combined sequence indicating how to decompose an input read sequence and combine read elements.

Those registered here must meet the binding rules.

 Each connection string is composed of 5 bytes.

The first two bytes represent a first reading element and store an address on the EDIC.

The next two bytes represent the second reading element and store the address on the EDIC.

 The last one byte indicates the likelihood of the combination.

FIG. 8 is a diagram showing a configuration of a conversion candidate table (HTBL) that stores conversion result candidates obtained as a result of kana-kanji conversion.

The number of candidates is stored in the first byte, and thereafter each candidate is stored by the number of candidates.

 Each candidate is configured as follows.

 The first byte indicates the number of characters of the candidate.

 The next byte stores the likelihood of the candidate.

After that, the constituent characters of the candidate are put in order with 2 bytes per character. The codes are stored as JIS X 0208 codes.

 The operation of the above embodiment will be described according to a flow.

FIG. 9 is a flowchart of a part for taking in key input and performing processing.

Step 9-1 is a process for taking data from the keyboard into the input buffer IBUF. If the data of the conversion key is included in the IBUF, the kana-kanji conversion must be performed, and the process proceeds to step 9-2. Otherwise, normal editing processing is performed, so that the procedure proceeds to step 9-4.

In step 9-2, as described in detail in FIG.
Convert the above input string to kanji and output it on the text buffer TBUF.

In step 9-3, the conversion result output on the text is displayed.

Step 9-4 is for performing well-known processing such as cursor movement, character input, document storage, etc. in a normal character processing apparatus, and a description thereof will be omitted.

FIG. 10 shows the details of the kana-kanji conversion process in step 9-2.

In step 10-1, ordinary kana-kanji conversion is performed, and conversion candidates are output to a conversion candidate table HTBL.

In step 10-2, the name conversion described in detail in FIG. 11 is performed.
Output to HTBL to be merged with the previous kana-kanji conversion result.

In step 10-3, the conversion candidates output on the conversion candidate table are sorted in the order of likelihood. (The one with the higher likelihood is the higher order.) At step 10-4, the candidates on the conversion candidate table are output on the document TBUF. Normally, only the first candidate is displayed in the conversion result output on the document, and the second candidate and the like are displayed by performing a special operation such as the next candidate. It is not described here because it is postfixed by a word processor or the like.

FIG. 11 shows the name conversion process of step 10-2 in more detail.

At step 11-1, any combination of read elements on the input IBUF provided is restored on the combination table CTBL as described in detail in FIG.

Step 11-2 develops the combination of the reading elements created on the CTBL into a notation and outputs it to the conversion candidate table HTBL.
When outputting, the likelihood on the CTBL is also registered in the HTBL.

FIG. 12 shows the combination creating process of step 11-1 in more detail.

Step 12-1 is a process for searching and examining all candidates for the first reading element on the input buffer IBUF. For example, for the input "Junpui", "Ji" and "Ju"
Searches the reading element element dictionary EDIC for the presence of the reading elements of "Jan", "Junpo", and "Jumpei". As a result of the search, the existing candidates are registered in the first reading table Y1TBL. For example, in the case of “juni”, only “jun” is registered in Y1TBL.

In step 12-2, the first reading element counter i is incremented by one.
Initialize to i is a variable for managing the number of the reading element on the first reading table that is currently being processed.

In step 12-3, the ith reading element from Y1TBL is GET as the first reading element. That is, information such as an address, a reading element type, and a frequency on the reading element dictionary is extracted.

At step 12-4, it is determined whether or not the GET has been normally completed, and if not, the process returns. If GET is successful, proceed to step 12-5.

In step 12-5, a search is made for a candidate for a reading element following the first reading element currently being processed. For example, for the input “junpui”, the first reading element is “jun”
Is currently being processed, a search is made in the reading element dictionary EDIC to determine whether there are reading elements "ぺ" and "ぺ". As a result of the search, the existing candidates are registered in the second reading table Y2TBL. For example, in the case of "juni", only "pi"
Registered in Y2TBL.

In step 12-6, the second reading element counter j is set to 1
Initialize to j is a variable for managing the number of the reading element on the second reading table that is currently being processed.

In step 12-7, the j-th read element from Y2TBL is GET as the second read element. That is, information such as an address, a reading element type, and a frequency on the reading element dictionary is extracted.

At step 12-8, it is determined whether or not the GET has been normally completed. If not, the process branches to step 12-13. If GET has been made, proceed to step 12-9.

In step 12-9, it is determined by searching the combination rule dictionary whether the combination of the first reading element and the second reading element that have been GET is recognized. As a result of the search, if a decision is made, likelihood information is extracted.

In step 12-10, it is determined whether or not a connection is found. If the connection is found, the process proceeds to step 12-11. If not, the process skips to step 12-12.

In step 12-11, the combination for which the connection has been recognized is registered in the combination table CTBL. At the time of registration, the likelihood of the combination is calculated using a certain function based on the frequency of the first reading element, the frequency of the second reading element, and the likelihood of the combination. An example of the function is a simple addition of “frequency of first reading element + frequency of second reading element + likelihood of combination”.

In step 12-12, 1 is added to the value of j to retrieve the next second reading element, and the process loops to step 12-7.

In step 12-13, 1 is added to the value of i to retrieve the next first reading element, and the process loops to step 12-3.

[Other Embodiments] In the above description, the combination of reading elements is limited to two, but the number of elements can be easily expanded. For example, "Daigoro", "Yujiro", etc. can be divided into three elements of "Daiga", "Go" [Roro], and "Yu", "Next", "Roro". In order to realize the connection up to n elements in this way, in addition to the first reading table and the second reading table,
The reading table may be expanded, and the size per combination of the combination table may be further expanded to store up to the n-th reading element, and the reading element type may be newly provided as needed.

Further, although one reading element constitutes a table so as to represent one kanji, it is easy to constitute so as to represent a plurality of kanji. For example, it is better to think that “Yuri” represents “Yuri” in “Yuri” than to be divided into “Hyuri (Yuri)” and “Yuri”. This can be expressed simply by expanding the notation column of the reading element dictionary.

Also, the case where the name is converted by phrase conversion was explained,
By regarding the synthesized name as one phrase, the batch conversion can be realized by a method such as the longest match method, the two-segment longest match method, or the minimum number of phrases method.

[Effects of the Invention] As described above, according to the present invention, the type and notation of a reading element are stored in association with the reading element that is a constituent element of less than the word of the reading of the name, and the Since the names are stored by storing the association rules, the efficiency of use of the memory is high and a large number of names can be stored with a small storage capacity. In addition, there is an effect that even a name that has not existed so far can be converted from reading to notation if it is a combination of an existing name and a common component.

[Brief description of the drawings]

FIG. 1 is a block diagram of the overall configuration of the present invention. FIG. 2 is a diagram illustrating the principle of the present invention. FIG. 3 is a diagram illustrating a configuration of a reading element dictionary. FIG. 4 is a diagram illustrating a configuration of a combination rule dictionary. FIG. 5 shows the configuration of the input buffer. FIG. 6 shows the configuration of the first reading table and the second reading table. FIG. 7 shows the configuration of the combination table. FIG. 8 shows the configuration of the conversion candidate table. FIG. 9 to FIG. 12 are flow charts showing the operation of the character processing apparatus of the present invention. DISK External memory CPU Microprocessor ROM Read-only memory RAM Random access memory EDIC Read element dictionary RDIC Connection rule dictionary IBUF Input buffer Y1TBL First read table Y2TBL Second reading table CTBL …… Combination table HTBL …… Conversion candidate table TBUF …… Text buffer

Claims (1)

(57) [Claims] 1. A reading element dictionary storing a reading element which is a constituent element less than a word of a reading of a name, a type of the reading element, and a notation of the reading element, and a connection between the reading element types. A combination rule dictionary storing rules, input means for inputting a name reading, decomposition means for decomposing the name reading input from the input means into a plurality of reading elements with reference to the reading element dictionary, A connection determination for judging whether or not a plurality of reading elements decomposed by the decomposing means can be connected by referring to the connection rule dictionary based on the types of the plurality of reading elements stored in the reading element dictionary. And a conversion unit for converting each of the plurality of reading elements determined to be connectable by the connection determination unit into a notation associated with the reading element dictionary.