JPH0728797A - Method and device for character processing - Google Patents

Abstract

PURPOSE:To realize the KANA(Japanese syllabary)-KANJI(Chinese character) conversion input which reduces the labor of homonym candidate selection and has a high operability by storing readings of words and word information including expressions and field information correspondingly to each other to change the order of conversion candidates of KANA-KANJI conversion in accordance with field information. CONSTITUTION:When input from a keyboard KB is supplied, aN interrupt signal is sent to a microprocessor CPU, and the microprocessor CPU reads out various control signals stored in a ROM to perform various controls in accordance with these control signals. Word information for KANA-KANJI conversion are stored in a dictionary DIC. Readings of words are stored as 'reading', and expressions of words are stored in 'expression', and grammatical information of words like information of parts of speech are stored as 'grammatical information', and frequencies of words are stored as 'frequency'. Fields to which words belong and degrees of certainty of these fields are stored as 'field information'. When a word is selected, field information of the document is updated in accordance with the field, to which this word belongs, and its degree of certainty.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing apparatus and method for inputting kana characters and editing kana-kana mixed sentences by kana-kanji conversion.

[0002]

2. Description of the Related Art At present, in a character processing device such as a Japanese word processor, it is common to input kanji / kana mixed sentences using kana / kanji conversion. The biggest problem of the Kana-Kanji conversion method is the homophone. For example, read "Kiko"
There are many conversion candidates such as "climate", "mechanism", "eccentricity", "your school", etc., but it is impossible for the device to know which one the operator wants. Therefore, a general configuration is a system in which all possible candidates are displayed in a general Japanese language in a likely order, and the operator selects one from the displayed candidates.

[0003]

However, since the display order of the conversion candidates is determined based on a general viewpoint, the candidates desired by the operator are not always displayed at the top. For example, with regard to "Kikou" mentioned above, "climate" is the most natural conversion for people who enter documents that discuss geography and geology, but people who create engineering documents such as patents. For me, "mechanism" is the most natural transformation. In this way, the order of conversion candidates is usually different depending on the field in which the created document is a topic.
Of course, the word "climate" can never appear in an engineering document, but it is unlikely, and "mechanism" is the most natural first candidate in engineering documents.

However, in the conventional apparatus, the order of conversion candidates is fixed, and the conversion candidates are displayed in the same order both when inputting a document in the geographical field and when inputting a document in the engineering field. If the field information of the created document is known, more likely conversion candidates can be converted to higher ranks.

That is, the conventional device has the following problems.

First, since the order of candidates for Kana-Kanji conversion is fixed regardless of the created document, in some cases, a conversion candidate with a sense of incongruity is converted as the first candidate. It took a lot of time to choose.

Therefore, it has been considered that the order of candidates for Kana-Kanji conversion is changed according to the field information of the created document. Further, as such field information, not only what field the document belongs to, but also defining the degree of connection between the document and each of the fields as the likelihood for each field, It is considered that the likelihood is updated as the document creation progresses. However, such field information is lost when editing is completed. Therefore, when editing the document next time, or when creating / editing a document having a topic similar to that of the document, the same field information is again used. The user had to set the field information of (1) and constructed it in the process of creating a document.

The present invention has been made in view of the above problems, and an object of the present invention is to store the field information of a document in an auxiliary storage unit so that the field information can be called up as needed. (EN) Provided is a character processing device and method for changing the order of conversion candidates for Kana-Kanji conversion according to the above, thereby realizing Kana-Kanji conversion input with high operability and less trouble of selecting a homophone word candidate.

[0009]

[Means for Solving the Problems]
To achieve the above object, according to the present invention, by inputting a phonetic reading by a kana character string, to a character processing device for editing a document in which kanji and kana are mixed, input means for inputting the phonetic reading, and word reading, Dictionary means for storing word information including notation and field information in association with each other, field information storage means for storing field information of a document being edited, and reading input by the input means for the field information storage means And referring to the dictionary means, converting means for converting into notation, document storage means for storing the document edited by the notation obtained by the conversion means, and field information stored in the field information storage means. The storage device includes a storage unit for storing the auxiliary information in the auxiliary storage unit and a calling unit for calling the field information stored in the auxiliary storage unit into the field information storage unit.

According to another aspect of the present invention, in a character processing device for inputting a reading by a kana character string and editing a document in which kanji and kana are mixed, the field information stored in the auxiliary storage section is used as a field. Call to the information memory, input the reading, input the reading, refer to the dictionary and the field information memory that stores the word reading and the word information including the notation and field information in association with each other The character processing method is characterized by converting, editing the document stored in the document memory according to the notation obtained by the conversion, and saving the field information stored in the field information memory in the auxiliary storage unit.

[0011]

With this structure, the conversion unit converts the reading input from the input unit into a notation by referring to the field information storage unit and the dictionary unit, and the document edited by the obtained notation is stored in the document storage unit. Remember. The storage unit stores the field information stored in the field information storage unit in the auxiliary storage unit,
The calling unit calls the field information stored in the auxiliary storage unit to the field information storage unit.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A preferred embodiment of the present invention will be described in detail below with reference to the accompanying drawings.

<First Embodiment> FIG. 1 is a block diagram showing a first embodiment of a character processing apparatus according to the present invention. In the figure, a CPU is a microprocessor, which performs operations for character processing, logical judgments, etc., and each component connected to these buses via an address bus AB, a control bus CB, and a data bus DB. To control.

The address bus AB is a microprocessor C
An address signal for instructing a component to be controlled by the PU is transferred. The control bus CB transfers and applies a control signal of each constituent element to be controlled by the microprocessor CPU. The data bus DB transfers data between the constituent devices.

DIC is a dictionary, which is referred to when performing Kana-Kanji conversion.

The ROM is a read-only fixed memory that stores control procedures by the microprocessor CPU, which will be described later with reference to FIGS. 12 to 18, and fixed data. WTBL is an inter-field relevance table. K
DIC is a keyword dictionary.

The RAM is a writable random access memory having a structure of 16 bits per word and is used for temporary storage of various data from each constituent element. IBU
F is an input buffer for storing the conversion result of the phonetic string or the kana-kanji conversion word keyed in. DOBUF is a homophone word buffer that stores the homophone word candidates of the conversion result obtained by the kana-kanji conversion. BTBL is a field information table. TBUF is a document buffer that stores document data.

Reference numeral KB denotes a keyboard, which is a character symbol input key such as an alphabet key, a hiragana key, or a katakana key, and various types of character processing devices such as a conversion key, an execution key, a document recall key, a document storage key, and the like. It is equipped with various function keys for instructing functions.

DISK is an external storage for storing document data, which stores the document created on the document buffer, and the stored document is instructed by the keyboard to
Called when needed.

CR is a cursor register. The CPU can read and write the contents of the cursor register. The CRT controller CRTC 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 for storing data to be displayed.

The CRTC plays a role of displaying the contents stored in the cursor register CR and the buffer DBUF on the display CRT.

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

Further, CG is a character generator, which stores a pattern of characters and symbols to be displayed on the display device CRT.

The character processing device of the present invention comprising the above-described components operates in response to various inputs from the keyboard KB, and when an input from the keyboard KB is supplied, an interrupt signal is first sent. Sent to the microprocessor CPU and its microprocessor CP
U reads out various control signals stored in the ROM,
Various controls are performed in accordance with those control signals.

FIG. 2 is a diagram showing an example of field processing according to the first embodiment.

In the figure, an underline indicates a reading line during input, and a black rectangle means a cursor. Since (a) is talking about the geographic field, the field information of the document is inclined toward the geographic field in the process of Kana-Kanji conversion, and when "Kikono" is converted, it is converted to "climatic". Since (b) is talking about the engineering field, the field information of the document is inclined toward the engineering field in the process of Kana-Kanji conversion, and when "Kikono" is converted, it is converted to "Mechanical".

FIG. 3 is a diagram showing the structure of the dictionary DIC.

Word information for kana-kanji conversion is stored. The reading of the word is stored in the "reading". The “notation” stores the notation of the word. The "grammar information" stores word grammatical information such as part-of-speech information. The "frequency" stores the frequency of the word. The frequency is described within the range of 1 to 5, meaning that 5 is the most likely word. The "field information" stores the field id to which the word belongs and the certainty factor of the field. Multiple field ids can be described in one word. The field id is any of field 1 to field n.
“Geography”, “Geography”, and “Engineering” for clarity
It is described as "office work". The certainty factor takes a value in the range of 0 to 1. 1 means 100% surely a word in the field. 0 means that the word has no relation to the field. When the field is not described, it is interpreted as the confidence level 0, and the field with the confidence level 0 is not described in the dictionary. Words that do not belong to any category at all (for example, "this")
Etc.) means that there is no description of this “field information”.

When a word is selected, the field information of the document is updated according to the field to which the word belongs and its certainty factor.

FIG. 4 is a diagram showing the structure of the keyword dictionary KDIC.

The keyword dictionary is a dictionary in which reading strings specific to a field are stored, and the field of the document is updated only by inputting the reading described therein.

A reading column of keywords is stored in "reading". In the “field information”, information equivalent to that shown in the dictionary DIC (field ID and certainty factor) is stored. Multiple fields can be described in the field information.

FIG. 5 is a diagram showing the structure of the input buffer IBUF.

The input buffer IBUF stores the keystroked reading string, the conversion result obtained by converting the reading string to Kana-Kanji, and the notation of the next candidate when the next candidate display is instructed. The character string stored in the input buffer IBUF is displayed with an underline on the screen.

(A) is a diagram showing a state in which the reading string "Kikono" is input. When the conversion key is pressed here, the kana-kanji conversion is performed, and the conversion result "Mechanism" is stored as shown in (b). When the conversion key is further pressed, the next candidate “climate” is stored as shown in (c).

FIG. 6 is a diagram showing the structure of the homophone word buffer DOBUF.

When the reading string is converted into Kana-Kanji, the same-sound word information is stored in the same-sound word buffer DOBUF. When the next candidate display is instructed, the homophone word buffer DOBUF
In the input buffer I, the notation of the candidate indicated by the candidate No.
It is stored in BUF.

"Candidate No." is a variable indicating the currently displayed candidate. The “i-th candidate” stores information about the candidate displayed in the i-th rank of the kana-kanji conversion result.
The “notation” stores the notation of the conversion candidate. “Frequency” is a copy of the frequency of the independent word of the candidate (the value described in the dictionary DIC). "Field information j" is a copy of the field id and the certainty factor of the independent word from the dictionary DIC.

FIG. 7 shows the structure of the field information table BTBL.

The field information table BTBL stores the field information accumulated according to the kana-kanji conversion input of the document. For each of the fields 1 to n, the likelihood (likelihood) of the field is stored. In the figure, the field 1 is shown as "engineering field", the field 2 as "geographical field", and the field 3 as "medical field". The high likelihood of the field i means that the document is likely to belong to the field i.

FIG. 8 is a diagram showing the structure of the inter-field relation degree table WTBL.

The inter-field relevance table is a table showing relevance between fields. The value W _{ij at} the intersection of row i column j
Indicates the magnitude of the influence of the field j on the field i, and the larger the effect, the larger the value. In other words, the degree of influence of the field j on the field i means that when the word of the field j is selected, the likelihood of the field i of the document being input should be increased (the degree of association is large). It indicates whether the likelihood should be lowered (relevance is negative), or it is better not to change the likelihood of field i (relevance is 0). Intersection W _kk of row k column k
Is an effect of the field k on the field k itself and naturally has a positive value.

FIG. 9 is a diagram showing the storage format of the document information on the disc.

Document data and field information are stored in a related form on the disc. That is, field information (field information of a document existing in the memory at the time of document storage) is always stored in one document data. The field information on the disc has the same image as the field information table.

FIG. 10 shows an evaluation formula for determining the first candidate in kana-kanji conversion. The phrase likelihood is calculated as the sum of the word frequency of the converted word and the “field likelihood” of the converted word. Here, the “category likelihood” of the converted word is the product of the certainty factor of the converted word with respect to the field k ( _denoted by C _k ) and the likelihood of the field k on the field information table at that time ( _denoted by B _k ). It is determined by the maximum value of B _k × C _k .

The converted word having the largest phrase likelihood obtained as described above is converted as the first candidate, and the second and subsequent candidates are displayed in descending order of the phrase likelihood.

FIG. 11 shows a method of updating the field information table when a word is selected.

When a word is selected, the likelihood of each field in the field information table is updated as follows according to the field to which the word belongs.

First, the certainty factor ( _denoted as C _k ) of the field k of the selected word is obtained from the dictionary DIC, then the influence degree W _ki of the field k on the field i is obtained from the inter-field relevance table, and the certainty factor C _{k is obtained.} Get on. If there is no description of the field k in the field information of the selected word, the certainty factor of the field k is 0. The value obtained by this multiplication is summed from the fields 1 to n and added to the likelihood (denoted as B _i ) of the field i in the field information table. The calculation of the likelihood B _i of the field i is performed on the likelihoods of the fields 1 to n.

When the word converted by the first candidate is not selected (when a word other than the first candidate is selected),
The likelihood of the field in the field information table is updated as follows.

First, the degree of non-selection influence (described by X in the figure) that non-selection of words in the field k has on the field i is defined. Here, the degree of non-selection influence of the field i on the field i is the field i.
Is a negative value of the influence W _{ii on} the field i, i ≠ j
In this case, the degree of non-selection influence given to the field i by the field j is 0.

Next, the certainty factor ( _denoted by d _k ) of the field k of the word that has been converted by the first candidate but not selected (non-selected word) is obtained, and the non-selection influence that the field k has on the field i. Multiply by degrees. The sum of the fields 1 to n is added to the multiplied value and added to the likelihood B _i of the field i in the field information table. The likelihood calculation for the field i is performed for the likelihoods from the field 1 to the field n. As a result, the field information table is affected in the opposite direction from when the field to which the word converted by the first candidate belongs is selected.

Next, the above operation will be described with reference to a flowchart.

FIG. 12 is a flow chart for explaining the operation of fetching the key input and processing according to the first embodiment.

At step 12-1, the key data to be keyed from the keyboard is fetched.

At step 12-2, the type of the fetched key is determined and the determination result is output. Depending on the determination result, the process branches to each key processing routine.

If the key is a conversion key, step 12-3
In step 12-3, the conversion process is performed as detailed in FIG. After the conversion process is completed, in step 12-8, it is determined whether or not the conversion process is completed by hitting the execution key. If the conversion key is other than the execution key, the process loops to step 12-2 to process the key. If it is not the execute key, the process loops to step 12-1 to skip the key.

If the key is a reading key such as hiragana, the process branches to step 12-4 and the reading accumulation process described in detail in FIG. 13 is performed.

If the key is a document save key, step 12-5
And the document saving process described in detail in FIG. 17 is performed.

If the key is a document call key, step 12-6
And the document calling process described in detail in FIG. 18 is performed.

If the key is any other key, the process branches to step 12-7 to perform other processes such as insertion, deletion, symbol input, etc. which are carried out in a normal character processing apparatus.

When each process is completed, the process branches to step 12-1.

FIG. 13 shows step 12 according to the first embodiment.
4 is a flowchart illustrating in detail a "reading and accumulating process" of No. 4;

In step 13-1, the input readings are accumulated in the input buffer IBUF. In addition, the state of the reading column is displayed.

In step 13-2, the reading sequence stored in the input buffer IBUF is the keyword dictionary KDIC.
Search whether it is registered in.

In step 13-3, it is judged whether or not it is registered, and if it is not registered, the process directly returns.

If it has been registered, the process proceeds to step 13-4 to initialize the loop variable i.

In step 13-5, it is determined whether or not i exceeds the number of fields n. If not, step 13
Proceed to -6 to initialize the loop variable j.

In step 13-7, it is judged whether or not j exceeds the number of fields n, and if not, step 1
In 3-8, the field likelihood updating process shown in FIG. 11 is performed. The confidence factor c _j of the field j of the keyword obtained from the keyword dictionary is multiplied by the degree of influence W _ij of the field j obtained from the inter-field relevance table on the field i, and the field i of the field information table is added. Update the likelihood B _i of
Then, the process proceeds to step 13-9, increments the value of j, and loops to step 13-7.

If j exceeds n in step 13-7, the value of i is incremented in step 13-10.
Loop to step 13-5.

When i exceeds the number n of fields in step 13-5, the process returns.

FIG. 14 shows step 12 according to the first embodiment.
3 is a flowchart illustrating in detail a "conversion process" of No. 3;

In step 14-1, as detailed in FIG. 15, the reading string is converted into kana-kanji characters to create a homophone word buffer.

The notation of the first candidate of the homophone word buffer created in step 14-2 is set in the input buffer IBUF and displayed.

At step 14-3, the key data to be entered from the keyboard is fetched.

In step 14-4, it is determined whether the acquired key data is a conversion key. When it is not a conversion key (for example, enter key or enter next reading)
Will determine the candidate without looking at the next candidate, so branch to step 14-7. If it is the conversion key, the process proceeds to step 14-5 to perform the next candidate process, and the value of the candidate No. in the homophone word buffer is updated.

In step 14-6, the notation of the new conversion candidate in the homophone word buffer is transferred to the input buffer,
indicate. Then, it loops to step 14-3 and takes in the key input again.

In step 14-7, the field updating process is performed as detailed in FIG.

At step 14-8, the candidate being displayed is confirmed, a process of embedding it in the document data or the like is performed, and the process returns.

FIG. 15 is a flow chart for explaining in detail the "kana-kanji conversion process" of step 14-1.

In step 15-1, possible kana-kanji conversion candidates are created.

In step 15-2, the phrase likelihood corresponding to each conversion candidate is calculated as shown in FIG.

In step 15-3, the conversion candidates are sorted in the order of the phrase likelihood, and the first candidate is determined.

In step 15-4, the representation of the conversion candidates and the necessary information are registered in the homophone word buffer according to the phrase likelihood order, and the process returns.

FIG. 16 shows step 14 according to the first embodiment.
It is a flow chart explaining "field update processing" of -7 in detail.

The field updating process is a part for performing the field likelihood updating process shown in FIG.

In step 16-1, the loop variable i
Is initialized.

In step 16-2, it is judged whether or not i exceeds the number n of fields.
-3, the loop variable j is initialized.

In step 16-4, it is judged whether or not j exceeds the number n of fields, and if not, step 1
In 6-5, the field likelihood updating process is performed. The certainty factor C _j of the field j of the selected word is added with the product of the influence degree W _ij of the field j obtained from the inter-field relevance table on the field i, and the likelihood B _i of the field i in the field information table is added. To update. Then, it progresses to step 16-6, the value of j is incremented, and it loops to step 16-4.

When j exceeds n in step 16-4, the value of i is incremented in step 16-7 and the process loops to step 16-2.

When i exceeds the number n of fields in step 16-2, the process proceeds to step 16-8.

In step 16-8, the unselected word pointer is initialized to point to the first unselected word.

In step 16-9, it is judged whether or not the processing has been completed for all the non-selected words, and if it has been completed, the routine returns.

In step 16-10, the loop variable i is initialized.

In step 16-11, i is the number of fields n
It is judged whether or not it exceeds, and when it does not exceed, step 1
Proceed to 6-12 to initialize the loop variable j.

In step 16-13, j is the number of fields n.
It is determined whether or not the field is exceeded, and if it is not exceeded, the field likelihood updating process is performed in step 16-14. The certainty factor d of the field j of the non-selected word indicated by the non-selected word pointer
to _j, adding those areas j is multiplied by the non-selective effect of X _ij applied to the field i, and updates the likelihood B _i of the field i in the field information table. Then, the process proceeds to step 16-15, increments the value of j, and loops to step 16-13.

When j exceeds n in step 16-13, the value of i is incremented in step 16-16 and the process loops to step 16-11.

In step 16-11, i is the number of fields n
When it exceeds, the process proceeds to step 16-17 to step the non-selected word pointer to point to the next non-selected word. Then, it loops to step 16-9.

FIG. 17 shows step 12 according to the first embodiment.
It is a flowchart explaining in detail the "document storage process" of -5.

In step 17-1, the document data is converted into the field information of the document at that time (values in the field information table).
Create a save format in association with.

At step 17-2, a process of saving the saving format on the disk is performed.

FIG. 18 shows step 12 according to the first embodiment.
It is a flow chart which explains the "document call processing" of -6 in detail.

In step 18-1, the document data and the field information associated with the document data are retrieved from the disc. The document called by the document call is loaded on the document buffer TBUF. Therefore, the currently created document in the document buffer TBUF disappears and is replaced with new document data.

In step 18-2, the called field information is set in the field information table BTBL. Therefore, the field information accumulated up to this point disappears and is replaced with new field information.

As described above, according to the first embodiment, since the field information can be stored / recalled in association with the document data, candidate display is performed in the kana-kanji conversion when the stored document is called and re-edited. It is possible to realize a comfortable character processing device with high operability by accurately performing the sequence.

<Second Embodiment> In the above first embodiment, the field information is stored in association with the document. However, the present invention is not limited to this, and the operator can use the screens shown in FIGS.
It is also possible to realize that the field information is stored / recalled by itself without linking the field information to a specific document. The storage format of the field information on the disc at that time is shown in FIG.
The flow will be FIG. 22 instead of FIG. 12, FIG. 23 instead of FIG. 17, and FIG. 24 instead of FIG.

Along with this, the control procedure stored in the ROM of FIG. 1 is as shown in FIG. 22, FIG. 13 to FIG. 16, FIG.
It becomes what was described in 4.

FIG. 19 is a diagram showing an example of a field information storage screen according to the second embodiment.

When the save key is pressed, the screen (a) is displayed, and the file name in which the field information is to be saved can be input. The file name can be any string desired by the operator. When the file name is input in this state, the screen of (b) is displayed, and the field information can be saved by further pressing the execution key.

FIG. 20 is a diagram showing an example of a field information calling screen according to the second embodiment.

When the call key is pressed, the screen (a) is displayed, and a list of file names in which field information is stored is displayed. When the operator specifies the desired field information, the screen in (b) is displayed, and when the enter key is pressed, the field information is called. In the Kana-Kanji conversion input after the call, the called field information is used, and the display order of the candidates also follows that.

FIG. 21 is a diagram showing the storage format of the field information on the disc. It is possible to save a plurality of field information with a file name regardless of the document. For example, field information when writing a letter, field information when writing a paper, etc. can be saved as separate files. Then, for example, when starting the creation of a paper, by calling the field information of the paper in advance, the desired conversion candidates can be converted more easily than in the case of the standard Kana-Kanji conversion, and input efficiency can be improved. .

Next, the above operation will be described according to the flow.

Since the flow different from the first embodiment is only in FIGS. 22, 23 and 24, only that portion will be described.

FIG. 22 is a flow chart for explaining the operation of fetching a key input and processing according to the second embodiment. It is an alternative to FIG. 12 of the first embodiment.

In step 22-1, the key data to be keyed from the keyboard is fetched.

At step 22-2, the type of the fetched key is determined and the determination result is output. Depending on the determination result, the process branches to each key processing routine.

If the key is a conversion key, step 22-3
In step 22-3, conversion processing is performed as described in detail in FIG. After the conversion process is completed, in step 22-8, it is determined whether or not the conversion process has been completed by hitting the execution key. If the conversion key is other than the execution key, the process loops to step 22-2 to process the key.
If it is not the execute key, the process loops to step 22-1 to skip the key.

If the key is a reading key such as hiragana, the process branches to step 22-4 and the reading accumulation process detailed in FIG. 13 is performed.

If the key is the save key, the process branches to step 22-5 and the save process described in detail in FIG. 23 is performed.

If the key is the calling key, the process branches to step 22-6 and the calling process described in detail in FIG. 24 is performed.

For other keys, the process branches to step 22-7 to perform other processing such as insertion, deletion, symbol input, etc. which is carried out in a normal character processing apparatus.

When each process is completed, the process branches to step 22-1.

FIG. 23 shows step 22 according to the second embodiment.
It is a flow chart which explains the "save processing" of -5 in detail. It is an alternative to FIG. 17 of the first embodiment.

In step 23-1, the field information storage screen shown in FIG. 19 is displayed.

In step 23-2, the operator is prompted to input the file name.

At step 23-3, the key input is accepted.

In step 23-4, it is determined whether the acquired key is the execution key. If it is not the execution key, the process loops to step 23-2.

If it is the execution key, step 23-5.
Branch to and save the field information in the field information table to the disk with the specified file name.

FIG. 24 shows step 22 according to the second embodiment.
It is a flow chart explaining "call processing" of -6 in detail. It is an alternative to FIG. 18 of the first embodiment.

At step 24-1, the field information file existing on the disk is searched and the field information calling screen shown in FIG. 20 is displayed so as to list the files.

In step 24-2, a file selection process is performed which allows the operator to select a desired field information file from the list.

At step 24-3, a key input is accepted.

In step 24-4, it is determined whether the acquired key is the execution key. If it is not the execution key, the process loops to step 24-2.

If it is the execution key, the process proceeds to step 24-5 to call the designated field information file from the disk and set it in the field information table.

As described above, according to the second embodiment, the field information can be independently stored / recalled with a file name regardless of the document, so that even when a new document is created. , By calling the field information saved when a similar document was created, the conversion candidate display order of Kana-Kanji conversion can be set in an accurate order, so comfortable and easy character processing is possible. The device can be realized.

<Third Embodiment> In the third embodiment, based on the tendency that people of the same individual or organization often create documents in similar fields, the field information is associated with the user. It is to save. At this time, it is realized that the operator saves / calls the field information in association with the user on the screens shown in FIGS. 25 and 26.
The storage format of the field information on the disc at that time is shown in FIG. The flow is as shown in FIG. 22 instead of FIG. 12, as shown in FIG. 28 instead of FIG. 17, and as FIG. 29 instead of FIG. 18 for the first embodiment.

Along with this, the control procedure stored in the ROM of FIG. 1 is as shown in FIG. 22, FIG. 13 to FIG. 16, FIG.
9 is described.

FIG. 25 is a diagram showing an example of the field information storage screen according to the third embodiment.

When the save key is pressed, the screen (a) is displayed, and the user name can be input. The user name specifies the user name to which the operator belongs. For example, the user can be managed so that his / her personal name becomes the user name, or each department can have a user. Here, the explanation will be continued assuming that they are managed for each department. When the user name is input in this state, the screen of (b) is displayed, and when the enter key is further pressed, the field information is stored in association with the specified user.

FIG. 26 is a diagram showing an example of a field information calling screen according to the third embodiment.

When the call key is pressed, the screen (a) is displayed, and a list of registered user names is displayed. When the user name to which the operator belongs is designated, the screen in (b) is displayed, and when the enter key is further pressed, the field information corresponding to the designated user name is called. In the Kana-Kanji conversion input after the call, the called field information is used, and the display order of the candidates also follows that.

FIG. 27 is a diagram showing the storage format of the field information on the disc. Domain information is only 1 for each user
Only one is stored. For example, if the user is managed for each operator, the stored field information is the field information of the individual operator, and if the user is managed for each department, the stored field information is It will be field information for each department. Since user management means that documents of similar fields should be created for each user, by calling the field information by specifying the user, the words of the field unique to the user are easily converted, and the conversion rate is It can be expected to improve.

Next, the above operation will be described according to the flow.

Since the flow different from the second embodiment is only in FIGS. 28 and 29, only that portion will be described.

FIG. 28 shows the "save process" in step 22-5.
3 is a flowchart illustrating in detail. It is an alternative to FIG. 23 of the second embodiment.

At step 28-1, the field information storage screen shown in FIG. 25 is displayed.

At step 28-2, the operator is prompted to enter the user name to which he belongs.

At step 28-3, key input is accepted.

At step 28-4, it is judged whether or not the acquired key is the execution key. If it is not the execution key, the process loops to step 28-2.

If it is the execute key, step 28-5.
Then, the field information stored in the field information table is stored in the disk in association with the specified user.

FIG. 29 shows the "call processing" in step 22-6.
3 is a flowchart illustrating in detail. It is an alternative to FIG. 24 of the second embodiment.

In step 29-1, the registered users are searched, and the field call screen shown in FIG. 26 is displayed so as to list them.

In step 29-2, a file selection process is performed which allows the operator to select the user to which he / she belongs from the list-displayed users.

At step 29-3, the key input is accepted.

In step 29-4, it is determined whether the acquired key is the execution key. If it is not the execution key, the process loops to step 29-2.

If it is the execution key, the process proceeds to step 29-5 to call the field information file of the specified user from the disk and set it in the field information table.

As described above, according to the third embodiment, the field information can be stored / recalled in association with the user. Therefore, even if a new document is created, the same user will be similar. Since documents in different fields are often created, by calling the field information of the user to which the user belongs, words in the field unique to the user can be easily converted into Kana-Kanji, and a comfortable character processing device with high operability is realized. be able to.

<Fourth Embodiment> The fourth embodiment is similar to the second embodiment in that field information is stored unrelated to a document or a user. Or to specify a device. In this case, the operator saves / calls the field information on the screens shown in FIGS. The storage format of the field information on the disc at that time is shown in FIG. 32, and the flow is as compared with the first embodiment, instead of FIG. 12, FIG. 22 instead of FIG. 17, FIG. 33 instead of FIG. It becomes FIG. 34.

Along with this, the control procedure stored in the ROM of FIG. 1 is shown in FIG. 22, FIG. 13 to FIG. 16, FIG. 33, and FIG.
It becomes what was described in 4.

FIG. 30 is a diagram showing an example of the field information storage screen according to the fourth embodiment.

When the save key is pressed, the screen of (a) is displayed, and the path for saving the field information can be input.
You can specify an absolute path or a relative path as you like. When a path is input in this state, the screen shown in (b) is displayed, and when the enter key is pressed, the field information is saved in the specified path. This allows the field information to be stored in any directory on the disc. The path also includes information about the device, so depending on the path specification, FD, HD
It can also be saved and stored separately.

FIG. 31 is a diagram showing an example of the field information calling screen according to the fourth embodiment.

When the call key is pressed, the screen of (a) is displayed, and the path for calling the field information can be input. When the pass is input in this state, the screen of (b) is displayed, and when the enter key is further pressed, the field information is called. In the Kana-Kanji conversion input after the call, the called field information is used, and the display order of the candidates also follows that.

FIG. 32 is a diagram showing the storage format of the field information on the disc. It is possible to save a plurality of field information in any directory location regardless of the document or user. For example, field information when writing a letter, field information when writing a paper, etc. can be stored in different directories or different FDs. Then, for example, when starting the creation of a paper, by calling the field information of the paper in advance, the desired conversion candidates can be converted more easily than in the case of the standard Kana-Kanji conversion, and input efficiency can be improved. .

Next, the above operation will be described according to the flow.

Since the flow different from the second embodiment is only in FIGS. 33 and 34, only that portion will be described.

FIG. 33 shows the "save process" in step 22-5.
3 is a flowchart illustrating in detail. It is an alternative to FIG. 23 of the second embodiment.

In step 33-1, the field information storage screen shown in FIG. 30 is displayed.

At step 33-2, a process for allowing the operator to input a pass is performed.

At step 33-3, the key input is accepted.

In step 33-4, it is determined whether the acquired key is the execution key. If it is not the execution key, the process loops to step 33-2.

If it is the execution key, step 33-5.
Then, the field information stored in the field information table is stored in a specified directory position on the disk with a predetermined file name (for example, “.bunya”). It is also saved in the specified device according to the specified path. For example, “/ dev / rfd0 /
If ~ "is specified, it is saved in the FD.
It is possible to store and store them in the FD and HD according to the path designation.

FIG. 34 shows "call processing" in step 22-6.
3 is a flowchart illustrating in detail. It is an alternative to FIG. 24 of the second embodiment.

At step 34-1, the field information calling screen shown in FIG. 31 is displayed.

At step 34-2, a process for allowing the operator to input a pass is performed.

At step 34-3, key input is accepted.

In step 34-4, it is determined whether the acquired key is the execution key. If it is not the execution key, the process loops to step 34-2.

If it is the execution key, the process proceeds to step 34-5 to call the field information file having a predetermined file name from the designated path and set it in the field information table.

As described above, according to the fourth embodiment, the field information can be stored / recalled in any directory position or device regardless of the document or user.
Even when creating a new document, by calling the field information saved when a similar document was created, the conversion candidate display order for Kana-Kanji conversion can be set in an accurate order. Therefore, a comfortable character processing device with high operability can be realized.

[0182]

As described above, according to the present invention,
Since the field information of the created document can be saved and the saved field information can be called and used, based on this field information, the display order of the homophones for Kana-Kanji conversion is optimized, and Kana-Kanji conversion with high operability is performed. It is possible to realize a comfortable character processing device that has.

[Brief description of drawings]

FIG. 1 is a block diagram showing a first embodiment of a character processing device according to the present invention.

FIG. 2 is a diagram showing an example of field processing according to the first embodiment.

FIG. 3 is a diagram showing a configuration example of a dictionary DIC according to the first embodiment.

FIG. 4 is a diagram showing a configuration example of a keyword dictionary KDIC according to the first embodiment.

FIG. 5 is a diagram showing a configuration example of an input buffer IBUF according to the first embodiment.

FIG. 6 is a homophone word buffer DOBUF according to the first embodiment.
It is a figure showing an example of composition.

FIG. 7 is a field information table BTBL according to the first embodiment.
It is a figure showing an example of composition.

FIG. 8 is an inter-field relevance table WT according to the first embodiment.
It is a figure showing the example of composition of BL.

FIG. 9 is a diagram showing a storage format of document information on a disc according to the first embodiment.

FIG. 10 is a diagram showing an evaluation formula for determining a first candidate in kana-kanji conversion according to the first embodiment.

FIG. 11 is a diagram showing an update formula of a field information table at the time of word selection according to the first embodiment.

FIG. 12 is a flowchart illustrating an operation of capturing a key input and performing a process according to the first embodiment.

FIG. 13 is a flowchart illustrating in detail the “reading and accumulating process” in step 12-4 according to the first embodiment.

FIG. 14 is a flowchart illustrating in detail “conversion processing” in step 12-3 according to the first embodiment.

FIG. 15 is a flowchart illustrating in detail the “Kana-Kanji conversion process” of step 14-1 according to the first embodiment.

FIG. 16 is a flowchart illustrating in detail the “field updating process” of step 14-7 according to the first embodiment.

FIG. 17 is a flowchart illustrating in detail the “document saving process” of step 12-5 according to the first embodiment.

FIG. 18 is a flowchart illustrating in detail the “document calling process” of step 12-6 according to the first embodiment.

FIG. 19 is a diagram showing an example of a field information storage screen according to the second embodiment.

FIG. 20 is a diagram showing an example of a field information calling screen according to the second embodiment.

FIG. 21 is a diagram showing a storage format of field information on a disc according to the second embodiment.

FIG. 22 is a flowchart illustrating an operation of capturing a key input and performing a process according to the second embodiment.

FIG. 23 is a flowchart illustrating in detail the “storing process” of step 22-5 according to the second embodiment.

FIG. 24 is a flowchart illustrating in detail “call processing” in step 22-6 according to the second embodiment.

FIG. 25 is a diagram showing an example of a field information storage screen according to the third embodiment.

FIG. 26 is a diagram showing an example of a field information calling screen according to the third embodiment.

FIG. 27 is a diagram showing a storage format of field information on a disc according to the third embodiment.

FIG. 28 is a flowchart illustrating in detail the “save process” of step 22-5 according to the third embodiment.

FIG. 29 is a flowchart illustrating in detail "call processing" in step 22-6 according to the third embodiment.

FIG. 30 is a diagram showing an example of a field information storage screen according to the fourth embodiment.

FIG. 31 is a diagram showing an example of a field information calling screen according to the fourth embodiment.

FIG. 32 is a diagram showing a storage format of field information on a disc according to the fourth embodiment.

FIG. 33 is a flowchart illustrating in detail the “storing process” of step 22-5 according to the fourth embodiment.

FIG. 34 is a flowchart illustrating in detail "call processing" in step 22-6 according to the fourth embodiment.

[Explanation of symbols] CPU Microprocessor DIC Kana-Kanji conversion dictionary ROM Read only memory RAM Random access memory DISK External storage KB Keyboard CR Cursor register DBUF Display buffer memory CRTC CRT controller CRT display CG Character generator WTBL Inter-field relation table KDIC keyword dictionary IBUF input buffer DOBUF homophone buffer BTBL field information table TBUF document buffer

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Hitoshi Haruhi 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Inventor Shuichi Morisawa 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon (72) Inventor Hideyasu Suzuki 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Inventor Chika Kogusu 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Inventor Mariko Kishino 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Inventor Atsushi Sakakibara 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Invention Kazuyo Ikeda 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon Inc. (72) Inventor Mayumi Morita 3-30-2 Shimomaruko, Ota-ku, Tokyo Canon within Co., Ltd. (72) inventor Lisa Adachi Ota-ku, Tokyo Shimomaruko 3-chome No. 30 No. 2 Canon within Co., Ltd.

Claims (8)

[Claims] 1. A character processing device for inputting a phonetic reading by a kana character string to edit a document containing kanji and kana mixed notation, inputting means for reading the reading, word reading, and word information including notation and field information. And a dictionary means for storing the field information of the document being edited, and a reading input by the input means by referring to the field information storage means and the dictionary means. A conversion means for converting into a notation, a document storage means for storing a document edited by the notation obtained by the conversion means, and a storage means for storing the field information stored in the field information storage means in an auxiliary storage section. And a calling unit that calls the field information stored in the auxiliary storage unit to the field information storage unit. 2. A storage instruction unit for instructing to store the document stored in the document storage unit in the auxiliary storage unit, wherein the storage unit responds to the instruction from the storage instruction unit. 2. The character processing device according to claim 1, wherein the document stored in the storage unit and the field information stored in the field information storage unit are associated with each other and stored in the auxiliary storage unit. 3. A call instruction means for instructing the document storage means to call a specific document stored in the auxiliary storage section, wherein the call means responds to the instruction of the call instruction means. 3. The auxiliary storage unit calls a specified specific document to the document storage unit, and calls field information stored in association with the document to the field information storage unit. Character processor. 4. The character processing apparatus according to claim 1, wherein the storage unit stores the field information stored in the field information storage unit in the auxiliary storage unit in association with the user. 5. The storage unit saves the field information stored in the field information storage unit with a file name in the auxiliary storage unit, and the calling unit adds the specified file name to the auxiliary storage unit. The character processing device according to claim 1, wherein the field information stored is called from the auxiliary storage unit to the field information storage unit. 6. A selecting means for selecting one notation from a plurality of notations obtained for the same reading by the converting means, and a field stored in the dictionary means with respect to a word having the notation selected by the selecting means. The character processing apparatus according to claim 1, further comprising: an updating unit that updates the field information stored in the field information storage unit based on the information. 7. A specific word field information storage means for storing field information of the word in association with the reading of the specific word, and the word when the reading of the specific word is input by the input means. 2. The character processing according to claim 1, further comprising update means for updating the field information stored in the field information storage means based on the field information stored in the specific word field information storage means. apparatus. 8. In a character processing device for inputting a reading by a kana character string to edit a document in which kanji and kana are mixed, the field information stored in the auxiliary storage unit is called into the field information memory, and the reading is input, The input reading is converted into notation by referring to the dictionary and the field information memory in which word reading and word information including notation and field information are associated and stored, and the notation obtained by the conversion A character processing method, characterized in that the document stored in the document memory is edited by, and the field information stored in the field information memory is stored in an auxiliary storage unit.