JPH03116362A - Character processor - Google Patents

Abstract

PURPOSE:To reduce operator's erroneous selection by providing a means which displays examples of each of homophone candidates easy to mistake. CONSTITUTION:A RAM is a writable random access memory and is provided with a text buffer TBUF where a document to be handled is stored in an internal form, a dictionary DIC for KANA(Japanese syllabary)-KANJI(Chinese character) conversion, and an example dictionary YOD for example display. Examples of homophones easy to mistake out of homophone candidates obtained by KANA-KANJI conversion are displayed. Thus, an accurate candidate is selected and settled to realize a character processor of high operability.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a character processing device for inputting a sentence containing kanji and kana through kana-kanji conversion.

[Prior Art] Currently, character processing devices such as Japanese word processors generally input sentences containing kanji and kana using kana-kanji conversion.

That is, the operator's work is as follows. First, enter kana characters. Next, specify Kana-Kanji conversion,
Convert to a sentence containing kanji and kana. As a result, interpretable conversion candidates are output. The operator must select and confirm the candidate he/she desires from among these.

[Problem to be solved by the invention] However, conversion candidates (hereinafter referred to as homophone candidates, as they are candidates for the same reading) through kana-kanji conversion have similar meanings and are extremely confusing. The candidates are sometimes mixed, which is one of the causes of operators making incorrect selections. For example, for the reading ``Kaido'', there are possible homophone candidates such as ``Answer'', ``Answer'', and ``Phantom Thief''. There is a very high possibility that you will make the mistake of selecting the wrong answer. This is because the meanings of ``answer'' and ``answer'' are very similar, and there are few people who accurately understand the difference in how they are used.

[Means for Solving the Problems (and Effects)] The present invention provides a function to reduce the operator's erroneous selection by providing a means for displaying usage examples of each candidate for homophone candidates that are easily mistaken. It is something to do.

[Example] The present invention will be described in detail below with reference to the drawings.

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

In the illustrated configuration, the CPU is a microprocessor that performs calculations for character processing, logical judgments, etc.
B to control each component connected to those buses.

Address bus AB 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.

Next, ROM is a read-only fixed memory, and the eighth
Microprocessor CPU to be described later with reference to FIGS.
The control procedure is memorized.

Further, the RAM is a writable random access memory having a configuration of 1 word and 16 bits, and is used for temporary storage of various data from each component. TBUF is a text buffer that stores documents handled by this character processing device in an internal format.

DIC is a dictionary for performing kana-kanji conversion. YO
D is an example dictionary for displaying examples.

KB is a keyboard, which includes letters and symbols such as alphabet keys, hiragana keys, katakana keys, etc.
It is equipped with various function keys for instructing various functions to the character processing device, such as a conversion key, next candidate key, candidate display key, and confirmation key.

DISK is an external memory for storing document data, and stores documents created on the text buffer TBUF, and the stored documents can be called up when necessary by instructions from the keyboard.

CR is a cursor register. The CPU can read and write the contents of the cursor register.

A CRT controller CRTC, which will be 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 that stores data patterns to be displayed. When displaying the contents of document data, a pattern is developed on DBUF based on the data on text buffer TBUF.

CRTC is cursor register CR and buffer DBUF
It plays the role of displaying the contents stored in the CRT on the display device CRT.

Further, a CRT is a display device using a cathode ray tube or the like, and a CRT controller controls the dot-configured display pattern and cursor display on the display device CRT.

Furthermore, CG is a character generator that stores patterns of characters and symbols to be displayed on the display device CRT.

The character processing device of the present invention, which is composed of each of these components, operates in response to various inputs from the keyboard KB, and when the input from the keyboard KB is supplied, the included signal is first sent to the microprocessor. C.P.
The microprocessor CPU reads various control signals stored in the ROM, and various controls are performed in accordance with these control signals.

FIG. 2 is a diagram showing an example of a conversion operation by the apparatus of the present invention, and is an explanatory diagram when an easily mistaken homophone is converted as a first candidate. Part (a) of the figure shows the display on the screen at the time when the reading sequence has been input. After that, when the conversion key is pressed, the screen shown in (b) is displayed, and the input reading sequence is converted into kanji and displayed. ``Answer wo'' is a homophone that is easily confused, so it is converted with an underline to make it stand out, but other homophones are displayed in the normal display format. Next, move the cursor to "Answer" and
When the candidate display key is pressed, the screen shown in (c) appears. A list of conversion candidates for kana-kanji conversion is displayed, and since the current candidate is the easily mistaken homophone "answer", an example of the usage of "answer" is automatically displayed.

FIG. 3 is an example in which the first candidate for kana-kanji conversion is not an easily mistaken homophone. (a) shows the state immediately after inputting the pronunciation sequence and pressing the conversion key. Unlike the case shown in FIG. 2, this is the screen when "Phantom Thief" is converted as the first candidate. "Phantom Thief" is not an easily confused homophone, so it is displayed in the normal display format. When the next candidate key is pressed, the screen shown in (b) appears and conversion candidates are displayed. The cursor on the candidate viewing screen moves to the position of the next candidate, "President," and "President" is designated as the current candidate. Among the conversion candidates, "answer" and "answer" are homonyms that are easily confused, so they are displayed with an angline. The other candidates, ``Chairman'' and ``Phantom Thief,'' are not particularly confusing, so they are displayed in the normal display format. The current candidate ``Kaisho'' is not an easily mistaken homophone, so no example usage is displayed. When you press the seat selection candidate key (
The screen shown in C) will appear. "Answer" is indicated as the current candidate. Since "answer" is a homophone that is easily confused, examples are automatically displayed.

If the confirm key is pressed in this state, the "answer" is confirmed, the candidate list display is erased, and the "answer" is actually embedded in the document.

FIG. 4 is a diagram showing the structure of the text buffer TBUF.

Text consists of character data of multiple fixed lengths. Each character data consists of 1 character and 2 bytes, and J
Stored in IS X 020g code.

The MSB is a flag indicating whether the character is a confirmed normal character or a homophone for which the next candidate can be displayed. When it is 0, it means a normal character, and when it is 1, it means a homophone code.

If it is a homophone code, use the character code JIS X 020.
Homophone numbers are stored instead of 8 codes. By referring to the homophone buffer shown in FIG. 5 based on the homophone number, it is possible to know what kind of homophone candidates there are or the nature of the homophone.

FIG. 5 is a diagram showing the configuration of the homophone buffer.

"Yomi" stores the pronunciation sequence of its homophone.

For example, the homophone "answer" is stored as "kaito".

"Total number of candidates" stores the total number of conversion candidates stored in the homophone buffer. For example, for the homophone "answer", the conversion candidates are "answer", "answer", "phantom thief", and "chairman".
If there are four, the value 4 is stored.

"Candidate number" is the currently indicated candidate for that homophone (
That is, a value indicating the number of the currently displayed candidate from the beginning is stored. Immediately after conversion, the value 1 is stored and the first candidate is displayed. Each time the next candidate key is pressed, 1 is added to this value and the next candidate is displayed.

"Notation" stores the notation of each conversion candidate.

The "easily mistaken homophone flag" stores a flag indicating whether the conversion candidate is an easily mistaken homophone.

If it is a homophone that is easily confused, 1 is stored, otherwise O is stored.

The value of the "example number" is stored only in the case of easily mistaken homophones, and it is stored in which part of the example dictionary YOD shown in Fig. 6 is stored the data to be displayed when displaying the example of the conversion candidate. Ru.

FIG. 6 is a diagram showing the configuration of the dictionary DEC.

It consists of ``pronunciation,''``notation,'' ``part of speech,'' ``easily mistaken homophone flag,'' and ``example number.''

``Yomi'' means the reading of the word, ``notation'' means the notation of the word,
“Part of speech” stores the part of speech of a word.

The "easily mistaken homophone flag" stores whether the word is a word that is likely to be selected incorrectly. For example, "Answer"
For "Answer", the value 1 (easy to make mistakes) is stored,
Value O for “Phantom Thief” and “Chairman” (not easy to make mistakes)
is stored.

The value of the "example number" is stored only when the "easily mistaken homophone flag" is 1. It is stored in which part of the example dictionary YOD shown in FIG. 6 is stored the data to be displayed when displaying examples of the word. For example, for "Answer" the value is 500, for "Answer" the value is 501
is stored.

FIG. 7 is a diagram showing the structure of the example dictionary YOD.

Display data to be displayed in the example display corresponding to each example number is stored. For example, the example display data for the word "answer" is stored in the example number 500, and the example display data for the word "answer" is stored in the example number 501.

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

FIG. 8 is a flowchart of the part that takes in key human power and performs processing.

Step 8-1 is a process of taking in data from the keyboard. In step 8-2, the type of the retrieved key is determined, and the process branches to a processing routine for each key.

If it is a conversion key, the process branches to step 8-3, and in step 8-3, conversion processing for kana-kanji conversion is performed as detailed in FIG. 9. Furthermore, in step 8-4, the conversion display process detailed in FIG. 1O is performed, and the first candidate of the conversion results is displayed. After that, the process branches to step 8-1.

If it is the next candidate key, the process branches to step 8-5, and the next candidate process detailed in FIG. 11 is performed in step 8-5. After that, the process branches to step 8-1.

If it is a candidate display key, branch to step 8-6,
At step 8-6, a candidate display process detailed in FIG. 12 is performed. After that, the process branches to step 8-1.

If it is a confirmed key, the process branches to step 8-7. Homophone confirmation processing is performed in step 8-7.

That is, the current candidate for the homophone (the candidate indicated by the candidate number in the homophone buffer) is embedded in the document as a confirmed character code instead of the homophone code, and the homophone buffer is released. Additionally, the candidate list display is deleted. After that, the process branches to step 8-1.

For other keys, branch to step 8-8, insert,
Other processing performed in normal character processing devices, such as deletion, is performed. After that, the process branches to step 8-1.

FIG. 9 is a detailed flowchart of the "conversion process" in step 8-3.

In step 9-1, the input pronunciation sequence is analyzed by performing dictionary search, morphological analysis, syntactic analysis, etc., and clause candidates are created. In step 9-2, the likelihood of each clause candidate is calculated to determine which clause is most likely to be converted, and is determined as the first candidate. In step 9-3, a homophone buffer is created based on the determined first candidate. At this time, the notation read from the dictionary, easily mistaken homophone flags, example numbers, etc. are transferred. Step 9
-Create a homophone code corresponding to the homophone buffer created in step 4, and output it as a homophone on the document TBUF.

FIG. 10 is a detailed flowchart of the "conversion display process" in step 8-4.

In step 10-1, it is determined whether the homophone currently being displayed is an easily mistaken homophone by referring to the "easily mistaken homophone flag" in the homophone buffer. If it is a homophone that is easily mistaken, the process proceeds to step 10-2, and the homophone is displayed with an angline. If it is not an easily confused homophone, go to step 10.
-Proceed to step 3 and display in the normal display format. Step 10
-4, determine whether all homophones have been displayed, and if there are still homophones to display, step 1
Branches to O-1. Returns when all display is completed.

FIG. 11 is a detailed flowchart of the "next candidate processing" in step 8-5.

In step 11-1, the position of the homophone buffer where the next candidate should be displayed is obtained from the cursor position. In step 11-2, the value of the candidate number in the homophone buffer is counted up so that the next candidate is designated as the current candidate. In step 11-3, the candidates in the homophone buffer are displayed as a list of candidates on the candidate list screen as detailed in FIG. In step 11-4, it is determined whether the "easily mistaken homophone flag" of the current candidate to be newly designated is 1. Only when it is 1, the process proceeds to step 11-5, and an example of the candidate is displayed. The example display data is obtained by referring to the example dictionary YOD based on the "example number" of the current candidate. If the "easily mistaken homophone flag" is 0, the example is not displayed and the process returns.

FIG. 12 is a detailed flowchart of the "candidate list display" step 11-3.

In step 12-1, index i indicating the candidate
Initialize to O. In step 12-2, it is determined whether all homophone candidates have been displayed. That is, it is determined whether or not i exceeds the total number of candidates, and when the display ends, the process returns. If there are still homophone candidates to be displayed, the process advances to step 12-3. In step 12-3, the i-th homophone candidate (0
It is determined whether or not the second candidate (meaning the pronunciation) is a homophone that is easily confused. That is, it is determined whether the "easily mistaken homophone flag" of the i-th candidate in the homophone buffer is 1. If it is a homophone that is easily mistaken, the process proceeds to step 12-4, and the i-th candidate is displayed on the candidate viewing screen with an underground line. If it is not an easily mistaken homophone, the process proceeds to step 12-5, and the i-th homophone candidate is displayed on the candidate list screen in the normal display format. Thereafter, the process branches to step 12-2.

FIG. 13 is a detailed flowchart of the "candidate display process" in step 8-6.

In step 13-1, the position of the homophone buffer where the next candidate is to be displayed is obtained from the cursor position. In step 13-2, the candidates in the homophone buffer are displayed as a list of candidates on the candidate list screen as detailed in FIG.

In step 13-3, it is determined whether the "easily mistaken homophone flag" of the current candidate is 1. Only when it is 1, the process proceeds to step 13-4, and an example usage of the candidate is displayed. The example display data is obtained by referring to the example dictionary YOD based on the "example number" of the current candidate. If the "easily mistaken homophone flag" is 0, the example is not displayed and the process returns.

[Other Example J In the above explanation, the meanings of homophones, example sentences, etc. were displayed as information displayed in the example display.
Any information may be displayed as long as it is useful in selecting homophones. For example, the field in which the word is used, restrictions on the use of the word (
It may be possible to display warnings such as discriminatory terms or terms prohibited from broadcasting.

In addition, although we have explained that an underground display is used as a special display format, since the purpose is to make it more noticeable to the operator, we recommend that you display it in other display formats, such as reverse display, blinking display, or shaded display. It can also be configured as

Further, although the homophone selection for kana-kanji conversion has been described, the present invention can be applied to any candidate selection device as long as the operator has a problem with selection.

[Effects of the Invention] As is clear from the above description, according to the present invention, it is possible to display examples of homophones that are easily confused among homophone candidates converted by kana-kanji conversion, so accurate candidates can be displayed. It is possible to select and confirm a character processing device with high operability.

Furthermore, when the operator tries to select and confirm a homophone candidate, examples are automatically displayed, so he or she will inevitably have to review the usage examples of that word, and even if the operator is not familiar with how to use the word, he or she can get accurate candidates. It is possible to select and confirm the selection, and it is possible to realize a character processing device that creates high-quality sentences with fewer erroneous selections.

[Brief explanation of drawings]

Fig. 1 is a block diagram of the overall configuration of the present invention, Fig. 2 shows an example of the operation when a homophone that is easily mistaken during kana-kanji conversion is the first candidate. Figure 4 shows the structure of the text buffer in the present invention. Figure 5 shows the structure of the homophone in the present invention. FIG. 6 is a diagram showing the configuration of a dictionary for kana-kanji conversion in the present invention. FIG. 7 is a diagram showing the configuration of an example dictionary in the present invention. 1 is a flowchart showing the operation of the invented character processing device. DISK...External memory PU OM AM B UF IC OD...Microprocessor...Read-only memory...Random access memory...Text buffer...Kana-kanji conversion dictionary...Example dictionary man 6 Illustration Leopard 12 II￥l

Claims (1)

[Scope of Claims] 1. An input means for inputting the pronunciation of a word; a dictionary storing the pronunciation of the word in correspondence with its notation; and notation of the pronunciation sequence input by the input means by referring to the dictionary. a conversion candidate display means for displaying a notation that is a conversion candidate converted by the conversion means; and a conversion candidate determination unit for instructing and finalizing a desired one of the conversion candidates displayed by the conversion candidate display means. A character processing device comprising: means for displaying examples of the conversion candidates; and example display means for displaying examples of the conversion candidates. 2. An input means for inputting the pronunciation of a word; a dictionary that stores the pronunciation of the word in correspondence with its notation; and a conversion means that converts the pronunciation inputted by the input means into the notation by referring to the dictionary. , a conversion candidate display means for displaying a notation that is a conversion candidate converted by the conversion means; a conversion candidate instruction means for instructing one to be selected from among the conversion candidates displayed by the conversion candidate display means; and the conversion candidate instruction. A character processing device comprising: a conversion candidate selection means for determining a conversion candidate designated by the means; and a usage example display means for displaying an example corresponding to the conversion candidate designated by the conversion candidate designation means. .