JPS63308664A - Character processing device - Google Patents

Abstract

PURPOSE:To improve the discriminating efficiency of a homonym at the time of a KANA (Japanese syllabary)/KANJI (Chinese character) conversion by executing the discrimination of the homonym with attribute information concerning to a noun and a prefix to this noun. CONSTITUTION:In a storage means 100, a KANJI corresponding to a reading and attribute information concerning to a prefix as for a KANJI-conversion are stored in advance. When there is the KANJI of a homonym to correspond to the inputted reading, a extracting means 200 extracts the KANJI to be converted out of the KANJI of a homonym based on the attribute information stored in the storage means 100. Thus, the discriminating efficiency of the homonym at the time of the KANA/KANJI conversion can be improved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a character processing device for creating and editing documents, and particularly to a character processing device capable of performing kana-kanji conversion.

[Conventional technology]

In general, character processing devices that perform kana-kanji conversion, particularly character processing devices that convert the reading of an input sentence into a sentence containing kanji and kana, have been considered.

Conventionally, this rice character processing device has a memory (hereinafter referred to as a dictionary) that stores grammatical information such as pronunciations and parts of speech for words, and processes input data based on the pronunciations and part of speech information stored in this memory. The reading information for each sentence is divided into words, and words that can be converted to kanji are converted to kanji to create kanji-kana mixed sentences.

(Problems to be Solved by the Invention) However, in conventional character processing devices of this type, homophones can only be determined for odd nouns.
There was a problem that other nouns could not be distinguished. This point will be explained in detail.

For example, when the input "I believe" is entered,
The character processing device separates the words into two words: ``kanshin'' and ``suru.'' Next, when converting ``kanshin'' into kanji, the kanji ``interest'', ``kanshin'', and ``kanshin'' are extracted from the dictionary, and ``kanshin'' is a strange noun, that is, after a noun, ``suruj'' is extracted.
It determines that the noun is a noun that can change with the verb by connecting the words, etc., based on the grammatical information stored in the dictionary, detects that ``suru'' is ``connected,'' and inputs the reading ``kanshinsuru''. ” should be changed to “I am impressed.”

However, for the reading input ``kanshin omotsu,'' the character processing device can determine that ``kanshin'' is not ``kanshin,'' but it cannot determine whether it is ``kanshin'' or ``interest.'' Therefore, homophone kanji (candidate kanji) were displayed on the display device, and the operator had to select and input the corresponding kanji using the instruction keys.

Therefore, the purpose of the present invention is to solve such problems,
An object of the present invention is to provide a character processing device that can improve the efficiency of identifying homophones during kana-kanji conversion.

[Means for solving problems]

In order to achieve such an object, the present invention provides a character processing device capable of converting character information input in reading into a kanji-kana mixed sentence, in which kanji corresponding to the reading, attribute information regarding kanji conversion, and If you have a storage device that stores ``in advance'' and a homonym kanji that corresponds to the input reading,
The present invention is characterized by comprising an extraction means for extracting a Kanji to be converted from homophones of Kanji based on the attribute information stored in the storage means.

(Function) In the present invention, the extraction means refers to the pronunciations connected before or after the homophone to the attribute information base such as prefixes and suffixes that can be connected to the kanji stored in the memory information, and Kanji with prefixes and suffixes are extracted as candidates for kanji conversion, so homophones can be automatically selected.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

In addition, the present invention is a noun that can be connected with a prefix or a prefix, for example, ``interest'' is a noun that connects ``go,'' which expresses honorific language, but ``kanshin'' is a noun that does not connect ``go.'' Based on the knowledge that homonyms are identified, homophones are identified using attribute information regarding nouns and prefixes for these nouns.

FIG. 1 is a block diagram showing an example of the basic configuration of an embodiment of the present invention. Reference numeral 100 is a character processing device capable of converting character information input in reading into a kanji-kana mixed sentence, and is a storage means in which kanji corresponding to the reading and attribute information regarding kanji conversion are stored in advance.

Reference numeral 200 denotes an extraction means for extracting the kanji to be converted from among the homonymous kanji characters based on the attribute information stored in the storage means, if the kanji characters have homonymous meanings corresponding to the input pronunciation.

FIG. 2 shows an example of the configuration of an embodiment of the present invention. In FIG. 2, the CPU is a microprocessor that performs calculations for character processing, logical judgments, etc.
, control bus CO, and data bus DB, each component connected to these buses is controlled. Address bus 8B transfers address signals indicating the components to be controlled by the microprocessor CPU. The control bus CB transfers and applies control signals for each component to be controlled by the microprocessor CPU. The data bus DB transfers data between each component device.

The ROM is a read-only fixed memory that stores the control procedures shown in FIGS. 3 to 4 by the microprocessor GPυ. The RAM is a random memory in which data of 1 word and 6 bits can be written. It is an access memory and is used to temporarily store various data from each component.

Buffer y INBLIF is random access memory RA
The entered character on M is memorized. Buffer PR
EBIIF is located on random access memory RAM,
"Ono" When a word starting with "Gono" is detected, this word is extracted and temporarily saved.Buffer 0
UTBUF is located on random access memory RAM,
The converted characters are stored.

The memory area, DiC, is also on the random access memory RAM, and has a reading field YF and a kanji field K.
F, HF part of speech field HF attribute information GF. Note that the stored contents of the memory area DiC function as a kanji dictionary.

Reference numeral B denotes a keyboard, which has a group of various keys for inputting various data in the character processing device and instructing kana-kanji conversion.

CR is a cursor register, which is a memory in which the microprocessor CPU writes and reads data regarding the cursor position. Based on the data stored in the cursor register CR, the CRT controller cl'lTc displays a cursor at the display position on the display surface of the display device (R7).In this embodiment, the display surface of the display device CRT is placed on the document page. It is assumed that the display position on the display screen corresponds to the line and column of each document.Furthermore, it is assumed that each page is a document composed of the same number of lines.

PRT is a printer and is controlled by the microprocessor CPU to print the contents of DBUF.

DBUF is a data buffer, which is a memory for temporarily storing document information input from the keyboard KB.
It is displayed on the display screen of the display device CRT by the RT controller CRTC. This buffer memory DBUF is used as a refresh memory for the display device CRT, and can be freely read and written by the microprocessor CPU. This data buffer y DBIJF is I
It has a capacity of OX 5W (W: word, 1w: 1 character) and is displayed on a display device CRT. Characters, etc., are displayed in 1θ characters horizontally and 5 lines vertically, and are correlated in order with the contents of the 5o words of the data buffer DBUF. Furthermore, the data stored in the data buffer DBUF is numbered in order from 1 to 50, the first data is DBUF (1), the next data is DBOF (2).
The Nth data is generally expressed as DBOF (N).

The CRT controller CRTC has a cursor register CB.
Based on the cursor position and character/symbol code signals stored in the data buffer memory DBUF, the display of the cursor and display pattern on the display surface of the display device C/RT is controlled.

A CRT is a display device using a cathode ray tube or the like, and a dot-configured display pattern and a cursor display on the display device CRT are controlled by a CRT controller. Furthermore, CG is a character generator, and display device C
It generates character signals such as characters and symbol cursors to be displayed on the RT, and each character symbol is
The bit configuration is 6x16. DISK is an external memory for storing created documents.

With the above configuration, the operation of this embodiment will be explained with reference to the flowcharts shown in FIGS. 3 and 4.

FIG. 3 shows a microprocessor CP in an embodiment of the present invention.
An example of the control procedure of U is shown. In FIG. 3, when the operator turns on the power, in step 1 the microprocessor is stored in the random access memory RAM and external storage device DIS.
Transfer the contents of the dictionary from K. In step S2, a state of waiting for a key input from the keyboard KB is maintained. When the B key is pressed on the keyboard, the process proceeds to step S3, where the microprocessor CPU determines the type of key input. Depending on the result of this determination, either kana-kanji conversion processing or other processing is performed. Unless the pressed key is a key that instructs kana-kanji conversion, processing corresponding to the pressed key is performed in step S5. For example, when character information is input from the keyboard KB, the microprocessor cpu controls the input character information to be stored in the buffer DBIIF (step S4).

When the key instructing kana-kanji conversion is pressed, in step S5, processing is performed to convert the input wheel stored in the buffer INBtIF into a sentence containing kanji and kana.

The details of this kanji conversion processing procedure are shown in FIG.

In FIG. 4, the microprocessor CPU divides the input word stored in the buffer INBUF into word units according to a known control procedure, and executes a dictionary search in step 541 for each of the divided character strings.

After executing the dictionary search in step 541, step S4
Proceeding to step 2, the microprocessor CPU checks whether there is a word corresponding to the character string of the divided reading in the dictionary DiC.
If the corresponding word checked exists, the process proceeds to step 5421, where the microprocessor CPU extracts the corresponding word from F in the Kanji field of the dictionary DiC and stores it in the buffer 0UTBUF.

If the corresponding word does not exist in the dictionary DiC, the process advances to step S43, and it is checked whether the reading character string starts with "o" or "go".

If the word starts with a character other than "o" or "go", the microprocessor CP determines that the corresponding word does not exist in the dictionary.
U makes a judgment, proceeds to step 5431, and stores the input reading character string as a hiragana character string in buffer 0IITBU.
Store in F. If the reading of the above character string starts with either "O" or "GoJ", step 54
Proceed to step 4 and change the first reading of buffer INBUF to "o" or "
Store it in your J PREBIIF. Further step S4
The process proceeds to step 5, and the remaining character string after removing the first reading of the buffer INBUF is set in the buffer INBUF, and the process proceeds to step 546, where the dictionary DiC is searched again to see if there is a kanji character corresponding to this character string. If it is determined in step S47 that the word does not exist in the dictionary DiC, the process proceeds to step 5471 and converts the character strings in the buffer PREBUF and buffer INBIJF to 0 as a hiragana character string.
Store in UTBUF.

If it is found that the corresponding word exists in the dictionary DiC, in step 548, the honorific language flag in the attribute field GF corresponding to the corresponding word in the dictionary DjC is referred to, and the content of the buffer PREBUF and the honorific language flag are determined. Check if they match.

If the contents of the buffer PREBUF and this honorific flag do not match, it is determined that the corresponding word cannot be converted into kanji,
Proceed to step 5471 and transfer the character strings in buffer PREBUF and buffer INBUF to buffer 0UT.
Store in BUF.

If the contents of the buffer PREBIIF and the honorific language flag match, the process advances to step 549, and the contents of the buffer PREBUF and the contents of F are set in the kanji field corresponding to the corresponding word in step S47 in the buffer 0IITBUF.

By executing the above process for each input character string, it is possible to convert the input characters into kana-kanji characters.

In this embodiment, we have described the identification of homophones with a focus on the connection information of honorific words, but as another example, attribute information such as how a word accompanies a numeral can also be classified using type codes in the same way as for the honorific language described above. It is sufficient to store it in the defined area GF. For example, when a character string such as "r~butashiyurui no~" is given, if there is attribute information that indicates that the number "two" can be connected to the "type", the rMfm type is created. ” can be avoided.

〔Effect of the invention〕

As described above, according to the present invention, attribute information such as not only the pronunciation and part of speech of words but also information on whether or not prefixes such as honorific words can be connected is recorded in the kanji dictionary, and homonyms can be identified using this attribute information. Since the characters can be distinguished, the conversion efficiency of kana-kanji conversion is improved, and the number of times the operator has to select homophones is reduced, making it possible to provide a character processing device with excellent operability. Effects can be obtained.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an example of the configuration of an embodiment of the present invention, FIG. 2 is a block diagram showing a specific configuration example of the embodiment of the present invention, and FIGS. 3 and 4 are control diagrams of the embodiment of the present invention. Flowchart showing an example of the procedure. FIG. 5 is an explanatory diagram showing an example of the configuration of a dictionary in the embodiment of the present invention. DiC...word dictionary, YF...reading field in word dictionary DiC, K
F...Kanji field in word dictionary DiC, GF
...Attribute information field in word dictionary DiC, HF...Part of speech field in word dictionary DiC, I
NBUF: Buffer where input characters are placed, PRE
BUF...When a word starts with "o" or "go",
Buffer where the first character is cut out, 0UTBUF
...Buffer into which converted characters are placed, CPU...Microprocessor.

Claims (1)

[Scope of Claims] 1) In a character processing device capable of converting character information input in reading into a kanji-kana mixed sentence, a storage means that stores in advance kanji corresponding to the reading and attribute information regarding kanji conversion. and an extraction means for extracting the kanji to be converted from the homonymous kanji based on the attribute information stored in the storage means, when there is a homonymous kanji corresponding to the input reading. A character processing device characterized by: 2) The character processing device according to claim 1, wherein the attribute information regarding the kanji conversion is a prefix and/or a suffix determined corresponding to the kanji.