JPH0447447A - Character processor - Google Patents

Abstract

PURPOSE:To prevent selection of erroneous variant form characters by displaying variant form character candidates in a size larger than normal characters at the time of displaying conversion candidates for variant form character conversion. CONSTITUTION:Characters are set to a smaller size when a window for display of a list of variant form character candidates is opened, and candidate numbers on the list of variant form character candidates are displayed in the small size. Next, characters are set to a larger size and variant form character candidates are displayed in a larger size hereafter. Since variant form characters are displayed in the large size differently from normal characters at the time of displaying a list of variant form candidates of, for example, 'ken(Chinese character)' in the window, faint differences among variant form characters are found to reduce the probability of erroneous selection.

Description

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

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

Kana-kanji conversion converts the input pronunciation sequence into kanji by referring to a dictionary. However, due to memory capacity for storing dictionaries, not all words are registered in dictionaries. Words that are not registered in this way include words that are not commonly written, such as words that are written in different characters, as well as words that are difficult to understand in terms of word volume.

For example, the person's name ``Meter Reading'' is a surname with a certain degree of meaning, so it is usually registered in a kana-kanji conversion dictionary. However, ``Nuno'', which is a variant of ``Matsu'', is an unusual surname, so it can only be registered in a fairly large-capacity dictionary.

In this way, there is a high possibility that variant characters will be used especially for personal names, but even if we tried to accommodate all of the variant names, we would not be able to register them in a dictionary with a very limited capacity due to the number of combinations.

Therefore, in order to solve the above problem, a method called variant character conversion has been proposed. To do this, register only words with standard fonts (for example, ``meter reading'') in the dictionary, and enter words with variant fonts (for example, ``nono'') by converting standard words into variant fonts. That is what it is.

According to Kamigonmi's method, for example, if you move the cursor to ``matsu'' in ``meter reading'' and instruct ``convert variant characters,''``pine'' will be converted to ``anzu.''

When there are multiple candidates for variant characters, such as ``saki'', ``sai'', and ``saki'', variant character conversion is instructed multiple times.

For example, to convert "Saki" to "Saki", operate as follows. If you convert "Saki" into a variant character, it becomes "Sai". This is not the desired candidate, so if you convert it further, it will become ``碕''.
, and the operation ends here.

[Problem to be solved by the invention] However, because variant characters originally have very similar fonts, they have the characteristic of being difficult to distinguish from each other. It was necessary to check very carefully whether this was the case, and there was a drawback that there was a possibility of selecting a different variant character by mistake.

[Means for solving the problem (and action)] The present invention has the following features:
When performing variant glyph conversion and displaying conversion candidates, the variant glyph candidates are displayed larger than normal characters so that the operator can better discern the differences between each variant glyph.
This is to prevent the wrong variant characters from being selected.

[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, logical judgments, etc. for character processing, and uses an address bus AB, a control bus CB, and a data bus D.
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 fixed memory only for reading, and the 8th
Microprocessor CPU to be described later with reference to FIGS.
(.

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 in which text data being input and edited is stored. ILIST is a list of variant characters, which extracts variant character candidates needed during variant character conversion from the variant character dictionary IDIC and temporarily stores them. GAREA is a non-standard character area that stores patterns of non-standard characters that do not exist in CG in association with character codes.

KB is a keyboard with character words such as alphabet key, hirakana key, katakana key, etc.
It is equipped with various function keys for instructing various functions to the character processing device, such as a variant character conversion key, a previous screen key, and a next screen key.

DISK is document data, non-standard character file GFILE
This is an external storage unit for storing information such as.

The document created on the text buffer TBUF is stored in this external storage. The stored data can be recalled when necessary using keyboard instructions. Additionally, a non-standard character file GFILE is stored. GF I when non-standard characters that do not exist in CG appear in the document.
Character patterns are read from LE and processed.

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. Any pattern can be displayed by writing a dot pattern to DBUF. Text buffer T when displaying text contents
A display pattern is created in the DBUF according to the contents of the BUF, and is displayed.

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. Usually non-writable, standard characters,
For example, only the first and second level character patterns of the JIS X 020B code are stored. JIS X 020
Patterns for characters other than the first and second level g codes are stored in non-standard character files.

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 input from the keyboard KB is supplied, an interwoven signal is first sent to the microprocessor CP.
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 variant character conversion by the apparatus of the present invention.

2-1 is a diagram showing a normal document editing screen. In the document are ``6saki'', ``6saki'', ``kenmochi'', ``kenmochi'', and ``nano''.
"Meter reading" has been entered. Here, we want to convert the first "Kenmochi" to "Kenmochi", so the cursor should be "on Kenmochi".

2-2 is a screen with the variant character conversion key pressed.

A list of possible variant characters for ``sword'' is displayed in the window. Unlike regular characters, variant characters are displayed in a large size, so you can see the subtle differences in the font, and there is less chance of incorrect selection.

- Since the desired variant character candidate did not exist on the second screen, pressing the next screen key brings up screen 2-3, where a list of the next variant character candidates is displayed.

Since there is a variant character ``匍'' that you want on this screen, if you press the number ``1'' that corresponds to it, ``sword'' will be replaced with ``sword'' in the document, and the variant character display window will disappear.

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

A text buffer consists of a sequence of characters, each character consisting of 2 bytes. The character code is JIS X a
Use a code that complies with the 2as code.

JIS X 0208: I-do 1st level, JIS X
0208: Character codes of characters not included in the second level of the L-code utilize spaces in the JIS X 0208 code. For example, set the 16-bit code (7) MSB to 1, and set the JI
S X 0208r-to,! l: Decide so that they do not overlap.

FIG. 4 is a diagram showing the structure of the variant character dictionary IDIC.

Kanji codes and variant character numbers are stored in association with each other. The variant character number indicates to which group the variant character belongs. For example, “KenJ rfillJ rQJ
ra'rtJIJ rEJ belong to the same variant character group, so they are given the same variant number rloOJ. Since "shima", "shima", and "嶌" also belong to the same variant character group, they are given the same variant character number rl 01J.

FIG. 5 is a diagram showing the structure of the variant character list ILIST.

The variant character list is used when converting variant characters.
This table is created by extracting necessary variant characters from the DIC, and a list of variant characters is displayed and selection operations are performed based on this table.

The number of variant characters is the number of variant characters stored in this list.

For example, if the number of variant characters is n, variant characters 1 to n are stored from the next.

For example, while displaying the list of variant characters for "ken", "ken" r611
``4r ken'', ``劃'', ``薊'', and ``strong'' are stored in the variant character list.

FIG. 6 is a diagram showing the configuration of the non-standard character area GAREA.

The character patterns stored in the CG are only characters used for boat fishing, for example, characters written in JIS X 020g code. For other non-standard characters, for example, characters outside the JIS

The "number of registrations" stores the number of characters registered in GAREA.

Starting from the part following the "number of registrations", registered characters are stored in a fixed length for the "number of registrations".

For each registered character i, a character code and a necessary pattern are stored.

GAREA is arranged on RAM to enable high-speed processing.

FIG. 7 is a diagram showing the structure of the non-standard character file GF I LE.

GF I LE stores all character patterns of characters that are not stored in CG. Its contents are read as needed, and only the required character patterns are included in the GAR.
Transferred and registered during EA.

7-1 shows the overall configuration of GF ILE.

The "index section" is an index section for accessing GF I LE, and by reading the contents, it is possible to know which record contains the character pattern of the required character. In the "record" following the "index section", character patterns are stored consecutively in a fixed length. Within a record, consecutive character code patterns are stored consecutively.

7-2 shows the structure of the index section. In the index section, character codes are stored consecutively in ascending order from the beginning. i from the beginning
The th character code means the first character code of the record number. Therefore, by checking which character code in the index part the target character code is between, the number of the record in which the target character code is stored can be found. Once the record number is known, the desired character pattern can be obtained by accessing that record.

The operation of the above-described embodiment will be explained according to the flowchart shown in FIG. 8 and subsequent figures.

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 variant character conversion key, the process branches to step 8-3, and in step 8-3, variant character conversion processing is performed as detailed in FIG. 9.

For other keys, branch to step 8-4, insert,
Other processing performed in normal character processing devices, such as deletion, is performed.

When the processing of each key is completed, the process branches to step 8-1.

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

In step 9-1, the character located on the cursor is fetched from the text buffer TBUF.

In step 9-2, a list of alternative glyph candidates is displayed as detailed in FIG. When the next variant candidate is finally determined, the process proceeds to the next step.

In step 9-3, if the determined variant character candidate is a non-standard character, it is registered in the non-standard character area GAREA.

In step 9-4, processing is performed to replace the determined variant character candidate with the original character on the text buffer TBUF.

FIG. 10 is a detailed flowchart of step 9-2, ``displaying a list of variant characters''.

In step 10-1, the variant character dictionary IDIC is searched according to the specified character.

In step 1O-2, a list of variant characters ILIST is created based on the search results.

In step 10-3, if the variant character list rLI
If non-standard characters exist on sT, for example, characters outside the JIS X0208 code, the non-standard character file GFI
Access LE and extract the required character pattern.

In step 10-4, a window for displaying a list of alternative glyph candidates is opened.

In step 10-5, the font size is set to lowercase.

In step 10-6, the candidate numbers that are clearly displayed in the list of variant character candidates are displayed. Since the next size at this time is in lowercase letters, the candidate number will be displayed in lowercase letters.

In step 10-7, the font size is set to uppercase. As a result, subsequent variant character candidates will be displayed in uppercase.

In step 10-8, a loop variable i is initialized to O.

In step 10-9, three characters from the (i+1)th variant character existing in the ILIST are displayed. When displaying characters, if they are standard characters (characters existing in CG), the character code is specified and displayed. If it is a non-standard character (a character that does not exist in the CG), step 10-
The character pattern obtained in step 3 will be specified and displayed.

At this time, the font size is set to uppercase, so the variant characters will be displayed in uppercase.

In step 10-10, data from the keyboard is captured.

In step 10-11, the type of the captured key is determined, and the process branches to a processing routine for each key.

If it is the next screen key, the process branches to step 10-12 and 3 is added to the value of i. If the value of i obtained by adding 3 is ILI
If the number of variant characters in ST is exceeded, countability by 3 is not performed. Thereafter, the process branches to step 10-9.

If the previous screen key is pressed, branch to step 10-13 and press i.
Subtract 3 from the value. If the value of i obtained by subtracting 3 becomes negative, the subtraction of 3 is not performed. Thereafter, the process branches to step 10-9.

When the number key is pressed, it means selection of a variant character candidate, and the process branches to step to-14.

In step 10-14, the variant character viewing window is closed.

In step 10-15, the (value of pressed digits+i)th variant character in ILIST is pressed as the determined variant character, and the process returns.

FIG. 11 is a flowchart showing the processing performed when one character display is instructed.

In step 11-1, it is determined whether the character display instruction is made by specifying a code or by specifying a pattern. When specifying a pattern, the process to obtain a pattern is not necessary, so the process skips to step 11-8. When the code is specified, the process advances to step 11-2.

In step 11-2, it is determined whether the designated character is a character for which a pattern exists in the CG. If it exists in the CG, the process branches to step 11-3, and if it does not exist in the CG, the process branches to step 11-4.

In step 11-3, since the specified character pattern exists in the CG, GETL the pattern from the CG.
Branching to step 11-8.

In step 11-4, a search is made to see if the designated character pattern exists in the non-standard character area GAREA.

In step 11-5, if the pattern exists in the GA REA, the process branches to step 11-6 and the pattern is obtained.

If it does not exist, the process branches to step 11-7, and since there is no way to display it, a specific pattern is set. When the processing is completed, the process branches to step 11-8.

In step 11-8, since the character pattern has been determined through the processing up to this point, the pattern is enlarged or reduced according to the character size and is actually displayed.

[Other Embodiments] In the above description, it has been explained that the variant glyph candidates are displayed on a specific point, but other methods are also possible. For example, an embodiment may be considered in which the information is displayed on a specific monitor line. In any case, as long as the variant characters are displayed in a larger size than normal characters, the spirit of the present invention is not impaired no matter how they are displayed.

Further, although only variant characters are described as displayed, the present invention can also be applied to selecting characters that are confusing unless enlarged and displayed.

[Effects of the Invention] As is clear from the above description, according to the present invention, when variant characters are converted, variant characters are enlarged and displayed, so even if a confusing variant exists, Since the user can correctly select the variant character he/she desires without being confused, it is possible to realize a comfortable character processing device with fewer erroneous operations.

[Brief explanation of drawings]

Figure 1 is a block diagram of the overall configuration of the present invention, Figure 2 is a diagram showing an example of variant character conversion in the present invention, and Figure 3 is a diagram of the text buffer TBUF for storing sentences containing kanji and kana in the present invention. Figure 4 is a diagram showing the configuration of the variant character dictionary IDIC in the present invention. Figure 5 is a diagram showing the configuration of the variant character list ILIST created during variant character conversion in the present invention. , FIG. 6 is a diagram showing the configuration of the non-standard character area GAREA in which non-standard character patterns are stored on the memory according to the present invention, and FIG. Standard character file GF I LE
8 to 11 are flowcharts showing the operation of the character processing device according to the present invention. DISK...External storage CPU...Microprocessor ROM
... Read-only memory AM BUF LIST GA REA DIC GF I LE ... Random access memory ... Text buffer ... Variant character list ... Non-standard character area ... Variant character dictionary ... Non-standard Character file Figure 2 ↓ Variant character conversion key ↓ Next screen ↓ Auto'' Figure 3 Structure of text buffer 1m Figure 6 Structure of non-standard character area Rollo ■==■Yo] Figure 7 1) Non-standard character file Structure 2) Structure of index section Fig. 8 Fig. 10

Claims (1)

[Scope of Claims] 1. Document storage means for storing a document consisting of sentences containing kanji and kana; a variant conversion dictionary that stores variant characters to be converted to kanji; variant character conversion instructing means for instructing to convert the kanji into variant characters; variant character conversion means for converting the kanji instructed by the variant character conversion instruction means into variant character candidates while referring to the variant character dictionary; Variant character candidate display means for displaying the variant character candidates output by the variant character conversion means; and when the variant character candidate display means displays the variant characters, the variant characters are enlarged and displayed so that they are easier to identify than ordinary characters. What is claimed is: 1. A character processing device comprising: a control means for controlling a character;