JPS62266665A - Kana/kanji converting device - Google Patents

Abstract

PURPOSE:To shorten the time for searching a next record when the reading is different from that of conversion object, by adding the reading and record length information to the reference record of a KANA (Japanese syllabary)/ KANJI (Chinese character) conversion. CONSTITUTION:A dictionary memory 14 is composed of respective blocks B1-Bn and respective blocks B1-Bn are composed of plural records R1-Rm. In the head of respective records R1-Rn, record length information (a), reading information (b) and candidate KANJI (Chinese character) notation (c) showing the length of a record R are contained. The dictionary memory 14 has a heading table 25, and out of the record R stored in respective blocks B, the same reading information (b) as the reading information (b) of the record R1 of the head of a said block B and the reading information (b) are stored, The address point A of the block B is stored. Consequently, the reading of the converting object and the reading of the record R1 are compared, and when they are different, a next record R2 can be retrieved by adding the record length information (a) to an address pointer.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a kana-kanji conversion device used in a Japanese word processor.

(Prior art) In the dictionary memory of the conventional kana-kanji conversion device, in order to obtain the kanji representation of the entered reading, it is necessary to select which characters in the dictionary memory main body correspond to the first few characters of the reading of the reading. An address table is provided for searching to see if there is data for that reading at a position, and by having this address table from the beginning of the reading to the small characters or minutes, the dictionary memory search is made faster.

Regarding the search in the memory main body, reading information and kanji notation information were stored in the memory main body as codes each having characteristics, and the dictionary memory was searched one byte at a time.

(Problems to be Solved by the Invention) As described above, in the past, the main body of the dictionary memory was searched one byte at a time, so there was a problem in that it took a long time to search for the kanji notation for the reading.

(Objective) In order to solve the above-mentioned problems, it is an object of the present invention to provide a Kana-Kanji conversion device that can quickly search for Kanji notation corresponding to the reading.

(Means for solving the problem) The kana-kanji conversion device of the present invention converts one record into one reading, one or more kanji notations for that reading, and the corresponding record added at a predetermined position of the record. When searching for the kanji notation corresponding to the kana character string to be converted in the dictionary storage means, which stores a plurality of records consecutively, Select one record as a reference record, compare the reading of that record with the kana character string to be converted, and if the two match, select the kanji notation in that record, and if they do not match, select the kanji notation in that record. and search means for selecting the next record as a reference record based on the length information.

(Operation) When searching for the kanji notation corresponding to the kana character string to be converted in the storage means, the search means selects one record as a reference record, and uses the reading of that record and the kana character string to be converted. If they match, the Kanji notation in that record is selected, and if they do not match, the next record is selected as the reference record based on the record length information.

(Embodiment) An embodiment in which the present invention is embodied in a kana-kanji conversion device for a Japanese word processor will be described below with reference to FIGS. 1 to 6.

In FIG. 2, a keyboard 3 as an input means is provided on the front side of a main body case 2 of a word processor 1.
A printer 4 is provided on the rear side. keyboard 3
is provided with a liquid crystal display 5 having multiple lines each containing 40 digits. Various operation keys are arranged on the keyboard 3, including a character key 6 for inputting hiragana and alphabet letters and numbers, a conversion key 7, an execution key 8, a next candidate key 10, and a display on the liquid crystal display 5. Various keys such as a cursor movement key 11 for moving a cursor are provided.

Conversion key 7 is the key operated when converting kana to kanji.
An execution command signal is output to CPtJ12, which will be described later. The execution key 8 is used to convert a candidate character string selected by kana-kanji conversion into a final character string. The next candidate key 10 is used when a candidate character string is displayed on the liquid crystal display 5 and when it is desired to select and display a candidate character string other than the displayed candidate character string.

Next, the electrical configuration of this word processor 1 will be explained with reference to the electrical block circuit diagram shown in FIG.

A central processing unit (hereinafter referred to as CPU) 12 as a search means built into the main body case 2 includes a read-only memory (
(hereinafter referred to as ROM) 13, a dictionary memory 14 as a dictionary storage means, and a readable and rewritable memory (RAM)
A working memory 15 as a storage means consisting of the following is connected. The working memory 15 includes an input buffer section 16 for temporarily storing character code data inputted using the character keys 6, a candidate character buffer section 17 for temporarily storing candidate character strings, and the like. The CPU 12 is connected to the keyboard 3 via a keyboard driver 18 and to the liquid crystal display 5 via a display controller 19. Further, the CPU 12 is connected to the printer 4 via a print driver 20, and is also connected to various memories such as a code table 21.

The ROM 13 includes a program memory 23 which stores various control programs such as a Japanese word processor control program, a keyboard control program, a printer control program, a liquid crystal display control program, etc. for operating the word processor 1 in various ways, as well as character data. It has a generator 24. The character generator 24 stores character pattern data such as characters and symbols printed in a dot matrix for each typeface. The code table 21 stores character codes corresponding to characters and symbols.

As shown in FIG. 3, the dictionary memory 14 stores a plurality of blocks 81 to Bn, each block 81 to B+1.
is composed of a plurality of records R1 to R111. As shown in Fig. 4, at the beginning of one record R, record length information a indicating the length of the record R and reading information S are stored. Alternatively, candidate kanji notations C for a plurality of words are stored.

In front of each kanji notation C, part-of-speech information d corresponding to the kanji notation C is stored. The part-of-speech information C is information that is given the property of grammatical connection and is used to determine whether or not the word in the kanji notation C can be connected to one or more other edicts.

In addition, the dictionary memory 14 stores a heading table 25 as shown in FIG. The reading information 1 is the same as the reading information b, and the block B where the reading information 1 [b is stored]
An address pointer A is stored in each of the blocks 81 to 8n. The working memory 15 is the CPU 1
2 is used to temporarily store the results of the arithmetic processing.

Next, the operation of the word processor 1 constructed as described above will be explained according to the D-chisate shown in FIG.

The operator presses the character keys 6 on the keyboard 3 to input a document.
When the input operation is performed, the CPU 12 determines the operated key based on the keyboard control program,
The input signals for the operation keys are converted into character data such as hiragana and katakana, space data, line feed data, etc. and sequentially stored in the input buffer section 16 of the working memory 15 □
I will do it.

At this time, the CPU 12 reads out the most recently inputted character data among the character data etc. that are sequentially stored in the working memory 15 based on the liquid crystal display control program and displays them sequentially on the liquid crystal display 5. To go. Also, when this display is performed, the kana character string (hereinafter referred to as unconfirmed kana character string) before being converted to kana-kanji is displayed in reverse video.

When converting a highlighted undefined kana character string to kana-kanji, the conversion key 7 is operated while the cursor is positioned on the highlighted undefined kana character string. Then, in response to the execution command signal from the conversion key 7, the CPU 12 sets a pointer at the beginning of the undefined kana character string highlighted in reverse video based on the Kanle address (step 1, hereinafter step is denoted by S). Then, the CPU 12 counts the predetermined number N of characters stored in the working memory 15 from the pointer.
Using the character code data (ie, "yomi") as a character string to be converted, a search for a candidate kanji notation C corresponding to the character string is started (S2).

First, refer to the heading table 25 in the dictionary memory 14,
By comparing the kana character string to be searched with the reading information of the first record R1 of each block B, it is determined in which block B the data corresponding to the kana character string exists, and its address pointer is determined. Take out A (S3)
.

Then, using the first record R1 of the identified block Bx as a reference record, compare the reading of the character string to be converted from this record R1 with the reading information stored in that record R1 (S4), and this reading information is the same. It is determined whether or not (35). If this reading information is not the same, CP
By adding the record length information a stored at the beginning of record R1 to the address pointer, U12 changes the address pointer of the next record R236) and determines whether the reference record R2 to be referenced next is the record of the block Bx. That is, it is determined whether the search for the record Bx has ended (S7). If the CPU 12 determines in S7 that the search for block Bx has not been completed, the process returns to S4.

Repeat steps 84 to $7, and finally at 87 block B
If the CPU 12 determines that the search for X has been completed, the search ends in failure, and the CPU 12 then proceeds to S8 and converts a character string obtained by subtracting one character from the predetermined number N of characters counted from the pointer into a character string to be converted. and return to S2. That is, if the search for block 3x ends in failure, the search is performed by sequentially decreasing the number of characters one by one from the predetermined character IN in S8.

Further, when reading information corresponding to the reading of the character string to be converted is found in S5, the kanji notation C of the reference record R is sequentially searched. Then, the CPU 12 first determines whether or not the kanji notation C of the reference record R can be connected to the word found immediately before (the word located immediately before the character string to be converted) based on the part-of-speech information d of the kanji notation C. do. If it is determined that connection is possible, the CPU 12 moves to S10.

Also, if the CPU 12 determines that connection is not possible, the CPU
U12 moves to S8.

If the CPU 12 determines that the connection can be made, it sets the discovered kanji notation C as a candidate character string in S10 and stores it in the working memory 1.
5 is stored in the candidate character buffer section 17, and the candidate character string is displayed on the liquid crystal display 5 based on the liquid crystal display control program, and the pointer for searching the dictionary memory 14 is set to the next reading of the currently searched reading. is reset to the beginning of the character string, and it is determined whether the kanji notation C found in S11 is the last in the kana character string. If it is determined in step 811 that CPtJ12 is the last in the kana character string, the kana-kanji conversion process ends, and if it is determined that it is not the last in the kana character string, the value returns to $2.

In addition, the CPU 12 roughly repeats the processes of S1 to S5 and S9 to S11 to search for other candidate character strings corresponding to the same unconfirmed kana character string, and performs the work together with the first candidate character string found. Candidate character buffer section 17 of memory 15 for
to be memorized. When the next candidate key 10 is pressed down, c is pressed based on the input signal from the next candidate key 10.
p u 12 iJ: Reads the next candidate character string from the candidate character buffer section 17 and displays it on the liquid crystal display 5 in place of the previous candidate character string.

After the candidate character string is displayed on the liquid crystal display 5 as described above, when the operator operates the execution key 8 while positioning the cursor on the candidate character string, based on the confirmation signal of the execution key 8, Then, the CPL 112 finalizes the candidate character string stored in the candidate character buffer 7 section 17 of the working memory 15 as a final character string. Is it an input buff? Part 16
Among the unconfirmed kana character strings stored in , the kana character strings corresponding to the confirmed character strings are rewritten into confirmed character strings and excluded from the conversion target.

Note that the present invention is not limited to the above-mentioned embodiments, and can be arbitrarily modified without departing from the spirit of the present invention.

(Effect of the invention) As detailed above, this invention refers to a reference record during kana-kanji conversion (when the reading of the record is compared with the kana character string to be converted, and if the two match) , selects the kanji notation in that record, and if it does not match, selects the next record as the reference record based on the record length information and searches only the reading part, so it performs kana-kanji conversion at high speed. It has a swollen effect.

[Brief explanation of drawings]

Fig. 1 is an electrical block circuit diagram of the present invention, Fig. 2 is a plan view of a Japanese word processor, Fig. 3 is an explanatory diagram of dictionary memory blocks, Fig. 4 is an explanatory diagram of records, and Fig. 5 is a heading. An explanatory diagram of the table, FIG. 6 is a flowchart. 1 is a word processor, 3 is a keyboard, 4 is a printer, 7 is a conversion key, 8 is an execution key, 9 is a function key, 12 is a central processing unit (CPU), 13 is a ROM, 14 is a dictionary memory, 15 is a working memory , 23 is a program memory,
25 is a heading table, B is a block, R is a record,
a is record length information, b is reading information, C is candidate kanji notation, and d is part of speech information. Patent applicant Brother Industries, Ltd. Representative Patent attorney On 1) Hironobu Figure 4 Figure 5

Claims (1)

[Claims] 1. In a kana-kanji conversion device that has a storage means for sequentially storing a kana character string inputted by an input means and converts the kana character string into a converted character string containing kanji, Consisting of one reading, one or more kanji notation for that reading, and record length information added to a predetermined position of the record indicating the length of the record, it is possible to write multiple records consecutively. When searching for the dictionary storage means to store and the kanji notation corresponding to the kana character string to be converted in the storage means, one record is selected as a reference record, and the pronunciation of that record and the kana character string to be converted are searched. and a search means for selecting the kanji notation in the record if they match, and selecting the next record as a reference record based on the record length information if they do not match. A Kana-Kanji conversion device featuring: