JPH0452852A - Character processor - Google Patents

Abstract

PURPOSE:To easily offer a character string to be converted as a candidate by providing the character processor with a combinational information dictionary storing means constituted of respective fields and a means for converting an inputted 'KANA' (Japanese syllabary) reading string into a prescribed character string based upon the contents of the information dictionary storing means. CONSTITUTION:When field names in an example dictionary to be applied to 'KANA'/'KANJI' (Chinese character) conversion are displayed on a window display screen, an operator sets up a cursor position to a 'domestic medical field' e.g. by a cursor moving key. When the operator inputs the reading of the set contents by 'KANA' keys, displays the reading on an area for displaying the reading input of 'KANA'/'KANJI' conversion and then depresses a conversion key, 'KANA'/'KANJI' converted character string candidates are displayed. Since the cursor key is set up to the 'domestic medical field', a conversion candidate 'catch a cold' is displayed at first and other conversion candidates in the example dictionary are successively displayed. When the operator depresses a 'selection' key, the character string 'catch a cold' is inputted to a text buffer.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a character processing device for creating documents, and in particular,
The present invention relates to a character processing device having a function of converting a hiragana reading sequence into a predetermined character string.

[Prior Art] Conventionally, a character processing device having a function of converting a hiragana reading string into a predetermined character string has a dictionary for converting a hiragana reading string into a predetermined character string, and a dictionary for converting an input hiragana reading string into a character string. A character processing device has been proposed that has a function of converting a dictionary (example dictionary) for combination information into a predetermined character string.

[Problems to be Solved by the Invention] However, this conventional character processing device is not suitable for the field of document creation, and for the input hiragana reading string, a dictionary for combination information of the same character string is used. (Example Dictionary) and a dictionary for converting hiragana pronunciations into predetermined character strings have the disadvantage that the same predetermined character strings are converted in the priority order.

Therefore, there was a drawback that the character string that one wanted to convert was not easily presented as a candidate.

Furthermore, since there is also a dictionary (example dictionary) for information on combinations of character strings from different fields that is not necessary, there is a drawback that a larger amount of memory than necessary is required.

[Means for Solving the Problems (and Effects)] According to the present invention, there is provided a combination information dictionary storage means for configuring a dictionary for the combination information of the character strings for each field, and a combination information dictionary storage means for configuring a dictionary for the combination information of the character strings, and an input flat name pronunciation sequence. By providing conversion means for converting the combination information dictionary storage means configured for each field into a predetermined character string, the flat name pronunciation string can be converted into character string combination information according to the field in which the document is created. It becomes possible to convert the predetermined character strings in the priority order by using the character string, and the character string that you want to convert can be immediately presented as a candidate. And for the necessary areas,
It is only necessary to provide information on combinations of character strings (to enable efficient use of the minimum necessary memory.

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

FIG. 1 shows an example of the overall configuration of a character processing device according to 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 read-only fixed memory, and the eighth
The Kana-Kanji conversion dictionary KNCNV stores the control procedure by the microprocessor CPU and the dictionary to be referred to when performing Kana-Kanji conversion, which will be described later with reference to Figures 9 to 9.
D I C fixed data, and an example dictionary for the field of home medicine, YOREIDC 1, an example dictionary for the field of competitions and sports, YOREIDC 2, an example dictionary for the transportation field, which is applied only to the field specified during kana-kanji conversion. Store the fixed data of YOREIDC3 (.

The example dictionary YOREIDCI in the field of home medicine is a dictionary that stores heading information before particle connection, heading information after particle connection, and connectable particle information, as will be described later with reference to FIG.

The example dictionary YOREIDC2 in the field of competitions and sports, as described later in FIG. 5, includes heading information before particle connection,
This is a dictionary that stores heading information after particle connection and particle information that can be connected.

The example dictionary YOREIDC3 in the transportation field is a dictionary that stores heading information before particle connection, heading information after particle connection, and connectable particle information, as will be described later with reference to FIG.

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.

TEXT is a text buffer, which stores documents handled by this character processing device in an internal format, as will be described later in FIG.

KBBUF is a keyboard buffer for storing input reading strings.

JUNLDATA is conversion field designation data for storing field data to which the designated Kana-Kanji conversion example dictionary is applied.

YOMIBUF is a reading buffer for storing input readings for kana-kanji conversion.

KOUHOBUF is a candidate output buffer for storing candidates created as a result of the kana-kanji conversion process.

The KB is a keyboard that includes character symbol keys such as alphabet keys, hiragana keys, and katakana keys, as well as various keys for instructing various functions to this character processing device, such as conversion keys, cursor movement keys, and selection keys. It has function keys.

DISK is an external storage unit for storing document data, and stores documents created on the text buffer TEXT, 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 TEXT.

CRTC is cursor register CR and buffer DBU4
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 according to 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 is sent to the processor CPU, and the microprocessor CPU
Various control signals stored in the OM are read out, and various controls are performed in accordance with these control signals.

FIG. 2 shows the display device C of the character processing device according to the present invention.
FIG. 3 is a diagram showing a screen configuration formed on RT.

In the figure, DSP means a display screen.

TS is the text screen, and the text buffer TEXT
The content of the document stored in is displayed.

KS is an area for displaying soft keys, and is used to display necessary keys depending on the operating situation, such as a selection key, a conversion key, etc., and to allow input using keys at corresponding positions on the keyboard KB.

WDSP is a window display screen, and is an area where a selection display for specifying a field of usage to be applied to kana-kanji conversion and character string candidates created after kana-kanji conversion processing are displayed.

YS is an area that displays the reading input for kana-kanji conversion.

FIG. 3 is a diagram illustrating the transition of the screen for specifying the field of usage to be applied to kana-kanji conversion, inputting the reading, converting, displaying conversion character string candidates, and selecting a candidate.

When the character processing device becomes capable of creating a document, the field name of the example dictionary applied to the kana-kanji conversion is displayed on the window display screen WDSP, as shown in FIG. 3(a). The operator can select the field name indicated by the cursor by manually pressing the "select" key. Here, the operator moves the cursor position to "Home Medicine Field" using the cursor movement keys (Figure 3 (a)), and manually presses the "r Select" key to select "Home Medicine Field". Set in the field of the applicable example.

Next, as shown in FIG. 3(b), the operator inputs the reading using the hiragana keys, and the input reading is displayed in the area YS that displays the reading input for kana-kanji conversion.

Then, when you enter the conversion key, the window display screen W
The Kana-Kanji converted character string candidates are displayed on the DSP (Fig. 3 (C)).

In Figure 3 (a), since it is set to "Family medicine field", from the information in the example dictionary for "Family medicine field", "
The conversion candidates for ``to catch a cold'' are displayed, and the conversion candidates for ``to catch a cold'' in the example dictionary for ``competition/sports field'' are not given priority, and the remaining ``to catch a cold'' and ``to catch a cold'' are not given priority. Pull<”
"Play the wind" is displayed next.

Here, by manually pressing the "select" key, the operator inputs "catch a cold" into the text buffer TEXT (FIG. 3(d)).

FIG. 4 is a diagram illustrating the structure of the example dictionary YOREIDCI in the field of home medicine, which is configured by field and is applied only to the field designated at the time of kana-kanji conversion.

The above example dictionary is composed of heading information before particle connection, heading information after particle connection, and connectable particle information, and creates a character string to be converted, taking into account the fields to be applied during the kana-kanji conversion process. This is a dictionary for

The order in which information is stored in the example dictionary is in ascending order (ascending order) of the character code (JISXO208 code) of the heading information after particle connection.

For example, the heading information before particle connection is ``cold'', the heading information after particle connection is ``pu<'', and the connectable particle information is ``wo''.

FIG. 5 is a diagram illustrating the structure of the example dictionary YOREIDC2 in the field of competitions and sports, which is configured by field and is applied only to the fields designated at the time of kana-kanji conversion.

The above example dictionary is composed of heading information before particle connection, heading information after particle connection, and connectable particle information, and creates a character string to be converted, taking into account the fields to be applied during the kana-kanji conversion process. This is a dictionary for

The order in which information is stored in the example dictionary is in ascending order (ascending order) of the character code (JISXO208 code) of the heading information after particle connection.

For example, the heading information before particle connection is ``Kaze'', the heading information after particle connection is ``hi<'', and the connectable particle information is ``wo''.

Figure 6 shows an example dictionary for the transportation field, which is organized by field and applies only to the fields specified during kana-kanji conversion.
It is a figure explaining the structure of R'EIDC3.

The above example dictionary is composed of heading information before particle connection, heading information after particle connection, and connectable particle information, and creates a character string to be converted, taking into account the fields to be applied during the kana-kanji conversion process. This is a dictionary for

The order in which information is stored in the example dictionary is in ascending order (ascending order) of the character code (JISXO208 code) of the heading information after particle connection.

For example, the heading information before the particle connection is ``sea'', the heading information after the particle connection is ``submaru'', and the connectable particle information is ``wo''.

FIG. 7 is a diagram showing the structure of the text buffer TEXT.

Text consists of multiple lines of fixed length data. Each line of data is similarly composed of a plurality of character data. Each character data is composed of 2 bytes per character, and is stored in, for example, JISXO208 code.

Further, the position of each character is specified by the Y coordinate indicating the line and the X coordinate indicating the character position within the line. For example, the fourth character from the left in the third line from the beginning of the text has an X coordinate of 4,
Specified by Y coordinate=3.

Similarly, the current position of the cursor is also managed using the X coordinate and YFM mark.

Next, the operation of the above embodiment will be explained according to the flowcharts shown in FIGS. 8 and 9.

Figure 8 shows the process of selecting fields to which the example dictionary is applied in a limited manner in the kana-kanji conversion process, the kana-kanji conversion dictionary KNC.
By creating Kana-Kanji conversion candidates from the reading input using NVD IC and applying a limited example dictionary,
It is an overall flowchart of the process of changing the display priority order of Kana-Kanji conversion candidates and the process of editing a candidate character string selected from the created Kana-Kanji conversion candidates into TEXT.

First, in step 8-1, a column process is performed to check the field of each example dictionary existing in the ROM.

In step 8-2, in the kana-kanji conversion process, a display process is performed on the window display screen WDSP to select a field to which the example dictionary is to be applied preferentially or in a limited manner for the field searched in step 8-1. (See (a) in Figure 3) In step 8-3, the keyboard K
It waits for an input from B, and when it receives the input, it performs processing to take in the data into the keyboard buffer KBBUF. Here, if the top of the keyboard buffer KBBUF is an up/down cursor key, the process branches to step 8-4; if it is a selection key, the process branches to step 8-5; and if it is other than the up/down cursor key or selection key, Step 8- without any processing
Proceed to step 3.

In step 8-4, the cursor position on the window display screen/WDSP for selecting the field to which the example dictionary is applied is changed in accordance with input from the up and down cursor keys, and the process proceeds to step 8-3.

In step 8-5, the cursor position on the window display screen WDSP for selecting the field to which the limited application of the example dictionary is applied is regarded as the selected field, and the conversion field specification data JUN is
Performs processing to store in LDATA.

In step 8-6, the input from the keyboard KB is waited for, and when the input is received, the data is transferred to the keyboard buffer KBBU.
Perform processing to import into F. Here, if the beginning of the keyboard buffer KBBUF is a hiragana key, the process branches to step 8-7, if it is a conversion key, the process branches to step 8-9, and if it is other than a hiragana key or a conversion key, no processing is performed. Otherwise, proceed to step 8-6.

In step 8-7, the hiragana reading at the beginning of the keyboard buffer KBBUF is read and the human buffer YOMIBUF is read.
Perform the process of adding to.

In step 8-8, processing is performed to additionally display the hiragana reading at the beginning of the keyboard buffer KBBUF in the area YS for displaying the reading ability of kana-kanji conversion (see (b) in FIG. 3).

In step 8-9, as detailed in FIG. 9, from the reading input using the Kana-Kanji conversion dictionary KNCNVD IC,
By creating kana-kanji conversion candidates and applying a limited example dictionary, the display priority of the kana-kanji conversion candidates is changed, and processing is performed to output them to the candidate output buffer.

In step 8-10, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process in step 8-9 is displayed on the window display screen WDSP,
Perform processing to select candidates (see (c) in Figure 3)
.

In step 8-11, the input from the keyboard KB is waited for, and when the input is received, the data is transferred to the keyboard buffer KBB.
Perform processing to import into UF. Here, if the top of the keyboard buffer KBBUF is an up/down cursor key, the process branches to step 8-12, and if it is a selection key, step 8
-13, and if the key is anything other than the up/down cursor key or selection key, the process proceeds to step 8-11 without performing any processing.

In step 8-12, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP for selecting candidates is moved using the up and down cursor keys. In accordance with the input, the changing process is performed and the process proceeds to step 8-11.

In step 8-13, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP is moved to the selected candidate character. It is treated as a column and edited in the text buffer TEXT.

In step 8-14, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and the cursor position on the window display screen WDSP is moved to the selected candidate character. The window display screen WDSP is erased, and the selected candidate character string is displayed and edited on the text screen TS ((d) e in Fig. 3).
(see).

Figure 9 shows how Kana-Kanji conversion candidates are created using the Kana-Kanji conversion dictionary KNCNVD IC from the readings in the reading buffer - YOMIBUF, and the display priority of the Kana-Kanji conversion candidates is changed by applying a limited example dictionary. , is a flowchart of processing for outputting to a candidate output buffer.

First, in step 9-1, the manual reading buffer -YOM
Processing is performed to create conversion candidates from the kana-kanji conversion dictionary KNCNV for the readings of IBUF.

In step 9-2, it is determined whether the processing from step 9-3 onwards has been completed for all conversion candidates created in step 9-1. If the processing from step 9-3 onwards has been completed for all conversion candidates, then the process proceeds to step 9-7. If the processing from step 9-3 onwards has not been completed for all conversion candidates, then the process proceeds to step 9-3.

In step 9-3, a process is performed to extract a particle, an independent word before particle connection, and an independent word after particle connection from one candidate of the conversion candidate character string created in step 9-1. However, this is performed for unprocessed conversion candidate character strings.

In step 9-4, for the particle extracted in step 9-3, the independent word before particle connection, and the independent word after particle connection, there is a match in the field specified by conversion field specification data JUNLDATA in the example dictionary YOREIDIC. Searching is performed to find out if there is combination information that matches the heading information in ascending code order after particle connection.

In step 9-5, it is determined whether there is matching combination information in the field indicated by the conversion field specification data JUNLDATA in step 9-4, and if there is no matching combination, the process proceeds to step 9-2, and if there is a matching combination, If so, proceed to step 9-6.

In step 9-6, from step 9-3 to step 9-
For the conversion candidates processed up to 5, processing is performed to change the priority order of the conversion candidates to the highest priority display group.

In step 9-7, conversion candidates are output to the candidate output buffer in priority order.

[Other Examples] In the above explanation, if field information to which character string combination information is limited and applied during kana-kanji conversion is specified for one field, the flat name reading string can be converted to a predetermined value using character string combination information. We have explained that it is possible to convert strings into priority order.

Similarly, if you specify field information for multiple fields to which the character string combination information is limited during kana-kanji conversion, the flat name reading string will be converted into the priority order of the specified character strings using the character string combination information. Is possible.

In this case, in the flowcharts of FIGS. 8 and 9, the selection of the application fields of the example dictionary between steps 8-2 and 8-5 is changed to a method that allows for multiple fields of application, and steps from step 9-2 to This is realized by changing the matching process between the conversion candidate and the specified field data in the example dictionary to multiple fields during 9-6.

Similarly, if you specify field information that does not apply by limiting character string combination information during kana-kanji conversion,
It is possible to convert the flat name reading sequence into the priority order of predetermined character strings using character string combination information.

In this case, in the flowcharts of FIGS. 8 and 9, the selection of the applicable fields of the example dictionary between steps 8-2 and 8-5 is changed to the selection of non-applicable fields, and from step 9-2 This is achieved by changing the matching process between the conversion candidate and the designated field data in the example dictionary during step 96 to multiple fields other than the designated field.

Furthermore, in the same way, by loading the combination information of character strings of the specified minimum required fields from the external storage device to RAM, the flat name reading string can be created using the combination information of character strings, giving priority to the predetermined character strings. It is possible to convert in order.

In this case, in the flowcharts of FIGS. 8 and 9, the process of step 8-1 is omitted, and after the process of step 8-5, the combination information of character strings in the specified minimum required field is stored in the external storage. Add processing to load into RAM from step 9-2 to step 9-6, and perform matching processing between conversion candidates and specified field data in the example dictionary with respect to accessing the example dictionary. This is achieved by changing the data to data in RAM.

[Effects of the Invention] As explained above, according to the present invention, there is a dictionary storage means for character string combination information configured for each field, and a predetermined character string is stored using the dictionary storage means. The conversion means that converts it becomes possible to convert the flat name pronunciation sequence into a predetermined priority order of character strings using character string combination information, depending on the field in which the document is created, and we would like to convert it. Character strings can be immediately presented as candidates. Then, it is sufficient to provide character string combination information for the necessary fields, and the minimum necessary memory can be used efficiently.

In addition, it is now possible to convert flat name pronunciations to a specified priority order of character strings using character string combination information, limited to specified fields, and select character strings that you want to convert as candidates. It can be presented immediately as and,
All you need to do is to provide character string combination information for the necessary fields (and use the minimum amount of memory efficiently).

As described above, it is possible to realize a character processing device that has a very high kana-kanji conversion rate and uses memory efficiently, depending on the field.

[Brief explanation of the drawing]

Figure 1 is a block diagram of the overall configuration of the character processing device according to the present invention, Figure 2 is a diagram showing the screen configuration of the device of the present invention, and Figure 3 specifies the field of use applied to kana-kanji conversion in the present invention. 4 is a diagram showing the structure of the example dictionary for the field of home medicine according to the present invention; FIG. 5 is a diagram showing the structure of an example dictionary for the field of competitions and sports according to the present invention, FIG. 6 is a diagram showing the structure of an example dictionary for the transportation field according to the present invention, and FIG. 7 is a diagram showing the structure of the example dictionary for the field of transportation according to the present invention. Figures 8 and 9 showing the configuration are flowcharts showing the operation of the character processing device according to the present invention. DISK...External storage unit CPU...Microprocessor ROM...Read-only memory RAM...Random access memory KBBUF...Keyboard buffer JUNLDATA...Conversion field specification data TEXT/
...Text buffer YOMIBUF...Manual reading buffer KOUHOBU
F...Candidate output buffer KNCNVDIC...Kana-Kanji conversion dictionary YOREIDCI...Example dictionary for home medicine field YOREIDC2...Example dictionary for competition/sports field YOREIDC3...Example dictionary for transportation field

Claims (1)

[Claims] 1. An input means for inputting a hiragana reading sequence; a dictionary storage means for storing a dictionary for converting the hiragana reading sequence into a predetermined character string; and a hiragana reading sequence input by the input means. A combination information dictionary storage means for storing a dictionary of character string combination information for each field when converting into a predetermined character string; and a combination information dictionary storage means for storing a dictionary of character string combination information for each field; A character processing device, comprising: a conversion means for converting, the conversion means converting the hiragana pronunciation sequence into a predetermined character string by means of a combination information dictionary storage means configured for each of the fields.