JP3524189B2 - Character processor - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing device for outputting a kanji / kana mixed sentence by kana / kanji conversion.

[0002]

2. Description of the Related Art Kana-Kanji conversion is to convert an input reading string into Kanji by referring to various dictionaries. In the independent word dictionary, part-of-speech information such as nouns, sahen nouns, adverbs, verbs, adjectives, and adjective verbs is described for each word.In the adjunct dictionary, grammatical information about the adjunct is described. There is. In addition, there is a concatenation judgment table that describes whether or not adjunct words can be connected or independent words and adjunct words can be connected.
While referring to various dictionaries and tables, the input reading string is converted into kanji.

[0003] For example, in response to the input "Shiro ni to ga ga", "city""white""castle""white""castle""whiteto""castleto""white""Tono","To the castle", "To the white", "To the castle", "Furnace", "Dew", "In the furnace" ..., "Second"
"Similar", "Package", "Boiled", "Nito" ..., "Miyako", "House", "Miyanono"
As a result of creating phrase candidates such as "don", "tono", "tono", "don", "is", "is", "necessary", "roasting", etc. The combination with the smallest number is prioritized, and the conversion result composed of two phrases such as "White / Toga / Iru" and "Castle / Toga / Iru" is given priority, The conversion result is 3
Since it is composed of clauses, it was not output as the first candidate.

[0004]

However, in the above example, "white nito no ga" and "castle ni to no ga" were originally used.
There is a problem that such clauses are generated.

Conventionally, in general, noun + "ni", "ni" +
It is defined that “to”, “to” + “no”, and “no” + “ga” can be respectively connected. "To white""Tome"
Considering the phrases "with him" and "with her", it is certainly correct to be able to connect each. However, with this method, noun + "ni" + "to" +
“No”, moreover, noun + “ni” + “to” + “no” +
"Ga" can be connected.

[0006] In short, in the past, with respect to the connection relation of three or more words, the definition that prohibits the connection is not made, and it is impossible to prohibit the connection, and a meaningless clause is generated. .

(Problem 1) Therefore, the present invention solves the above-mentioned conventional problem, describes the concatenation relationship of adjunct words as an adjunct word string, stores the adjunct word string in an adjunct dictionary, and stores adjunct words between adjunct words. By not using the connection determination table,
It is an object of the present invention to provide a kana-kanji conversion that does not generate meaningless attached word strings and meaningless clauses.

(Problem 2) Further, according to the present invention, as in the case of (Problem 1), in which an adjunct word string is stored in an adjunct dictionary, a phrase composed of an adjunct word and an independent word is connected,
By storing in the adjunct word dictionary as one adjunct, the adjunct to be converted into kana-kanji is preferentially stored.

(Problem 3) Further, according to the present invention, in (Problem 1) and (Problem 2), by adding priority information to an adjunct word string or a phrase stored in an adjunct dictionary, it is used as an adjunct word string. It is an object of the present invention to provide a highly accurate kana-kanji conversion that takes into account the frequency of occurrences and the frequency of wording.

[0010]

In order to solve the above-mentioned problems, the character processing device of the present invention has an input means for inputting a kana character string, word reading, and grammatical information such as notation and part-of-speech. And a word dictionary means that stores in association with each other, and an adjunct dictionary means that stores an accessory word such as a particle or auxiliary verb in association with its reading, display, and grammatical information, and a kana character input by the input means. A kana-kanji conversion means for converting a string into a corresponding notation by referring to the word dictionary means and the auxiliary dictionary means, and using the auxiliary dictionary means together with a single auxiliary word A possible adjunct word string is stored as one adjunct, and the adjuncts are not connected in the conversion by the kana-kanji conversion means.

Further, according to the present invention, in the above character processing device, the adjunct dictionary means is provided with an adjunct word and an adjunct word string, and a phrase formed by concatenating an adjunct word and an independent word as one adjunct part. It is characterized by storing.

Further, the present invention is characterized in that, in the character processing device described above, priority information is stored in association with each of the attached parts stored in the attached part dictionary means.

[0013]

In the present invention, meaningless adjunct word strings are generated by storing adjunct word strings that can be connected to the adjunct part dictionary means as one adjunct part and making the adjunct parts non-adjoining. Can be prevented.

Further, according to the present invention, the appendix dictionary means includes:
By storing a phrase composed of a concatenation of an adjunct and an independent word as one adjunct part, the phrase is preferentially converted.

Further, according to the present invention, in the above-mentioned structure, the attached word string or the phrase stored in the attached dictionary means is
By adding and storing priority information, a high priority auxiliary word sequence or a wording is preferentially converted.

[0016]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing an example of the overall configuration of the present invention.

In the configuration shown in the figure, the CPU is a microprocessor, which performs arithmetic operations for character processing, logical judgments, etc., an address bus AB, a control bus CB,
The respective components connected to those buses are controlled via the data bus DB.

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 respective constituent devices.

The ROM is a read-only fixed memory. PA provided in the ROM is a program area in which the procedure of control by the microprocessor CPU described later with reference to FIGS. 8 to 11 is stored.

The RAM is a writable random access memory having a structure of 16 bits per word,
Used for temporary storage of various data from each component. RA
M includes JDIC, FDIC, CTBL, and
IBUF, OBUF, and BTBL are stored.

JDIC is a self-supporting part dictionary, which stores a self-supporting part for kana-kanji conversion, and details will be described later with reference to FIG.

The FDIC is an adjunct dictionary, which stores an adjunct for kana-kanji conversion, the details of which will be described later with reference to FIG.

CTBL is a connection determination table, which stores information on whether or not the self-supporting part and the auxiliary part are connected, and details thereof will be described later with reference to FIG.

IBUF is an input buffer, which is an input buffer for storing key data input by a key, and details will be described later with reference to FIG.

OBUF is an output buffer, which is a buffer for temporarily storing the result of Kana-Kanji conversion, and details will be described later with reference to FIG.

BTBL is a phrase candidate table, which is a buffer used at the stage of converting the inputted kana character string into kana-kanji characters and determining the output, and stores the intermediate result of kana-kanji conversion. Details will be described later with reference to FIGS. 6 and 7.

The KB is a keyboard, which is provided with a character / symbol input key such as an alphabet key, a hiragana key, a katakana key, a cursor movement key for instructing cursor movement, and various function keys.

DISK is an external memory for storing document data and the like. Document data and the like are stored as needed, and the stored data is recalled when necessary by an instruction from the keyboard.

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 a pattern of data to be displayed.

The CRTC is a CRT controller, and has 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 apparatus 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 shows the independent dictionary JDIC according to the present invention.
It is a figure which shows the structure of the independent part dictionary data stored in.

It is composed of reading, notation, part of speech, and priority fields.

The word reading is stored in the reading, the word notation is stored in the notation, and the part of speech of the word is stored in the part of speech. The priority is a degree of preferential use of the word, which is given in consideration of frequency information and the like. Priority = 5 means that normal priority is given, and if it is 5 or higher, it has higher priority than normal, and if it is lower than 5, it means that it has no priority over normal words.

FIG. 3 shows the accessory dictionary FDIC according to the present invention.
It is a figure which shows the structure of the auxiliary part dictionary data stored in.

It consists of reading, notation, grammar information, and priority fields.

The reading of the attached part is stored in the reading, and the notation of the attached part is stored in the notation. The grammatical information stores the grammatical information of the attached part, which is linked to the connection determination table described later.
The priority is a degree of preferential use of the attached word, which is given in consideration of frequency information and the like. Priority = 5
Means that it is normally prioritized, that if it is 5 or more, it has higher priority than ordinary, and if it is less than 5, it does not have priority over ordinary adjuncts.

FIG. 4 is a connection determination table C according to the present invention.
It is a figure which shows the structure of TBL. It has a table structure centered on the part of speech and the grammatical information of the appendix. The numbers in the table are the connection strengths, and indicate the connection strengths. 5 is a normal joint strength, and when it is larger than 5, it is a strong joint, and when it is smaller than 5, it is a weak joint. Further, the connection strength of 0 means that the connection is not made. For example, "noun" and "particle-to"
Since the connection strength is 5, the connection strength is normal. Also,
“Verb ending form” and “auxiliary verb-is” do not connect because the connection strength is 0. In other words, a phrase such as "verb final form" + "auxiliary verb-is" does not hold.

FIG. 5 shows the structure of the input / output buffer.
(A) is a diagram showing a configuration of an input buffer IBUF, and (b) is a diagram showing a configuration of an output buffer OBUF. IBUF, OBUF
Both have the same configuration. The first 2 bytes are size information of each buffer, and the number of characters stored in the buffer is stored. Each character consists of 2 bytes per character,
It is stored as a JIS X0208 code or the like.

FIG. 6 is a diagram showing the structure of the phrase candidate table BTBL. The BTBL stores an intermediate result of kana-kanji conversion, performs morphological analysis on the kana character string stored in the input buffer, and stores all possible analysis patterns. BTBL has a tree structure,
The clause shall be stored in the node. The clauses of the same form may be stored together in one node. In the example, it is the result of analyzing "Shiro ni Tono ga Iru", including "Castle Nito / No ga / Iru" and "White / boiled / Miyakono ga / I need"
There are many analysis patterns such as.

Similar to FIG. 6, FIG. 7 shows the phrase candidate table B.
It is a figure showing composition of TBL. In this example, the character string stored in the input buffer is “Mito to Tamotsu”.

The operation of the procedure stored in the program area PA of the above embodiment will be described according to the flow.

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

Step 8-1 is a process for performing various initial settings of the character processing device of the present invention, which is a process generally performed in a character processing device of the same type. When the processing is completed, the process proceeds to step 8-2.

Step 8-2 is a process for fetching data from the keyboard.

In step 8-3, the type of the fetched key is judged, and the process branches to each key processing routine.

When the reading key is input, step 8-4
Branch to.

When the conversion key is input, step 8-5
And the conversion process described later with reference to FIG. 9 is performed.

When any other key is input, the process branches to step 8-6 to perform other processes such as character input, cursor movement, insertion, deletion, etc. which are carried out in a normal character processing apparatus. These processes are processes that are generally performed in the same type of character processing device and are well known, and therefore will not be described.

Step 8-4 is a reading input process,
This is a process of storing a character in the input buffer IBUF when a key for reading kana-kanji conversion is input.

When the processing of step 8-4, step 8-5, and step 8-6 is completed, the process proceeds to step 8-2 and waits for key input again.

FIG. 9 is a detailed flowchart of the "conversion process" in step 8-5.

Step 9-1 is a phrase candidate table creating process, which creates the phrase candidate table BTBL as shown in FIG. 6 or 7 based on the reading stored in the input buffer IBUF. Details of the creation process will be described with reference to FIG.

Step 9-2 is the first candidate determination process, which selects the candidate to be converted with the highest priority from the analysis results stored in the phrase candidate table BTBL as shown in FIG. 6 or 7. decide. Although various methods are conceivable as the determination method, here, it is assumed that the minimum clause number method, the priority of the independent word, and the priority of the attached part are combined. In the case of FIG. 6, first, the candidates are selected so as to minimize the number of phrases. Then, "{to the castle, to the white} + {field} + {is there, I need it}" composed of 3 phrases,
"{To the castle, to the white} + {Tohru, tonoha} + {I need, need}", "{Castle, white} + {Load and tongue, boiled tongue} + {I want, to need }] ”.

Furthermore, from the candidates, when the one with a high priority of the independent section is selected, "castle">"white","is">"necessary","don" = "city", "load"> Because it is "boiled", "there are + fields in the castle," and "in the castle, the {noden, the capital}} +
It can be narrowed down to "I am there" and "I am with the castle + load".

Furthermore, when the priority of the attached part is high, since "ga">"noga","there is + the field + in the castle" and "the + hall is + in the castle". , "" Castle + load + there are + ".

Furthermore, the priority of each bunsetsu is (priority of independent section + priority of ancillary section) / 2 (however, in the case of a bunsetsu with no ancillary section, the priority of the independent section is the priority of a bunsetsu. Will be calculated. The total priority of the clauses in the above three sentences is “++ in the castle +” → 5 + 6 + 5 = 16, “++ in the castle +” → 6 + 6 + 5 = 17, “castle + load” “Tono + is present” → 5 + 4 + 5 = 14, and “+ there is + in the castle” is decided as the first candidate.

In the case of the example in FIG. 7, when the candidates having the minimum number of clauses are narrowed down, "I try to see" can be determined as the first candidate.

Step 9-3 is a conversion result output process. The first candidate determined in step 9-2 is stored in the output buffer OBUF.

Step 9-4 is an input buffer erasing process. The contents of the input buffer IBUF are erased to prepare for the next read key input. When the processing is completed, it returns.

FIG. 10 is a detailed flowchart of the "clause candidate table creation process" in step 9-1.

Step 10-1 is a process for initializing the counter i. The counter i is the input buffer IBUF
Is a counter that points to the i-th character of the reading character string, and at the beginning, 1 is set to point to the first character.

Step 10-2 is a clause analysis process. Using the i-th reading of the input buffer IBUF as the head reading, the clauses are analyzed from the subsequent readings to create a clause candidate table. Details will be described with reference to FIG.

FIG. 11 is a detailed flowchart of the "bunsetsu analysis process" in step 10-2.

Step 11-1 is a process for retrieving the independent dictionary. Using the character after the i-th reading of the input buffer IBUF as a key, search the independent dictionary JDIC,
Detect a partially matching free-standing part.

In step 11-2, the number of independent parts detected in step 11-1 is stored in the counter j.

In step 11-3, the number of reading characters of the j-th independent portion of the independent portion detected in step 11-1 is added to the counter i and is substituted into the counter k. That is, the counter k indicates the k-th reading character in the input buffer IBUF.

Step 11-4 is a process for searching the appendix dictionary. Using the characters after the k-th reading character of the input buffer IBUF as a key, the adjunct dictionary FDIC is searched to detect an adjunct that partially matches.

If the attached part that partially matches is not detected, the processing is performed in step 11-4.
If it can be detected, the process proceeds to step 11-
Proceed to 6.

Step 11-6 is to detect the attached parts,
This is a process of determining whether or not the connection with the immediately preceding independent section is possible. The connection determination table CTBL shown in FIG. 4 is used for the determination. If connection is not possible, the process is returned to step 11-4, and the accessory dictionary is searched again. If they can be connected, the process proceeds to step 11-7.

Step 11-7 is a clause generation process. A character string that is a combination of the independent part and the attached part detected immediately before is registered as a phrase in the node of the phrase candidate table.

In step 11-8, the input buffer IBU is used.
This is a process of updating the reading leading character of F to be processed. That is, a value obtained by adding the number of readings of the attached part to the head position k of the self-supporting part processed immediately before is stored in the counter i.

Step 11-9 is the input buffer IBU.
This is a process of comparing the number of characters stored in F with the counter i. If the number of characters stored in the input buffer IBUF is smaller than the counter i, it means that all the readings stored in the input buffer have been processed, and the process is returned. If not, it means that there are unprocessed readings, so the process proceeds to step 11.
Go to -10.

Step 11-10 is a clause analysis process. The phrase analysis processing is exactly the processing shown in FIG. 11, and can be called recursively. In this step, calling the bunsetsu analysis processing means performing bunsetsu analysis on the i-th and subsequent reading strings in the input buffer. When i was called in step 10-2, i was set to 1. However, i was updated when i was called in this step.

Step 11-11 is a process for updating the counter j. Since the processing for one independent part is completed, the counter j is decremented by 1.

Steps 11-12 are processes for determining the presence of an unprocessed independent part to be processed. If there are still unprocessed independent sections, the process proceeds to step 11-3. If not, the process is returned.

The present invention is not limited to the above embodiment.

In the present embodiment, in the first candidate determination process, the minimum clause number method, the priority of the independent word, and the priority of the attached part are determined in combination, but the method is limited to such a method. Not something to do. For example, the connection determination table may be determined by a calculation formula that takes into account the connection strength prepared.

In addition, the present invention can be variously modified and implemented without departing from the scope of the invention.

[0084]

As is apparent from the above description, according to the present invention, (1) an adjunct word string that can be connected to an adjunct dictionary is stored as one adjunct, and the adjuncts are not connected. Due to
Highly accurate kana-to-kanji conversion can be realized by eliminating meaningless adjunct word concatenation; (2) In addition to the above, the adjunct dictionary can also store wording composed of concatenations of adjunct words and independent words. With this, highly accurate kana-kanji conversion can be realized. (3) Further, in addition to the above-mentioned effect, each auxiliary section stored in the auxiliary section dictionary means stores priority information in association with each other, thereby attaching Effective use of departmental priority,
It has the effect of enabling highly accurate kana-kanji conversion.

[Brief description of drawings]

FIG. 1 is a block diagram of an overall configuration according to an embodiment of the present invention.

FIG. 2 is a diagram showing a configuration example of an independent section dictionary according to an embodiment of the present invention.

FIG. 3 is a diagram showing a configuration example of an appendix dictionary according to an embodiment of the present invention.

FIG. 4 is a diagram showing a configuration example of a connection determination table in the embodiment of the present invention.

FIG. 5 is a diagram showing a configuration example of an input buffer and an output buffer in the embodiment of the present invention.

FIG. 6 is a diagram showing a configuration example of a phrase candidate table in the embodiment of the present invention.

FIG. 7 is a diagram showing a configuration example of a phrase candidate table in the embodiment of the present invention.

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

FIG. 9 is a flowchart showing an operation of conversion processing in the embodiment of the present invention.

FIG. 10 is a flowchart showing an operation of a phrase candidate table creating process in the embodiment of the present invention.

FIG. 11 is a flowchart showing an operation of a phrase analysis process in the example of the present invention.

[Explanation of symbols]

CPU microprocessor AB address bus CB control bus DB data bus ROM Read-only fixed memory PA program area RAM random access memory JDIC Independent Department Dictionary FDIC attachment dictionary CTBL connection judgment table IBUF input buffer OBUF output buffer BTBL clause candidate table KB keyboard DISK external memory CR cursor register DBUF display buffer memory

─────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP-A-5-67077 (JP, A) JP-A-3-265061 (JP, A) JP-A-4-256159 (JP, A) JP-A-3- 286249 (JP, A) JP-A-2-36466 (JP, A) (58) Fields investigated (Int.Cl. ⁷ , DB name) G06F 17/21-17/24

Claims (3)

(57) [Claims] 1. An input means for inputting a kana character string, a word dictionary means storing word readings, grammatical information such as notations and parts of speech in association with each other, and auxiliary words such as particles and auxiliary verbs. , The reading, display, and grammatical information are stored in association with each other, and the kana character string input by the inputting means is referred to by referring to the word dictionary means and the adding dictionary. A kana-kanji conversion means for converting into notation, and the adjunct dictionary means stores a single adjunct and an adjunct word string that can be concatenated and used as one adjunct, and the kana-kanji conversion means In the conversion, the character processing device is characterized in that the attached parts are not connected. 2. The character processing device according to claim 1, further comprising, in the adjunct dictionary means, an adjunct word and an adjunct word string, and an adjunct word formed by connecting an adjunct word and an independent word. A character processing device characterized by being stored as a part. 3. The character processing device according to claim 1 or 2, further comprising: priority information is stored in association with each attached part stored in said attached part dictionary means. Character processing device.