JPS62266662A - Kana/kanji converting device - Google Patents

Abstract

PURPOSE:To decrease the labor of conversion work by providing a dictionary memory means adding compound word propriety information to show whether or not the words by the KANJI (Chinese character) notation can be a factor of the compound word, to a KANJI notation for reading so as to obtain a more correct connected compound word as a candidate for conversion. CONSTITUTION:In a memory 14 for a dictionary, plural records R are stored, and in respective records R, reading information (a) is stored into a head and thereafter, a candidate KANJI notation (b) of one or plural words corresponding to the reading is stored. Before respective KANJI notations (b) compound word propriety information C corresponding to the KANJI notation (b) and a of part speech information (d) are stored. When the KANA (Japanese syllabary)/ KANJI conversion is executed for an undetermined character string and the word having the same reading as the reading of a converting object character string is discovered, a CPU 12 decides whether or not the word can be the factor of the compound word in relation to the preceding word, based upon the compound propriety information C attached to the discovered word.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a kana-kanji conversion device that can efficiently convert compound words into kanji.

(Prior art) Conventionally, when converting an input kana character string into a compound word in kana-kanji, this is done by referring to part-of-speech information stored in a dictionary memory that accompanies each word so that it can be converted using kana-kanji conversion. . This part-of-speech information includes information such as that parts of speech such as nouns and adjectives can be connected, and based on this part-of-speech information, it is determined whether the words corresponding to the input kana character string can be connected to each other. The words are then converted into compound words based on the discrimination results.

(Problems to be solved by the invention) However, in the case of conventional part-of-speech information, the range of words that are the elements of compound words is too wide, and there are many conversion candidates with homophone spellings other than the spelling desired by the worker. , it became quite cumbersome to select the correct word.

(Objective) In order to solve the above-mentioned problems, the purpose of the present invention is to provide a kana-kanji conversion device that can use compound words with more accurate connections as conversion candidates, and can reduce the labor of kana-kanji conversion work. be.

(Means for Solving the Problems) The kana-kanji conversion device of the present invention converts the kanji representation of one or more words into readings, adds to each kanji representation,
dictionary storage means for storing compound word availability information indicating whether or not the word written in kanji can be an element of a compound word;
An input means for inputting kana character data, and when converting the reading of the kana character data into kanji notation, the nearest word to the word to be converted is based on the compound word availability information stored in the dictionary storage means. The present invention is characterized by comprising a converting means for determining whether connection is possible and preferentially selecting the Kanji notation of the connectable word, and a display means for displaying the Kanji notation converted by the converting means.

(Operation) When kana character data is input by the input means, the conversion means determines whether the word for the reading to be converted can be connected to the nearest word based on the compound word availability information stored in the dictionary storage means. The kanji notation of connectable words is selected preferentially, and the display means displays the kanji notation converted by the converting means.

(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 4.

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
A multi-line liquid crystal display 5 is provided as a display means, each line having 40 digits. Various operation keys are arranged on the keyboard 3, including a character key 6 for inputting hiragana and alphabet letters and numbers, and a conversion key 7.
, an execution key 8, a function key 9, a next candidate key 10, and a cursor movement key 11 for moving the cursor displayed on the liquid crystal display 5.

Conversion key 7 is the key operated when converting kana to kanji.
An execution command signal is output to the CPU 12, 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 conversion 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. Memory (RA
A working memory 15 consisting of M) is connected. The working memory 15 includes an input buffer section 16 that temporarily stores character code data input using the character keys 6, a candidate character buffer section 17 that temporarily stores candidate character strings, and the like. The CPIJ 12 is connected to the keyboard 3 via a keyboard driver 18, and is connected to the display controller 19.
It is connected to the liquid crystal display 5 via. moreover,
The CPU 12 connects the printer 4 via the print driver 20.
It is also connected to various memories such as the 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, and a liquid crystal display control program for operating the word processor 1 in various ways. It has a character generator 24. The character generator 24 stores character pattern data such as characters and symbols to be displayed or printed in a dot matrix for each typeface. The code table 21 stores character codes corresponding to characters and symbols.

A plurality of records R are stored in the dictionary memory 14. One record R stores reading information a at the beginning, and after that reading information a, 1 corresponding to the reading is stored.
Candidate kanji representations of one or more words are stored. In addition, compound word availability information C1 and part-of-speech information d corresponding to the kanji notation are stored on the surface of each kanji character.

Compound word availability information C is information indicating whether or not the corresponding word written in kanji can be an element of a compound word, and
The part-of-speech information d is information that is given the characteristic of grammatical connection and is used to determine whether or not the word can be connected with one or more other words corresponding to the word written in Kanji. The working memory 15 is used to temporarily store the results of calculations performed by the CPU 12.

Next, the operation of the word processor 1 configured as described above will be explained according to the flowchart 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 are sequentially stored in the input buffer section 16 of the working memory 15.

At this time, the CPIJ 12 reads 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. Furthermore, when this display is performed, the kana character string (hereinafter referred to as an unconfirmed character string) before being converted to kana-kanji is displayed in reverse video.

When converting a highlighted undefined character string into kana-kanji, the conversion key 7 is operated while the cursor is positioned on the highlighted undefined character string.

Then, in response to the execution command signal from the conversion key 7, the CP
U12 sets a pointer to the beginning of the highlighted undefined character string based on the cursor address (step 1,
Steps are hereinafter represented by S).

Then, the CPU 12 stores character code data (of the predetermined number N of characters) counted from the pointer and stored in the working memory 15 (
In other words, the word corresponding to the character string is searched for in each record R of the dictionary memory 14 using the character string to be converted.
(S2).

Then, in S3, the CPU 12 determines whether or not the corresponding word exists in the dictionary memory 14 based on the reading information a of each record R. In S3, if the CPU 12 does not find a word corresponding to the character string to be converted from the dictionary memory 14, the process moves to S4, where the character string is created by subtracting one character from the predetermined number N of characters counted from the pointer, and the process returns to S2. That is, each time the CPU 12 cannot find a word with the same pronunciation as the conversion target character string of a predetermined number of characters in the dictionary memory 14 in S3, the search is performed by sequentially decreasing the predetermined number of characters N by one character in S4. Also, if a word corresponding to the character string to be converted is found in S3, the CPU
Step 12 moves to S5, in which it is determined whether the found word can be an element of a compound word in relation to the single 8B immediately preceding the word, based on the compound word availability information C given to the word.

If the CPU 12 determines that the found word can be an element of a compound word, it sets the kanji representation of the found word as a candidate character string and stores it in the candidate character buffer section 17 of the working memory 15.

Then, in S6, the CPU 12 displays the candidate character string on the liquid crystal display 5 based on the liquid crystal display control program, and moves the pointer for searching the dictionary memory 14 to the beginning of the character string next to the fully searched pronunciation. It is determined whether or not it is the last character string in the searched kanji character string in step S5. If the CPU 12 determines in S7 that it is the last character in the kana character string, the kana-kanji conversion process ends, and if it determines that it is not the last in the kana character string, the process returns to S2.

Furthermore, if the CPU 12 determines in S5 that the discovered word cannot be an element of a compound word, the CPU 12 then determines in S8 whether or not the discovered word can be connected to the previously discovered word in kanji. The discrimination is made based on the part of speech information d. Then, when determining that connection is possible, the CPU 12 performs S6
to move to. Further, if the CPU 12 determines that connection is not possible, the CPU 12 moves to S4. Note that part-of-speech information d is used for the first character string to be converted among the undetermined character strings.
A word that is determined to be the beginning of a minute based on is selected.

Furthermore, the CPU 12 repeatedly performs the processing of S1 to S8,
Search for other candidate character strings corresponding to the same undetermined character string, and store them in working memory 1 along with the first candidate character string found.
5 is stored in the candidate character buffer section 17. Then, when the next candidate key 10 is pressed down, the next candidate key 10
Based on the input signal from , the CPL 112 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 CPtJ 12 finalizes the candidate character string stored in the candidate character buffer 1 part 17 of the working memory 15 as a final character string. In other words, the input buffer? Part 16
Among the undetermined character strings stored in , the kana character string corresponding to the determined character string is replaced by 1 with the determined character string 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.

(Effects of the Invention) As detailed above, by having information on whether or not it can be an element of a compound word, this invention allows compound words with more accurate connections to be converted candidates, and reliable Kanji characters. This has the excellent effect of reducing the labor involved in converting kana to kanji.

[Brief explanation of the drawing]

FIG. 1 is an electrical block circuit diagram of an embodiment of the present invention, FIG. 2 is a plan view of a Japanese word processor, FIG. 3 is an explanatory diagram of records in a dictionary memory, and FIG. 4 is a flow chart. 1 is a word processor, 3 is a keyboard, 7 is a conversion key, 12 is a central processing unit (CPU), 13 is a ROM, 14
1 is a dictionary memory, 15 is a working memory, and 23 is a program memory.

Claims (1)

[Scope of Claims] 1. Kanji representation of one or more words for reading, and compound word availability information that is added to each kanji representation and indicates whether or not the word written in kanji can be an element of a compound word. A dictionary storage means for storing kana character data, an input means for inputting kana character data, and when converting the reading of the kana character data into kanji notation,
a conversion means that determines whether or not a word corresponding to a reading to be converted can be connected to a word closest to it based on compound word availability information stored in a dictionary storage means, and preferentially selects a kanji representation of a word that can be connected; A kana-kanji conversion device comprising: display means for displaying the kanji notation converted by the conversion means.