JPH0981555A - Method and device for document processing - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make plural expressions correspond to the same reading to collectively register words. SOLUTION: In the case of normal word registration, 'reading', 'expression', and 'part of speech' are inputted to a word registration window 201 to register a word. In the case of collective registration that plural expressions are registered correspondingly to the same reading, a collective registration window 210 is opened besides, and plural expressions of 'yamada', 'tanaka',... corresponding to reading of 'douki' are inputted to perform collective registration. Plural expressions collectively registered in this manner can be retrieved based on the reading at the time of KANA(Japanese syllabary)-KANJI(Chinese character) conversion and can be collectively displayed as conversion candidates.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing apparatus and a method thereof, and more particularly to a document processing apparatus and a method thereof for constructing a document by referring to registered words and a word dictionary.

[0002]

2. Description of the Related Art Generally, in editing a document by a Japanese word processor, the document is input by using a kana-kanji conversion mechanism. This kana-kanji conversion mechanism, when the user inputs a reading of a desired word and instructs conversion, searches the word dictionary based on the input reading and performs conversion. Therefore, if an appropriate word does not exist in the word dictionary, the conversion by the kana-kanji conversion mechanism itself is not performed. In such a case, the user newly registers the word, and thereafter, kana-kanji conversion for the word becomes possible.

This word registration is an operation of registering a word "reading" and a "writing" in a word dictionary in association with each other. In the word registration, the "reading" and the "notation" of the word do not have to have a correspondence corresponding to the grammar, and the user can arbitrarily define this correspondence based on his or her preference and carry out the word registration. This is well known. For example, "reading" such as an idea or abbreviation that includes the meaning of the word is converted into the desired "notation".
If the words are registered in correspondence with, the number of characters of “reading” to be input can be reduced, and the efficiency of document editing can be improved.

[0004]

However, when registering words by associating short "reading" such as abbreviations with "writing", a plurality of "writing" can correspond to the same "reading". However, it is clear from experience that it is convenient to do this intentionally. For example, if you register a word with "Japanese", "American", "Chinese", etc. in correspondence with "Hito", "Yomi", for example, when entering nationality, etc. It is convenient for

As described above, when a plurality of "notations" are intentionally associated with the same "reading" for word registration, conventionally, all "notations" have to be individually registered. There was a problem that the efficiency of the work was remarkably lowered, and the work was constantly stopped.

The present invention has been made to solve the above-mentioned problems, and an object thereof is to improve the efficiency of document editing. Specifically, a plurality of notations are registered as words for the same reading. The purpose is to improve the efficiency of the work.

A secondary object is to facilitate the use of registered words.

[0008]

In order to solve the above problems, a document processing apparatus according to the present invention is a document processing apparatus for constructing a document with reference to a registered word and a word dictionary. A word having a phonetic input means for inputting a reading, a notation group input means for inputting a notation group in which a plurality of notations corresponding to a word to be registered are grouped, and a registered dictionary for holding the inputted reading and notation group in association with each other. And a registration means.

According to a preferred embodiment of the present invention, for example, the notation search means for searching the notation corresponding to the inputted character string from the registered dictionary and the word dictionary, and the retrieved notation are displayed as conversion candidates. It is desirable to further include conversion candidate display means.

Further, for example, the conversion candidate display means is
It is desirable to display the notation retrieved from the registered dictionary and the notation retrieved from the word dictionary in parallel.

The conversion candidate display means selects a predetermined number of notations from the notations retrieved from the registration dictionary,
It is desirable to have notation group selection display means for displaying in parallel with the notation retrieved from the word dictionary and notation group all display means for displaying all notations retrieved from the registered dictionary.

The document processing apparatus according to the present invention is a document processing apparatus that operates based on a program on a memory medium and constructs a document by referring to registered words and a word dictionary. , A reading input step procedure code for inputting the reading of the word to be registered, and a notation group input step procedure code for inputting a notation group in which a plurality of notations corresponding to the registered word are input, and the input reading and notation group And a procedure code of a word registration step for storing in a registration dictionary in association with each other.

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION An embodiment of the present invention will be described below with reference to the accompanying drawings.

FIG. 1 is a block diagram showing an example of the arrangement of a document processing apparatus according to this embodiment. The CPU 110
A microprocessor that performs calculations and controls for document processing, and controls each device via a CPU bus composed of a control bus (CB) 221, a data bus (DB) 222, and an address bus (AB) 223. . Here, the CB 221 is a control bus composed of a read signal, a write signal, an interrupt signal, and the like. DB22
A data bus 2 exchanges data between the CPU 110 and each device. Further, the AB 223 is the CPU 1
It is an address bus that specifies 10 control targets.

The ROM 120 is a read-only memory and provides the CPU 110 with a control program stored in, for example, a program area (PA). The control program includes an operating system and a word processing program. The document processing program will be described later.

The RAM 130 is a random access memory that functions as a work memory for the CPU 110, and has areas 131 to 141. Hereinafter, each area will be outlined.

The TBUF 131 is an area used as a document buffer for holding document data to be edited. Y
The BUF 132 is an area used as an input reading buffer that holds a character string of “reading” input from the keyboard (KB) 160.

The DIC 133 is a word dictionary to be referred to when performing Kana-Kanji conversion, and is read from the auxiliary storage unit (DISK) 150 or the like at startup, for example. GDIC
A learning data dictionary 134 stores learning data relating to kana-kanji conversion. For example, the learning data dictionary is read from the auxiliary storage unit (DISK) 150 at the start-up and is written back at the end. The TDIC 135 is a word registration dictionary that is referred to when a user arbitrarily associates "reading" with "notation" to register a word and performs kana-kanji conversion, and for example, an auxiliary storage unit (DISK) at startup. It is read from 150 etc. and written back at the end.

The KLIST 136 is an area that functions as a candidate list memory for storing word information designated at the time of dictionary search. DBPOOL is an area that functions as a homophone candidate storage memory that stores information obtained by analyzing “reading” held in the input reading buffer (YBUF) 132 and converting it into phrases. The KHBUF 138 is an area that functions as a candidate buffer that holds the conversion candidate string to be displayed when the next candidate is displayed. LRNDAT 139 is an area that functions as a learning data storage memory for storing the learning state of each word. The FZTBL 140 is an area that functions as an adjunct word conversion table for associating an adjunct word with the combined information stored in the word dictionary (DIC) 133. The OBUF 141 is an area that functions as an output buffer that temporarily stores the result of Kana-Kanji conversion.

The load area 142 depends on the embodiment.
The document processing program stored in the floppy disk of the auxiliary storage unit (DISK) 150 is loaded, and the CPU 1
10 is an area for providing the program.

The DISK 150 is an auxiliary storage unit including a hard disk, a flop disk and the like, and stores document data edited on the text buffer (TBUF) 131 and the like. The stored document data can be appropriately read into the text buffer (TBUF) 134 and used. Depending on the embodiment, the document editing program may be stored in a floppy disk, read into the load area 142, and provided to the CPU 110.

The KB 160 is a keyboard including a keyboard interface, and includes a reading input key (YOM) for inputting a "reading" including a character symbol input key such as an alphabet key, a hiragana key, and a katakana key.
I) 161, a conversion instruction key (CON) 162 for instructing to convert the input “reading”, and a next candidate display key (NXT) 16 for changing the displayed conversion candidate to the next candidate.
3, a selection key (SEL) 164 for selecting a desired conversion candidate from the displayed conversion candidate string of the same phoneme and learning the conversion candidate, and a registration key (TOR) for instructing execution of word registration 165.

The CR 160 is a cursor register that holds address information indicating the cursor position to be displayed on the CRT 200, and the CPU 110 can change the cursor position by rewriting the address information in this cursor register.

The DBUF 170 is a display buffer memory that holds data (excluding the cursor) to be displayed by the CRT 200, and the CPU 110 develops a bitmap image on the display buffer memory while referring to the character generator 210 and the like. To do.

The CRTC 190 is a cursor register (C
R) 170 and display buffer memory (DBUF) 18
0 which is a display device based on information supplied from 0
In addition to supplying an image signal to T200, a synchronizing signal or the like is supplied to control the CRT 200. The CRT 200 is an example of a display device using a cathode ray tube or the like.

The CG 210 is a character generator that generates or holds pattern data of characters and symbols displayed on the CRT 200.

In the above configuration, when the user inputs a key through the keyboard (KB) 160, the keyboard (KB) 160 issues an interrupt request to the CPU 110, and the CPU 110 receives the key input. Recognize and process documents based on it.

The operation of the document processing apparatus will be described below using a concrete example. The document processing apparatus according to the present embodiment performs word registration by associating one “reading” with a notation group, which is a set of a plurality of “notations”, and normally registers the notation group thus registered. It is possible to treat it as being in the same row as other conversion candidates registered in.

FIG. 2 is a diagram showing an example of a screen display of the CRT 200 during the word registration process (see FIG. 9) in the document processing device. In the figure, 201 is a registration key (T
OR) 165 is a word registration window opened by inputting "reading", "notation",
The word registration can be executed by inputting "part of speech". This figure shows a state in which "doki" has been input as "reading", and this input is made using the reading input key (YO
MI) 161 is input. The "notation" is input by, for example, selecting the original text designation button 204 and designating the "notation" of a desired word from the document being edited. In addition, “part of speech” is input, for example, by selecting the part-of-speech setting button 202 and selecting an appropriate part-of-speech from the part-of-speech sequence displayed by this.

A plurality of “notations” for one “reading”
When registering words in association with (notation groups), select the set registration button 203, open the set registration window 210, and enter a plurality of “notations” (notation groups). In (b) of the same figure, “Doki” is input as “reading” in the word registration window 201, and the group registration button 203 is selected to open the group registration window 210.
This is an example of inputting a group of notations with "Tanaka" as "notation".
This input is, for example, in addition to the above original text designation, a conversion key (CON) 162, a next candidate display key (NXT) 16
3, the selection key (SEL) 164 or the like may be used.

In the present embodiment, in the state shown in (b), that is, in the state where "reading" and "notation" (notation group) are input, the input is confirmed (for example, by pressing the return key or the registration key). By inputting, it is possible to register words by associating two “notations” of “Yamada” and “Tanaka” with “reading” which is “doki”. Note that this registration is made with respect to the word registration dictionary (TDIC) 135 described above.

FIG. 3 shows a word registration dictionary (TDIC) 135.
9 is a diagram showing an example in which words registered in a learning data dictionary (GDIC) 134 are displayed on a CRT 200. FIG. When registering a word, "general", "automatic", and "group" are distinguished according to the registration method. "General" means that it was registered by normal word registration ("notation" is registered for each word), "Automatic" means that it was automatically registered by learning, and "Group" means set registration. It has been registered by each. The illustrated example shows that set registration has been performed for each of the three "readings" of "fish", "douki", and "mekama".

Next, the CRT 20 when converting "reading"
Two examples of changes in the display screen of 0 will be described. First,
The first example is an example in which when the next candidate display key (NXT) 163 is used to display the next candidate, the group of registered notations is displayed in the same row (parallel) as the "notations" registered by the normal registration method. Is.

FIG. 4 shows the case where the "notation" shown in FIG. 3 is registered for "reading" which is "fish".
It is a figure which shows the change of the display of CRT200 when "fish" is converted. Note that 410 to 430 are CRTs, respectively.
On the display screen 200, arrows indicate the changes.

When "sana" is input as "reading",
A screen 410 is displayed. Then the conversion key (CO
When N) 162 is input, “fish” is displayed as the first conversion result as in the screen 420. Here, when the next candidate display key (NXT) 163 is input to instruct the display of the next candidate, the "notation" corresponding to the "reading" of "fish" is displayed in the word dictionary (DIC) 133, the learning data dictionary (GDIC ) 1
34, retrieved from the word registration dictionary (TDIC) 135,
A screen 430 is displayed. That is, the “notation” (see FIG. 3) registered as a notation group in the word registration dictionary (TDIC) 135 is the “notation” registered in the word dictionary (DIC) 133 (in the illustrated example, fish, fish, and shark). , Fish) are displayed in the same row. In this example, since "fish" is not registered in the learning data dictionary (GDIC) 134, it is natural that the contents are not displayed.

The second example is similar to the first example in that the set-registered notation group is displayed in the same row (parallel) as the "notation" registered by the normal registration method, but the notation group is displayed. This is different from the first example in that the number of displayed “notations” is limited.

FIG. 5 shows the case where the "notation" shown in FIG.
It is a figure which shows the change of the display of CRT200 when "doki" is converted. Note that the illustrated example is an example in which one candidate in the notation group that can be treated in the same manner as a normal conversion candidate sequence is set.

In FIG. 7A, 510 to 560 are
Each arrow on the display screen of the CRT 200 indicates the change. First, when "doki" is input as "reading", a screen 510 is displayed. Next, when the conversion key (CON) 162 is input, “synchronization” is displayed as the first conversion result as in the screen 520. When the next candidate display key (NXT) 163 is input to instruct the display of the next candidate, the "notation" corresponding to the notation
Word dictionary (DIC) 133, learning data dictionary (GDI
C) 134 and the word registration dictionary (TDIC) 135 are searched, and displayed as a screen 530. At this time, the "notation" registered in the set corresponding to the "reading" of "douki"
(See FIG. 3) is limited in number (1 in this example, “Yamada”).

In order to display all of the notation groups registered as a set, on the screen 530, 1 of the notations registered as a set is displayed.
One of them, “Yamada”, can be selected with the selection key (SEL) 164 (screen 540), and then the next candidate conversion key (NXT) 163 can be input again. By this operation, the set of notations registered (Yamada, Tanaka, Suzuki ...)
Is displayed as a screen 550, for example. In this state, select the desired notation from the notation group by pressing the key (SE
L) 164. For example,
When "Suzuki" is selected, a screen 560 is displayed.

FIG. 6B shows a change in the screen when "reading""doki" is input again and converted into "notation". In (b), 521 to 531 respectively indicate the display screens of the CRT 200. First, "reading"
When "doki" is input as, a screen 511 is displayed. Next, when the conversion key (CON) 162 is input, “Suzuki” is displayed as the first conversion candidate as in the screen 521 (the first conversion candidate is changed by the kana-kanji conversion shown in (a)). Here, the next candidate conversion key (NX
When T) 163 is input, a screen 531 is displayed. Hereinafter, for example, when "Suzuki" is selected, the group of registered notations (Yamada, Tanaka, Suzuki ...) Is displayed (not shown).

As described above, in the present embodiment, 1
It is possible to register (collective registration) collectively by associating a plurality of "notations" with "reading" of one word. Also, the notation group registered in a batch can be treated as a normal conversion candidate. Also, only a part of the notation group can be treated as a normal conversion candidate. Therefore, when registering multiple "notations" for the same "reading",
It is not necessary to register for each notation, and the registered “notation” can be used easily.

Hereinafter, a control example of the document processing apparatus will be described with reference to a flowchart. FIG. 6 is a flowchart showing the flow of document processing.

A step S601 waits for a key input on the keyboard 160, and the process proceeds to the next step S602 by the key input. Key input is performed by a user inputting a key on the keyboard (KB) 160, for example,
The keyboard 160 issues an interrupt request to the CPU 110, and the CPU 110 processes the interrupt request.

In step S602, the type of the input key is discriminated, and based on that, steps S603 to S6 are performed.
It branches to any one of the processes of 08.

In step S603, "reading" is input, and when the reading input key (YOMI) 161 is input, the reading code corresponding to the input "reading" is input into the input reading buffer (YBUF). Hold at 132.

In step S604, kana-kanji conversion is performed, and when the conversion key (CON) 162 is input, the kanji-kanji conversion of the character string "Yomi" held in the input reading buffer (YBUF) 132 is performed. , And outputs the conversion candidate of the homophone to the homophone candidate storage memory (DBPOOL) 137. At this time, the homophone candidate storage memory (D
The first conversion candidate in the BPOOL) 137 is output to the output buffer (OBUF) 141.

Step S605 is a process for displaying the next candidate, and when the next candidate display key (NXT) 163 is input, the same word candidate storage memory (DBPOO).
L) The homophone conversion candidates held in 137 are stored in the candidate buffer (KHBUF) 138.

Step S606 is a process for selecting "notation" from the conversion candidates based on the user's designation, and when the selection key (SEL) 164 is input, it is held in the homophone word candidate storage memory (DBPOOL) 137. One of the displayed "notation" is selected, and the character string of the selected "notation" is added to the document on the document buffer (TBUF) 131. Further, the processing for learning the correspondence between the selected "notation" and "reading" is also performed, and if the correspondence between the selected "notation" and "reading" does not exist in the word dictionary (DIC) 133, that Learning data storage memory (LRNDA
T) Register to 139.

Step S607 is the above-mentioned word registration processing. For example, when the word registration key (TOR) 165 is input, for example, the input reading buffer (YBUF).
132, the output buffer (OBUF) 141, and the contents of the part-of-speech buffer (not shown) for registering the input part-of-speech,
It is registered in the registered word dictionary (TDIC) 135 as “reading”, “notation”, and “part of speech”, respectively.

In step S608, YOMI 161 and C
ON162, NXT163, SEL164, TOR16
This is a process when a key other than 5 (for example, a key for editing a document such as a cursor movement key, a copy key, a delete key, etc.) is pressed, and a process corresponding to each input key is executed. .

Step S609 is a display process for re-forming and displaying the image of the portion to be changed as a result of the above-mentioned processes (steps S603 to S608). For example, when a new character should be added to the screen, the character pattern corresponding to the character code is generated by the character generator (CG).
It is generated at 210 and is output to an appropriate area of the display buffer (DBUF) 180.

FIG. 7 shows a kana-kanji conversion process (step S6).
It is a flowchart which shows the detailed flow of 04). In step S701, for example, the character string to be converted into kana-kanji characters, which is input after being segmented in phrase units and held in the input reading buffer (YBUF) 109, is analyzed, and candidates for kana-kanji conversion output are set as homophones. Candidate storage memory (DBP
OOL) 137. That is, the character strings are sequentially input in the unit of written data, and the reading buffer (YBUF) 10
This is a process of extracting from the word dictionary (9), searching the word dictionary (DIC) 133 for analysis, and outputting a candidate recognized as a phrase to the homophone candidate storage memory (DBPOOL) 137. This is a process generally adopted in the document processing device.

In step S702, step S701
In the homophone candidate storage memory (DBPOOL) 137
A word dictionary (DIC) 1 for the analysis results output to
It is checked whether or not there is an example pattern stored in 33, and if an example pattern is present, a homonym candidate that is the target of the example is selected as a priority candidate.

In step S703, step S702
Priority candidates selected in, learning data dictionary (GDI
C) The first candidate for kana-kanji conversion is determined from the learned candidates in 134 (which candidate is prioritized depends on the embodiment), and the output buffer (OBUF) 141, for example.
Output to

In step S704, step S703
In the candidate list memory (KLIS
T) Edit on 136. If there is a limit to the number of "notations" of the set of notations displayed in the same row as the general candidates, the number of "notations" is extracted from the notations group and the candidate list memory ( KLIST) 136
"Notation" of the conversion candidate column based on the content edited above
Are stored in the candidate buffer (KHBUF) 138.

In step S705, the output buffer (O
BUF) 141 (that is, the first conversion candidate) or the like, and a process of displaying the output of kana-kanji conversion,
This may be done based on normal technology.

FIG. 8 shows the next candidate display process (step S60).
It is a flow chart which shows the detailed flow of 5). First,
In step S801, it is determined whether or not the next candidate display process is instructed immediately after the kana-kanji conversion process (step S601). If it is immediately after, the step S80 is performed.
6, the conversion candidates are displayed based on the contents of the candidate buffer (KHBUF) 138 (see screen 530).

On the other hand, when the next candidate conversion process is instructed after a process other than the kana-kanji conversion process (for example, screen 52).
In the state of 0, 540), it is determined in step S802 whether the current candidate is a candidate in the notation group. For example, in the screen 520, the current candidate is “synchronization”, so it is not a candidate in the notation group. On the other hand, since the current candidate is “Yamada” on the screen 540, it is a candidate in the notation group.

If the result of determination in step S802 is that the current candidate is not a candidate in the notation group, step S8
03, the candidate list memory (KLIST) 136
To obtain all candidates (however, limit the number of notations in the notation group), and in step S805, store (change) the contents of all the candidates in the candidate buffer (KHBUF) 138. When the display is performed based on the content of the candidate buffer (KHBUF) 138, for example, a screen 530 is displayed (display in the notation group is limited to one “Yamada”).

On the other hand, the result of the determination in step S802 is
If the current candidate is a candidate in the notation group, the candidate list memory (KLIST) 1 in step S804.
The notation in the notation group is acquired from 36, and step S805
Then, the contents of the notation group are displayed as a candidate buffer (KHBUF) 1
38 (store) on 38. This candidate buffer (KHB
When the display is performed based on the contents of (UF) 138, for example,
It becomes like a screen 550 (displays all the notations in the notation group).

As described with reference to FIG. 4, when all the notation groups are treated in the same row as the general candidates (other than the notation group), steps S802 to S805 are unnecessary.

FIG. 9 shows a word registration process (step S60).
It is a flow chart which shows the detailed flow of 7). This word registration process is executed by inputting the registration key (TOR) 165. A step S901 waits for a key input to the keyboard 160, and the process proceeds to the next step S902 by the key input. In step S902, the type of the input key is determined, and based on that, step S90 is performed.
The process branches to any one of 3 to S909.

In step S903, the user reads the word "yomi" input by moving the cursor to the item "yomi" in the word registration window 201. Step S
In 904, the word "notation" entered by the user by moving the cursor to the "notation" section of the word registration window 201.
Take in. In step S905, a plurality of "notations" input by the user by moving the cursor to the "notations" section of the set registration window 210 are fetched.

In step S906, the "notation" is designated from the document being edited (the above-mentioned original text designation), and the designated "notation" is fetched. In step S907, the “part of speech” input by the user by moving the cursor to the “reading” section of the word registration window 201 is captured.

In step S908, a key other than an instruction to input “reading”, “notation”, “notation group”, “part of speech” or an instruction to specify an original sentence, or an instruction to register in the word registration dictionary (TDIC) 135 (for example, It is the process when the cursor key, the conversion key used for inputting the notation, etc.) is input,
The processing corresponding to each key is performed.

In step S909, when the input for the word registration is completed and the registration is instructed (for example, by the return key or the registration key), the word registration dictionary (TDI) is entered.
C) Register to 135.

Step S910 is a display process for re-forming and displaying the image of the part changed as a result of the above-mentioned processes (steps S903 to S908).

As described above, according to the present embodiment, it is possible to register a plurality of "notations" in correspondence with one word "reading", so that the registration work can be performed efficiently. You can

Further, by treating the registered notation group as a normal conversion candidate, the editing of the document can be made efficient.

By treating a part of the notation group as a normal conversion candidate, for example, it is possible to reduce the discomfort caused by the notation group being displayed even though "synchronization" is desired to be input. That is, for the user
It is ideal that only the notations that you originally want to enter are displayed as conversion candidates, and it is not preferable to enumerate other notations, especially when not intended at all, while on the other hand, As described above, since there is a benefit of treating the notation group in the same row as the normal conversion candidates, treating a part of the notation group as a normal conversion candidate has a great effect.

<Application Example 1 of Embodiment> The above embodiment is an example in which the contents of the notation group are registered in the word registration dictionary (TDIC) 135. The notation to be registered is the word dictionary (DI
C) When it exists in 133, the link information (pointer) to the information of the notation is added to the word registration dictionary (TDIC).
Registering in the 135 allows more efficient use of the memory.

For example, in step S909 described above, it is determined whether or not each of the notations to be registered exists in the word dictionary (DIC) 133, and if not, according to the above-described embodiment. The notation itself may be registered, and if it exists, the link information indicating its existing position may be registered.

<Application Example 2 of Embodiment> When a plurality of notations having the same reading are individually registered, the notations may be integrated and re-registered as the above notation group. This is, for example, a word registration dictionary (TDIC) 13
The contents of No. 5 are displayed in a list, and the user designates desired notations from the list by the above-mentioned original sentence designation method, for example, gives them new readings, and executes the above-mentioned set registration as a notation group. be able to.

The present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or an apparatus. In this case, the system or device enjoys the effects of the present invention by reading the program into the system or device from a storage medium storing a program represented by software for achieving the present invention. It becomes possible.

[0075]

As described above, according to the present invention,
It is possible to register words by associating a group of plural notations with the same reading, and it is possible to efficiently perform the word registration work.

Further, by displaying the registered notation group in parallel with the normal conversion candidates, there is an effect that the efficiency of document editing can be improved.

Further, by displaying a predetermined number of notations in the notation group in parallel with the usual conversion candidates, it is possible to prevent the display of the conversion candidates from becoming complicated.

[0078]

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration example of a document processing apparatus according to the present embodiment.

FIG. 2 is a diagram showing an example of a screen display when a word registration program of the document processing apparatus is activated.

FIG. 3 is a diagram showing an example in which words registered in a word registration dictionary and a learning data dictionary are displayed on a screen.

FIG. 4 is a diagram showing a change in screen display when “fish” is converted.

FIG. 5 is a diagram showing a change in screen display when “douki” is converted.

FIG. 6 is a flowchart showing the flow of document processing.

FIG. 7 is a flowchart showing a flow of kana-kanji conversion processing.

FIG. 8 is a flowchart showing a flow of a next candidate display process.

FIG. 9 is a flowchart showing a flow of word registration processing.

[Explanation of symbols]

 131 Document Buffer 132 Reading Input Buffer 133 Word Dictionary 134 Learning Data Dictionary 135 Word Registration Dictionary 136 Candidate List Memory 137 Homophone Candidate Storage Memory 138 Candidate Buffer 139 Learning Data Storage Memory 140 Adjunct Word Conversion Table 141 Output Buffer 150 Auxiliary Storage Unit 161 Reading input key 162 Conversion key 163 Next candidate display key 164 Selection key 165 Conversion key 170 Cursor register 180 Display buffer memory 190 CRT controller 210 Character generator

Claims (9)

[Claims] 1. A document processing apparatus for constructing a document while referring to a registered word and a word dictionary, comprising a group of a reading input means for inputting a reading of a registered word and a plurality of notations corresponding to the registered word. A document processing device comprising: a notation group input means for inputting the notation group and a word registration means having a registration dictionary for holding the input phonetic and notation groups in association with each other. 2. A notation retrieving means for retrieving a notation corresponding to the input character string from the registered dictionary and the word dictionary, and a conversion candidate display means for displaying the retrieved notation as a conversion candidate. The document processing apparatus according to claim 1, wherein the document processing apparatus is a document processing apparatus. 3. The document processing apparatus according to claim 2, wherein the conversion candidate display means displays the notation retrieved from the registered dictionary and the notation retrieved from the word dictionary in parallel. 4. The conversion candidate display means selects a predetermined number of notations from the notations retrieved from the registration dictionary and displays them in parallel with the notations retrieved from the word dictionary, and the registration. 4. The document processing apparatus according to claim 3, further comprising a notation group all-display unit that displays all notations retrieved from the dictionary. 5. A document processing apparatus which operates based on a program on a memory medium to construct a document while referring to a registered word and a word dictionary, wherein the memory medium inputs readings of the word to be registered. Input the procedure code of the reading input process and the notation group that inputs a plurality of notations corresponding to the words to be registered as a group, and store the input code and the entered notation group in the registered dictionary in association with each other. A document processing device comprising: a procedure code of a word registration process; 6. A document processing method for constructing a document while referring to a registered word and a word dictionary, comprising a reading input step of inputting a reading of a registered word, and a group of plural notations corresponding to the registered word. A document processing method, comprising: a notation group inputting step of inputting the notation group and a word registration step of associating the inputted reading and notation group with each other and storing them in a registration dictionary. 7. A notation retrieval step of retrieving the notation corresponding to the input character string from the registered dictionary and the word dictionary, and a conversion candidate displaying step of displaying the retrieved notation as a conversion candidate. 7. The document processing method according to claim 6, wherein the document processing method is a document processing method. 8. The document processing method according to claim 7, wherein in the conversion candidate displaying step, the notation retrieved from the registered dictionary and the notation retrieved from the word dictionary are displayed in parallel. 9. The conversion candidate display step, a notation group selection display step of selecting a predetermined number of notations from the notations retrieved from the registration dictionary and displaying them in parallel with the notations retrieved from the word dictionary, the registration 9. The document processing method according to claim 8, further comprising: a notation group all-displaying step of displaying all notations retrieved from the dictionary.