JPS63250775A - Character processor - Google Patents

Abstract

PURPOSE:To make it possible to instruct the conversion of an input reading to which no conversion instruction is applied in error without inputting said reading again and to display an operating instruction as a message by providing the titled device with an input reading storing means, a non-conversion instruction erasing means, an operation display means, or the like. CONSTITUTION:An input reading code buffer YBUF is formed in a RAM to store 'KANA' (Japanese syllabary) reading codes inputted from a 'KANA' input key KANA on a keyboard KB. When a non-conversion key NCON is depressed, a reading string stored in the YBUF is outputted to a document buffer TBUF as it is. In case of canceling the non-conversion and executing conversion, a cancel key CANCEL is depressed and the CON is depressed in accordance with a displayed operation instructing message, non-conversion reading is deleted and a converted result is newly displayed. Even if non- conversion is instructed to an input reading in error, the input reading can be converted without being re-inputted, the operation instructing message can be displayed through a message display buffer MDBUF or the like and the operatability can be improved.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a character processing device having a function of converting character strings and correcting erroneous operations at that time.

[Conventional technology]

Conventionally, as a character processing device that converts character strings, the operator inputs the reading corresponding to the kanji that he or she wants to input and gives a conversion instruction, thereby converting the reading into kanji and inputting it, so-called kana-kanji conversion. A character processing device has been realized.

In character string conversion in the above-mentioned apparatus, a method is widely used in which a no-conversion instruction is issued when the input pronunciation is output as is into a document without being converted.

In such a device, if you originally intended to convert, but accidentally specify no conversion, delete the reading that was output without conversion in the document, and then re-input and convert, or output without conversion. A method has been used in which conversion is performed by specifying a range of pronunciations in a document.

[Problems to be Solved by the Invention] In the above-mentioned conventional example, it is not possible to directly give a conversion instruction for the first inputted reading, so the number of key operations is large and complicated. Furthermore, if a non-conversion instruction is given by mistake, it is not possible to efficiently recover from the erroneous operation because there is no indication of how to perform the conversion.

An object of the present invention is to eliminate the drawbacks of the above-mentioned conventional examples. That is, it is possible to issue a conversion instruction without re-inputting an input reading for which a non-conversion instruction has been made by mistake, and to provide operation instructions for this by displaying a message.

[Means for solving the problems (and operation)] In order to eliminate the problems included in the above-mentioned conventional example, in the present invention,
This problem is solved by providing the following means, and a character processing device with better operability is provided.

- That is, a means for storing the input reading, a means for canceling the no-conversion instruction when no conversion is specified, and an operation instruction display means for instructing an explanation of the next operation to be performed, If so, the conversion means converts and displays the reading inputted the -th time.

〔Example〕

Hereinafter, the present invention will be described in detail 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 each component connected to the address bus AB, control bus CB, and data bus DB via these buses. control.

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. The PA is a program area in which a control program, etc. according to a control procedure by a microprocessor CPU, which will be described later with reference to FIGS. 8 to 13, is stored.

MSDAT stores data for message display.

Further, the RAM is a writable random access memory having a structure of 1 word and 16 bits, and is used for temporary storage of various data from each component.

TBUF is a document buffer, which is a memory for storing document information input from the keyboard KB.

DIC is a dictionary for performing kana-kanji conversion.

YBUF is the oyster with kana on the keyboard KB - KANA
This is a memory for storing the kana reading code input by the user.

HYBUF is a copy buffer of YBUF that is saved when reading stored in YBUF is processed without conversion.

N0CONV is a flag register that stores whether the kana 8 sale stored in YBUF has been converted or not.

cp is a pointer indicating the current input position of document buffer TBUF.

PP is a non-conversion output position pointer that is set when the reading stored in YBUF is output to the document buffer TBUF without conversion.

KB is a keyboard that includes character symbol input keys such as alphabet keys, hiragana keys, and katakana keys, as well as various function keys for instructing various functions for this character processing device, such as conversion keys, non-conversion keys, and cancel keys. It is equipped with

In the figure, CON is a conversion key, NC0N is a no-conversion key for instructing not to convert, KANA is a character symbol for inputting readings, and CANCEL is a cancellation key for canceling no-conversion.

The DISK stores documents created in a memory for storing standard documents, 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 patterns such as document information stored in TBUF.

MDBUF is a message display buffer memory, and RO
Store the pattern of message data MSDAT in M.

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

Further, a CRT is a display device using a cathode ray tube or the like, and the display of a dot configuration pattern and a cursor on the display device CRT is controlled by a CRT controller.

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

The character IA 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 execution of the character processing device of the present invention.

(1) is a state in which the reading is input by pressing the kana key. The angline indicates that the text is currently being read and input.

If the non-conversion key is pressed in this state, the input reading will be fixed in the document as shown in (2).

If you want to cancel the non-conversion and convert, press the cancel key as shown in (3), and a message prompting you to perform the next operation will be displayed on the message display line.

When the conversion key is pressed in accordance with the message display in (4), the unconverted reading determined in (2) is deleted and a new conversion result is displayed.

FIG. 3 shows a dictionary (DIG) in the character processing device of the present invention.
FIG.

YF is a reading part, which stores the reading of a word up to 10 characters in 2 bytes per character, and stores O in the remaining area.

KF is a kanji character section, which stores the notation of a word up to 4 characters each with 2 bytes, and stores 0 in the remaining area.

GF is a grammatical information section and stores grammatical information such as the part of speech of the word.

Each word is composed of 30 bytes, and a word code for identifying the word is assigned from the beginning of the dictionary.

FIG. 4 is a diagram showing the structure of the document data buffer TBtJF.

Document data is expressed in 2 bytes per character. 0 is stored as an uninput code.

FIG. 5 is a diagram showing the configuration of the input reading code buffer YBUF.

The kana code to be output when the kana key KANA on the keyboard KB is pressed is stored in 2 bytes per character.

FIG. 6 is a diagram showing the configuration of the conversion reading code buffer HYBUF.

This is a copy buffer for YBUF, and has exactly the same configuration as YBUF.

FIG. 7 shows message display data MSDAT, in which message data for display is stored.

FIG. 8 is a flowchart showing the operation of the character processing device of the present invention.

At 58-1, a key is pressed on the keyboard KB,
Wait for an interrupt to occur.

When a key is input, the input key is determined in 38-2, and 58-3. S8. -4
, 58-5, 58-6.

58-3 is a process when the kana code KANA is input, and the input kana code is stored in YBUF.

58-4 is a process performed when the conversion key CON is input, and converts the reading string stored in YBUF into a kanji string.

(Detailed description in FIG. 9) S8-6 is a process when the non-conversion key NC0N is input, and the reading sequence stored in YBUF is output as is to the document buffer. (Detailed explanation in Figure 10) S8-5 is a process when a normal key (such as a cursor movement key) other than the kana key, conversion key, or no conversion key is input, and is common in character processing devices of the same type. This is a process that is commonly performed and is well known, so it will not be described in particular.

58-7 is a process of clearing the no-conversion flag N0CONV after the editing processes in 58-3, 58-4, and 58-5 to indicate that no conversion process was performed.

38-8 is a process of setting a no-conversion flag N0CONV to indicate that no-conversion processing has been performed.

58-9 is a display process for displaying the changed portion as a result of the above editing process. This is a commonly used process of reading one character of data in a document, developing it into a pattern, and outputting it to a display buffer DBUF.

58-10 is a process for accepting a cancellation operation after the non-conversion process, which will be described in detail with reference to FIG.

FIG. 9 is a detailed flowchart of the process 58-4.

In 59-1, the dictionary D is read according to the input reading sequence YBUF.
Search for IC.

At 59-2, it is determined whether or not a reading matching YBLJF is found as a result of the dictionary search. If found, the process branches to 59-3; if not, the process branches to 59-4.

At 59-3, the notation of the word that has been written is output to the document buffer TBUF pointed to by CP.

If the word is not found, YB in 59-4
The contents of UF are output as they are to the position pointed to by CP of document buffer TBUF.

At 59-5, the input reading buffer YBUF is cleared in preparation for the next input, and then the process returns.

FIG. 10 is a detailed flowchart of the process 58-6.

510-1, the input reading buffer YBUF is
Copy to IA reading buffer HYBUF.

In S10-2, the contents of YBUF are output to the position pointed to by CP of document buffer TBUF.

At 510-3, the input reading buffer YBUF is cleared in preparation for the next input, and then the process returns.

FIG. 11 is a detailed flowchart of the process 310-2.

5ll-1, set the value of cp as the output start position to P
Copy to P.

5ll-2, pointer C indicating the current input position
Set the output notation code to the document address indicated by P.

In 511-3, CP is incremented by the number of code sets in 5it-2, and the process returns.

FIG. 12 is a detailed flowchart of the process of S8-10.

512-11. :, it is determined whether or not the non-conversion process has been performed by referring to the non-conversion flag N0CONV. If N0CONV is 1, the processing from 512-2 onwards is performed; otherwise, the process returns immediately.

At S12-2, the next key input is awaited.

When a key is input, the input key is determined in 312-3, and if it is the cancellation key CANCEL, the processing from 512-4 onwards is performed, but if not, the process returns immediately.

At S12-4, message display data MSDA
Transfer T to message display buffer MDBUF, 51
In 2-5, MDBUF is displayed.

At 512-6, a key input is awaited after the message is displayed.

When a key is input, the input key is determined in 512-7, and if it is the conversion key CON, S
12-8 and subsequent processing is performed, but if not, immediately returns.

In S12-8, the unconverted result output to TBUF immediately before is deleted.

In S12-9, the contents of the conversion reading buffer HYBUF, which has been saved in advance, are copied to YBUF, and
2-10 converts the reading of YBUF. (Processing similar to the process explained in FIG. 9) In S12-11, the conversion reading buffer HYBUF is cleared, and in 512-12, the conversion result obtained as a result of 512-10 is displayed, and the process returns.

FIG. 13 is a detailed flowchart of the process 512-8.

513-1, the deletion start position PP and the current position CP
If they match, it returns immediately, but if not, it performs the processing from 513-2 onwards.

At 513-2, a non-input code 0 is set to the code of the document buffer TBUF indicated by C(PP).

In S13-3, the value of PP is incremented by +1.

[Other Examples]

In the explanation of the above embodiment, it is assumed that the dictionary structure is a dictionary with a fixed word length, but the same processing can be applied to a more compressed dictionary structure composed of variable length words. be able to.

In addition, when dividing the conversion result into constituent words, only a single dictionary was searched in the example, but a prefix dictionary,
It is also possible to use the results of searching multiple dictionaries including suffix dictionaries.

Furthermore, although a cancel key, which is different from the no-conversion key, is used immediately after specifying no-conversion, a conversion key may also be used.

[Description of Effects] As is clear from the above description, according to the present invention, when a conversion operation and a non-conversion operation are mistakenly performed, the operation is canceled and the next operation is performed to recover from the error. By giving instructions to a person, it is possible to provide a character processing device that is simple and has excellent operability.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of the overall configuration of the present invention. FIG. 2 is a diagram showing an example of implementation of the present invention. FIG. 3 is a diagram showing an example of the dictionary structure of the present invention. FIG. 4 is a diagram showing an example of document data of the present invention. FIG. 5 is a diagram showing an example of the input reading buffer of the present invention. FIG. 6 is a diagram showing an example of the conversion reading buffer of the present invention. FIG. 7 is a diagram showing an example of message data of the present invention. 8 to 13 are flowcharts showing the operation of the character processing device of the present invention. Two S ↑ ;
5. -ノ
～No -No School Figure 3 DIC Figure 8 Figure 9 Figure 10 Figure 11

Claims (1)

[Claims] In a character processing device capable of converting a first character string into a second character string corresponding to the first character string, an input means for inputting the first character string; a dictionary stored in correspondence with the columns, a non-conversion means for leaving the first character string input by the input means without converting it, and storing a reading that is not converted. a reading storage means, a cancellation means for instructing to cancel the non-conversion means, an operation display means for instructing to display the next executable operation, and a reading stored by the reading storage means;
a conversion means for searching the dictionary and converting it into a second character string; and an output means for outputting the second character string obtained by the conversion means and the first character string obtained by the non-conversion means, A character processing device comprising: