JPS63261459A - Document processor - Google Patents

Abstract

PURPOSE:To convert a prenumeral and a post-numeral to 'KANJI' (Chinese character) connected to before and after a numeral by providing the post- numeral with the information of the prenumeral to be connected correspondingly to the post-numeral by using a flag as a medium. CONSTITUTION:When a 'KANA' (Japanese syllabary) character string consisting of a prenumeral, a numeral and a post-numeral is inputted, a post-numeral dictionary PSTDIC, a numeral dictionary NUMDIC and a prenumeral dictionary PRDIC in a RAM 3 are respectively retrieved. When corresponding contents are detected as the result of the retrieval, whether the detected prenumeral and post-numeral have corresponding relation or not is checked on the basis of the serial number of the prenumeral by referring a connection table with the prenumeral copied on a CONDW of the RAM 3. The connection check is decided by the state of a flag. Thus, the prenumeral and the post-numeral can be converted into 'KANJI' to be connected before and after the numeral.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a document processing device, and more particularly to a device that can efficiently output Chinese characters used in combination with numbers.

[Prior Art] Conventionally, in this type of device that converts Japanese text input in kana or Roman letters into a text containing kanji and kana, when converting into a character string consisting of a number and kanji connected before and after the number, There was a problem that homonyms were often output. In order to solve this problem, for example, (1) JP-A-55-44610 and (2) JP-A-55-9292,
1 etc. have been proposed.

(1) In JP-A No. 55-44610, if the input kana characters before and after a number are used as a prefix particle (a prefix placed before a number word) and a postfix particle (a particle word placed after a number word), , focusing on the correspondence between these classifiers,
All combinations of prefix and postfix particles that have a corresponding relationship are registered in a table, and conversion is performed by referring to this table. The idea was to make the conversion easier.

(2) In Japanese Patent Application Laid-Open No. 55-92921, numbers are entered using the number keys on a kana keyboard, and the kanji characters used in connection with the numbers are stored in separate tables. The idea was to facilitate the conversion of homophones, which had been difficult.

[Problems to be Solved by the Invention] However, the above proposal had the following problems.

(1) In JP-A-55-44810, in order to convert into a prefix particle and a postfix particle in a predetermined correspondence relationship,
A corresponding particle table in which all such combinations are registered is used. This correspondence particle table is arranged in descending order of the number of characters in the kana character string. For example, when the input character string ``Daichiji'' is input, the kana string before the number is stored in the left half of the corresponding particle table, that is, the prefix table, and the kana string after the number is stored in the right half, that is, the prefix table. Compare each with the positional particle table, and if there is a match, convert it to the corresponding kanji and output. In other words,
Since all combinations had to be checked from the beginning of the corresponding particle table, a lot of processing time was consumed in the kana-kanji conversion process.

(2) In Japanese Patent Application Laid-Open No. 55-92921, words that are often used before or after numbers, or before and after numbers are provided in separate tables. Since each of these tables is searched independently, there is a strong possibility that an output ignoring the correspondence between a prefix particle and a postfix particle may be output in the same way as a correct conversion result.

Therefore, an object of the present invention is to facilitate the conversion even when there are homophonic opposite words in kana-kanji conversion, which converts the character string to a character string consisting of a number and the kanji connected before and after the number, and to make the conversion easy. An object of the present invention is to provide a document processing device with short processing time.

[Means for Solving the Problems] To this end, in the present invention, a number word is composed of a number word, a prefix particle as a prefix connected before the number word, and a postfix particle as a particle connected after the number word. A document processing device that converts numeral phrases into kana-kanji phrases includes a numeral dictionary that stores numerals and characters corresponding to the numerals, and a prepositional numeral dictionary that stores prepositional particles and characters and numbers corresponding to the prepositional particles. , a postfix particle dictionary that stores the connection relationship between the postfix particle and the characters corresponding to the postfix particle, and the prefix particle corresponding to the postfix particle according to the state of the flag in correspondence with the number; The present invention is characterized by comprising a conversion control means for searching a number dictionary, a postfix particle dictionary, and a prefix particle dictionary, and converting the searched word dictionary, postfix particle dictionary, and prefix particle dictionary into predetermined kana-kanji phrases and outputting them based on connection relationships.

[Operation] According to the above configuration, by providing the postfix particle with information on the prefix particle that may be connected to the postfix particle using the flag, the information can be connected before and after the number particle. It becomes possible to convert to kanji.

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

FIG. 1 is a block diagram showing the configuration of an apparatus according to an embodiment of the present invention. In the illustrated configuration, 1 is a microprocessor (CPU), which performs calculations and logical judgments for character processing, and operates an address bus ^B, a control bus C
B. Controls each component connected to these buses via a data bus DB. Here, the address bus AB transfers an address signal indicating a component to be controlled by the microprocessor CPU. control bus C
B transfers and applies control signals for each component to be controlled by the microprocessor CPU. The data bus DB transfers data between each component device.

Reference numeral 2 denotes a read-only memory (ROM), which has a program area PA in which control procedures and the like by the CPU are stored. Reference numeral 3 denotes a writable random access memory (RAM) having a structure of 1 word and 16 bits, which has the following areas and is used for temporary storage of various data from the device components.

That is, TBtF is a document buffer, a memory for storing document information input from the keyboard 4, which will be described later, DIC is a dictionary for performing kana-kanji conversion, and YBU
F is a memory for storing the kana reading code input from the kana input key KANA on the keyboard 4, PRE.
DIC is the prepositional particle dictionary storage area, NUMDIC is the numeric dictionary storage area, PSTDIC is the postfix particle dictionary storage area, and C0NDW is the connection table between the reading of the postfixed particle that matches the input reading kana, the character code, and the prefixed particle. This is working memory for copying.

Reference numeral 4 denotes a keyboard for instructing various functions for the device of this example, such as character/symbol/person keys such as alphanumeric keys, flat name keys, katakana keys, conversion keys, non-conversion keys, cancel keys, cursor keys, etc. It is equipped with various function keys. On the keyboard 4, CON indicates a conversion key, and KANA indicates a part of a kana input key for inputting pronunciations of kana.

Reference numeral 5 denotes a disk memory, which stores standard documents and created documents, and these documents are called up when necessary by instructions from the keyboard.

Reference numeral 6 denotes a cursor register, the contents of which can be read and written under the control of the CPIII in response to cursor key operations. A CRT controller 9, which will be described later, displays a cursor at a predetermined position on the display 10 based on the address stored here.

7 is display buffer memory (DBVF), RAM3
The document information stored in the TBUF is stored in preparation for pattern display. 8 is a message display buffer memory (M
DBIIF) stores the message data pattern in ROMa.

9 is a CRT controller, cursor register 6;
Control is performed to display the contents stored in DBUF7 and MDBUF8 on the display IO. In addition, lO is a cathode ray tube (
This is a display device using a CRT (CRT), etc., and the dot configuration pattern and cursor display on this display device 1° are CR
A T controller 9 controls. Furthermore, 11 is a character generator (CG), which stores patterns of characters and symbols to be displayed on the display 10.

The document processing device of this example, which is composed of each of these components, operates in response to various inputs from the keyboard 4. When an input from the keyboard 4 is supplied, an interwoven signal is first sent to the CPUI. , CPIII reads out various control signals stored in the ROM 2, and performs various controls in accordance with these control signals.

FIG. 6 is a flowchart showing the operation of the document processing apparatus of this example. When this example device turns on the power, it first performs step S.
In step S1, an initialization process is performed to clear the RAM 3, DBUF 7, etc., and the process proceeds to step S2, where a key input from the keyboard 4 is awaited. If any key is input here, the process proceeds to step S3, where the input key is determined, and according to this determination, step S54 is performed.
Proceed to any step from 510 to 510.

In step S4, the character/symbol information inputted from the keyboard 4 is stored in the area for character information of the RAM 3. In step S5, a search process for kana-kanji conversion is performed. This is done by comparing the contents of the dictionary in the ROM 2 with the contents of the input document information by inputting a predetermined key, and recognizing matching character strings as a series of words. The process of handling the data is performed. In step S6, by inputting the selection key for the unusual character string as a series of words in step S5, homonyms are output one after another, and the desired character is selected and converted. do. Step S7
Then, the cursor is moved according to instructions from the cursor keys on the keyboard 4 or the like.

The contents of the cursor register 6 are updated according to the cursor movement at this time. In step S8, the document information input to the device is printed out under the control of the CPIII. Step S9 performs a process of inputting new document information into the already input document information. Step 5
10 are characters that are no longer needed among the input document information,
Processing is performed to delete information such as symbols from the RAM 37>).

In step Sll, necessary processing other than the processing from step S4 to step 510 is performed.

When the processing from step S4 to step Sll is completed, the process returns to step S2. In such a flowchart, the step directly related to the present invention is step S.
5 and S6.

Figure 2 is a schematic diagram showing the postfix particle dictionary stored in RAM3 PSTDIC&: and referred to when converting kana connected after a number word into kanji.
), a character code (KF), and a connection table with a prefix particle, which will be described later, are stored.

FIG. 3 is a schematic diagram showing a numeric dictionary stored in the NUMDIC in the RAM 3 and referred to when converting arithmetic numerals input using the numeric keys of the keyboard 4 or numerals input in pronunciation. is RAM3 PREDIG
This is a schematic diagram showing a prepositional particle dictionary that is stored in the prefix dictionary and is referred to when converting kana connected before a number word into kanji.The dictionary records the reading (YF) and character code (F).
Each prefix particle is given a consecutive number,
These correspond to the heading numbers (bit numbers) of the connection table with prefix particles in the postfix particle dictionary. Figure 5 is a connection table between postfix particles and prefix particles that match the input pronunciation, and is stored in the working memory C0ND in RAM3.
FIG. 3 is a schematic diagram showing a portion copied to W. FIG.

In the connection table in each of the above figures, "1" indicates that there is a correspondence between the classifiers, and "O" indicates that there is no relationship.

Next, the conversion process between a prefix particle and a postfix particle according to the present invention will be explained with reference to the flowchart of FIG. 7, taking as an example the case where the character string "1st time" is input.

When the kana character string "Dai! Kai J" made up of a prefix particle, a number particle, and a postfix particle is input, first, step S1
2, ``kai'' is searched in the PSTDIC postfix particle dictionary (Figure 2). Next, in step 513, it is determined whether a candidate corresponding to "kai" has been found.

Assuming that there are two candidates for "kai", "kai" and "1st floor", the process proceeds to steps 514 and 515, and in step S14, the reading (YF) and character corresponding to the postfix found in step 513 are Connection table with chord (to F) and prefix particle (part of Figure 5 C0NDIC
) is copied to C0NDW in RAM3.

On the other hand, in step 515, NUMD for the number word "1"
The number word dictionary of the IC is searched, and it is determined in step s16 whether the number word dictionary is found. If found, step 5
Proceed to step 17, PREDIC's prefix particle dictionary (Figure 4)
Search for "dai" in . And step 51
8, it is determined whether or not it has been found. If the candidate "No." is found, the process advances to step S19, and the C in RAM3 is
Referring to the connection table with prefix particles copied to 0NDW, check whether the found prefix particles and postfix particles have a corresponding relationship based on the serial number of the prefix particles, and select the correct one. Discern. In this connection check, if the connection flag is "1", the connection is determined to be correct; if the connection flag is "O", the connection is judged to be incorrect. In other words, since "th" has a serial number of 1, check the flag of the 1st bit of the connection table with the prefix particle copied to C(INI)W, and check if the connection flag is "1". If the connection flag is "0", the connection is determined to be correct; if the connection flag is "0", the connection is judged to be incorrect.

If it is determined that the connection is correct, the process proceeds to step 521, and the combination of the prefix particle, number word, and postfix particle is sent to the document buffer TBUF. According to the connection check table in Figure 5, the only connection with “1” in the first bit is “time”, so “time” is judged to be the correct connection for the prefix particle “th”. The first
You can get the output "times".

If it is determined that the connection is incorrect, the process advances to step S22, and the prefix particle dictionary is searched again from the position following the prefix particle found in the -th search.In step S23, it is determined whether the prefix particle has been found. If so, the process returns to step 519.

Step S12. Postfix particle dictionary search in step 513, step 515, numeral dictionary search in step 516, step S17. Step 518. Step S2
2. If a match is not found in each dictionary in the prefix particle search in step S23, all the prefixes are sent without conversion from the kana reading buffer (YBUF) to the document buffer (TBtIF) in step 524.

In the first embodiment, the connection relationship (correspondence) between the prefix particle and the postfix particle is divided into two states: connected or not. If a postfix particle dictionary with frequencies given to connection relationships as shown in FIG. 8 is used, items with definite connection relationships to those with a possibility of connection can be output in descending order of frequency.

For example, in response to a kana input such as "dai 1 kai", the first
In the embodiment, only "1st time" was output, but in the second embodiment, "1st time" is output as the first candidate, and then "1st floor is output as the second candidate". will be done.

FIG. 9 is a flowchart showing the process of converting a prefix particle and a postfix particle in the second embodiment of the present invention. The difference from the flowchart of the first embodiment is the processing at step 521'. In step 521', a process is performed in which a plurality of combinations whose connections are determined to be correct are rearranged based on the frequency of the connection table in the postfix particle dictionary and sent to the document buffer TBUF.

[Effects of the Invention] As is clear from the above explanation, by providing a postfix particle with information on a prefix particle that may be connected to the postfix particle using a flag, It becomes possible to convert to the kanji that connects before and after. This results in
Conversion in the presence of homophones can be easily and accurately performed, and furthermore, the processing time for such conversion can be shortened.

Therefore, it was possible to improve the operability related to kana-kanji conversion.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an apparatus according to an embodiment of the present invention, FIG. 2 is a schematic diagram showing the format of a postfix particle dictionary according to the first embodiment of the present invention, and FIG. 3 is an implementation example. A schematic diagram showing the format of the number dictionary according to the example; FIG. 4 is a schematic diagram showing the format of the prefix particle dictionary according to the embodiment; FIG. 5 is a schematic diagram showing the format of the prefix particle dictionary according to the first embodiment; FIG. A schematic diagram showing the format of a partial copy of the connection table; FIG. 6 is a flowchart showing the processing process in the device according to the embodiment; FIG. 7 is a flowchart showing the conversion process according to the first embodiment of the present invention; FIG. is a schematic diagram showing the format of the postfix particle dictionary according to the second embodiment of the present invention, and FIG. 9 is a flowchart showing the conversion process according to the second embodiment of the present invention. 1...cpu. 2...-ROM. 3...RAM. 4...Keyboard, 5...Disk memory, 6...Cursor register, 7...Display buffer memory (DBtIF), 8...
・Message display buffer memory (MDBtlF), 9.-CRT controller, 10.Display device, 11.Character generator, CB..Control bus, DB..Data bus, ^B..Address bus. Figure 2 Example of the guest's resignation Figure 2 Figure 3 Illustration of the dispute between Fugan and Kaya Figure 4 Copying the dictionary for example of a big mud Figure 2 Figure 5

Claims (1)

[Claims] 1) Converting a number clause consisting of a number word, a prepositional particle as a prefix connected before the number word, and a postfixed particle as a particle connected after the number word, into a kana-kanji phrase. The document processing device includes: a number word dictionary that stores number words and characters corresponding to the number words; a prefix particle dictionary that stores prepositional particles and characters and numbers corresponding to the prefix particles; and a postfix particle dictionary and the postfix particles. a postfix particle dictionary that stores characters corresponding to the postfix particle and the connection relation between the postfix particle and the prefix particle corresponding to the number according to the state of a flag, and when the number clause is input; A document processing device characterized by comprising: conversion control means for searching the number word dictionary, the postfix particle dictionary, and the prefix particle dictionary, converting the result to a predetermined kana-kanji phrase based on the connection relationship, and outputting the result. . 2) The document processing apparatus according to claim 1, wherein the presence or absence of a connection relationship is determined based on two states of flags corresponding to the numbers. 3) The document processing apparatus according to claim 1, wherein the frequency of the connection relationship is determined based on three or more states of flags corresponding to the numbers.