JPH10187692A - Character processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve the KANJI conversion rate of the respective kinds of conversion functions corresponding to an area by preferentially applying the combination information of a character string provided with present area information and performing conversion to a prescribed character string by a specified dictionary at the time of converting an inputted HIRAGANA (cursive form of Japanese syllabary) read string to the prescribed character string. SOLUTION: In a read-only fixed memory ROM, the respective fixed data of a KANA (Japanese syllabary)/KANJI (Chinese character) conversion dictionary KNCNVDIC, the dictionary LOCALDIC of the area information in the case that the word of the KANA/KANJI conversion dictionary is place name data and the example dictionary LOCYOREI of the area information storing example data among the area information are stored. The area information dictionary LOCALDIC stores the read information of the word or the like and the example dictionary LOCYOREI of the area information stores index information before and after postpositional particle connection or the like. Then, at the time of converting the inputted HIRAGANA read string to the prescribed character string, by the dictionaries, the combination inforamtion of the character string provided with the present area information is preferentially applied and it is converted to the prescribed character string.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a character processing apparatus for creating a document, and more particularly to a character processing apparatus having a function of converting a hiragana reading sequence into a predetermined character string.

[0002]

2. Description of the Related Art Conventionally, a character processing apparatus having a function of converting a hiragana reading string into a predetermined character string has been described as "combination information of character strings of individual data at the time of converting an input hiragana reading string into a predetermined character string. Kana-Kanji conversion using stored dictionary "individual example function has been proposed.

In particular, an individual example function of place name data has been proposed.

[0004] A character processing apparatus having a "kana-kanji conversion using a dictionary storing information on combinations of character strings between fields when converting an input hiragana reading string to a predetermined character string" has a function of meaning examples between fields. Has been proposed.

[0005] In particular, a semantic example function between place name fields has been proposed.

[0006]

However, in the conventional method, when there are a plurality of conversion candidates having the field of "place name", there is a drawback that the optimum conversion candidate cannot be preferentially converted. .

For example, if the hiragana reading sequence input as “Miyagi Ken Sendai” is converted into Kana-Kanji characters, there are conversion candidates having two place name fields of “Sendai City, Miyagi Prefecture” and “Kawauchi City, Miyagi Prefecture”. There is a drawback that it is not possible to determine which conversion candidate has priority.

Similarly, when the hiragana reading sequence input as “Kagoshima Kensendo” is converted to Kana-Kanji, there are conversion candidates having two place name fields, “Sendai City, Kagoshima Prefecture” and “Kawauchi City, Kagoshima Prefecture”. , It could not be determined which conversion candidate is given priority.

The present invention solves such a conventional problem,
It is an object of the present invention to realize a character processing device having a very high kanji conversion efficiency of various conversion functions according to regions.

[0010]

In order to achieve the above object, a character processing apparatus according to the present invention comprises: means for storing a dictionary for converting a hiragana reading sequence into a predetermined character string; and an input hiragana reading sequence. Conversion means for converting the hiragana reading string into a predetermined character string by the dictionary storage means, and when each character string in the dictionary for converting the hiragana reading string into a predetermined character string is a place name data, Means for storing information; means for storing a dictionary for combination information of character strings at the time of converting the input hiragana reading string to a predetermined character string; and information for combining the input hiragana reading string with the character string combination information. And a converting means for converting the input hiragana reading string into a predetermined character string by using a dictionary storage means for converting the input hiragana reading string into a predetermined character string. Means for storing a dictionary for character string combination information, and dictionary storage means for character string combination information having the presence area information when the input hiragana reading sequence is converted to a predetermined character string, It is characterized by comprising conversion means for preferentially applying the combination information of the character strings having the regional information and converting the information into a predetermined character string.

In the present invention, by adopting the above-described configuration, when the input hiragana reading string is converted to a predetermined character string in kana-kanji, the place name can be used between regions (for example, prefectures).
Kana-Kanji conversion candidates by example conversion are converted with priority.

For example, if the hiragana reading sequence input as “Miyagi Ken Sendai” is converted to Kana-Kanji characters, the conversion candidate of “Sendai City” existing in Miyagi Prefecture is converted with priority, and the conversion of “Sendai City, Miyagi Prefecture” is converted. The candidate is preferentially converted.

[0013] When the hiragana reading sequence input as "Kagoshima Ken Sendai" is converted to Kana-Kanji, the conversion candidate of "Kawauchi City" existing in Kagoshima Prefecture is converted with priority.
The conversion candidate of "Kawauchi City, Kagoshima Prefecture" is preferentially converted.

Therefore, a character string that the user wants to convert can be immediately presented as a candidate.

According to the above, the effect of automatically determining conversion candidates along the area of the place name can be obtained immediately and extremely.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below in detail 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 calculations for character processing, makes logical decisions, etc., and performs address bus AB, control bus CB,
Each component connected to these buses is controlled via a data bus DB.

The address bus AB is connected to the microprocessor C
An address signal indicating a component to be controlled by the PU is transferred. The control bus CB transfers and applies a control signal of each component to be controlled by the microprocessor CPU. The data bus DB transfers data between the components.

The ROM is a read-only fixed memory, and a control procedure by a microprocessor CPU, which will be described later with reference to FIGS. 8 to 15, and a kana-kanji conversion dictionary in which a dictionary referred to when performing kana-kanji conversion is stored. The fixed data of KNCNVDIC, the fixed data of the local information dictionary LOCALDIC in which the local information is stored when the word of the kana-kanji conversion dictionary is the place name data, and the example dictionary LOCYOREI of the local information in which the example data between the local information are stored Is stored.

The local information dictionary LOCALDIC is a dictionary that stores word reading information, written information, part of speech information, and local information, as described later with reference to FIG.

An example dictionary LOCYOREI for local information is
As described later with reference to FIG. 7, heading information before particle connection,
It is a dictionary that stores heading information after particle connection and information on connectable particles.

The RAM is a writable random access memory having a structure of one word and 16 bits, and is used for temporarily storing various data from each component.

TEXT is a text buffer.
As described later, a document handled by the character processing apparatus is stored in an internal format.

KBBUF is a keyboard buffer for storing the input reading sequence.

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

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

A keyboard KB is a key for inputting character symbols such as an alphabet key, a hiragana key, and a katakana key, and various functions for the character processing apparatus such as a conversion key, a cursor movement key, and a selection key. It has various function keys.

DISK is an external storage for storing document data. The DISK stores a document created in a text buffer TEXT, and the stored document is called up by a keyboard command when necessary.

CR is a cursor register. The CPU can read and write the contents of the cursor register. A 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 patterns of data to be displayed. When displaying the contents of the document data, it is performed by developing a pattern in DBUF based on the data in the text buffer TEXT.

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

A CRT is a display device using a cathode ray tube or the like, and a display pattern of a dot configuration and a display of a cursor on the display device CRT are controlled by a CRT controller. Further, CG is a character generator for storing patterns of characters and symbols to be displayed on the display device CRT.

The character processing apparatus of the present invention comprising the above components operates in response to various inputs from the keyboard KB. When an input from the keyboard KB is supplied, first, an interrupt signal is generated. Sent to the microprocessor CPU and the microprocessor CP
U reads various control signals stored in the ROM,
Various controls are performed according to the control signals.

FIG. 2 is a diagram showing a screen configuration formed on the display device CRT of the device of the present invention.

In the figure, DSP means a display screen.

TS is a text screen on which the contents of the document stored in the text buffer TEXT are displayed.

KS is an area for displaying soft keys, and is used to display keys required according to the operation status, for example, a conversion key, a cursor movement key, a selection key, and the like, and to input by using a key at a corresponding position on the keyboard KB. Used.

WDSP is a window display screen.
This is an area where character string candidates created after the Kana-Kanji conversion process are displayed.

YS is an area for displaying a reading input of kana-kanji conversion.

FIG. 3 shows screens for reading input operation, conversion operation, conversion character string candidate display processing, candidate selection operation, etc., which are not affected by example data between place name data for each region when performing kana-kanji conversion. It is a figure explaining transition of.

In a state in which the document processing apparatus can create a document, the operator inputs a reading using a hiragana key, and displays the input reading "Sendaishi" in an area YS for displaying a reading input of kana-kanji conversion. (FIG. 3A) Then, when the conversion key is input, the window display screen W
The Kana-Kanji converted character string candidate is displayed on the DSP. (FIG. 3 (b)) In FIG. 3 (b), since it is not affected by the example data between the place name data for each region, the conversion candidates of "Sendai City" are displayed first in the order of the word frequency, and "Kawauchi City" Is displayed next, and the remaining "Mr. Kawauchi" is displayed subsequently.

Here, the operator moves the cursor to "Kawauchi" using the cursor movement keys (FIG. 3 (c)), and inputs "selection" by key, thereby causing the text buffer TE to enter.
"Kawauchi City" is input to XT, and "Kawauchi City" is also input on the display. (FIG. 3 (d)) FIG. 4 shows a reading input operation in which, when performing kana-kanji conversion, candidates between location-specific place name data are displayed with priority using example data between location-specific place name data. FIG. 9 is a diagram illustrating transition of screens such as a conversion operation, a display process of a converted character string candidate, and a candidate selection operation.

In a state in which the document processing apparatus can create a document, the operator inputs a reading using a hiragana key, and displays the input reading “Miyagi Kensei” in an area YS for displaying reading input of kana-kanji conversion. (FIG. 4
(A)) Then, when the conversion key is input, the window display screen W
The Kana-Kanji converted character string candidate is displayed on the DSP. (FIG. 4B) Here, the heading information “same area classification data” before the particle connection, the heading information “same area classification data” after the particle connection, and the connectable particle information “particles” are added to the example dictionary of local information LOCYOREI. "None" exists, and the local information dictionary LOCALD
Since there is local information data of "Miyagi prefecture" for "Miyagi prefecture" in the dictionary of IC, and local information data of "Miyagi prefecture" for "Sendai city" exists in the dictionary of local information dictionary LOCALDIC, Conversion candidates for "Sendai City, Miyagi Prefecture" are displayed first, followed by the remaining "Kawauchi City, Miyagi Prefecture".

Here, the operator inputs "selection" by keying, so that "Sendai City, Miyagi Prefecture" is input to the text buffer TEXT, and "Sendai City, Miyagi Prefecture" is also input on the display. (FIG. 4C) In a state in which the document processing apparatus can create a document, the operator inputs a reading using a Hiragana key, and a reading “Kagoshima Kensei” input in an area YS that displays reading input of Kana-Kanji conversion. Is displayed. (FIG. 4D) Then, when the conversion key is input, the window display screen W
The Kana-Kanji converted character string candidate is displayed on the DSP. (FIG. 4 (e)) Here, the heading information “same area classification data” before the particle connection, the heading information “same area classification data” after the particle connection, the connectable particle information “particles” are added to the example dictionary LOCYORE of the area information. "None" exists, and the local information dictionary LOCALD
In the IC dictionary, there is local information data "Kagoshima" for "Kagoshima", and the local information dictionary LOCALDI
In the dictionary of C, there is data of local information "Kagoshima" for "Kawauchi", so conversion candidates for "Kawauchi" in Kagoshima are displayed first, followed by "Sendai" in Kagoshima Is done.

Here, the operator inputs "selection" by keying, so that "Kawachi-shi, Kagoshima" is input to the text buffer TEXT, and "Kawauchi-shi, Kagoshima" is also input on the display. (FIG. 4F) FIG. 5 is a diagram showing a configuration of the text buffer TEXT.

The text is composed of a plurality of fixed-length line data. Each line data is also composed of a plurality of character data. Each character data is composed of 2 bytes per character, and is stored in, for example, a JISX0208 code.

The position of each character is designated by a Y coordinate indicating a line and an X coordinate indicating a character position in the line. For example, the third character from the left of the text and the fourth character from the left is specified by X coordinate = 4 and Y coordinate = 3. Similarly, the current position of the cursor is managed by the X coordinate and the Y coordinate.

FIG. 6 shows a local information dictionary L which stores local information when words in the kana-kanji conversion dictionary are place name data.
FIG. 3 is a diagram illustrating a configuration of an OCALDIC.

The local information dictionary is composed of word reading information, written information, part of speech information, and local information when words in the kana-kanji conversion dictionary are place name data.

The order in which information is stored in the local information dictionary is as follows.
It is assumed that the character codes (JISX0208 codes) of the word reading information are in ascending order (ascending order).

For example, two pieces of data are stored for the reading information of the word “Sendai”, and the first piece of data has the notation information “Sendai”, the part of speech information “City”, and the regional information “Miyagi”. The second data is that the notation information is “Kawauchi”, the part-of-speech information is “city”, and the regional information is “Kagoshima prefecture”.

FIG. 7 is a diagram for explaining the structure of the example dictionary LOCYORE for regional information in which example data between regional information is stored.

The example dictionary of regional information is composed of heading information before the connection of particles between the region information, heading information after the connection of the particles, and information of connectable particles.

The order in which information is stored in the example dictionary of local information depends on the character code (JISX) of the heading information before the particle connection.
0208 code) in ascending order (ascending order).

For example, with respect to the heading information before the particle connection “same area classification data”, the heading information after the particle connection is “same area classification data” and the connectable particle information is “no particle”.

Next, the operation of the above embodiment will be described with reference to FIGS.
This will be described with reference to the flowchart shown in FIG.

FIG. 8 shows a reading input operation in which, when performing kana-kanji conversion, candidates between region-specific place name data are preferentially displayed based on example data between region-specific place name data.
6 is an overall schematic flowchart of a conversion operation, a process of displaying converted character string candidates, and a process of selecting candidates.

First, at step 8-1, the keyboard K
It waits for an input from B, and upon receiving the input, performs a process of taking data into the keyboard buffer KBBUF. Here, if the head of the keyboard buffer KBBUF is a hiragana key, the process branches to step 8-2. If the conversion buffer is a conversion key, the process branches to step 8-4. If it is not a hiragana key or a conversion key, no processing is performed. Proceed to Step 8-1 without performing.

In step 8-2, the input buffer YO reads the hiragana reading at the head of the keyboard buffer KBBUF.
A process for adding to the MIBBUF is performed.

At step 8-3, a process of reading and additionally displaying the hiragana reading at the head of the keyboard buffer KBBUF in the area YS for displaying the reading input of kana-kanji conversion is performed.

In step 8-4, as described in detail in FIG. 9, a kana-kanji conversion dictionary KNCNVDIC, an example dictionary LOCYOREI for local information, and a local information dictionary LOCA
The LDIC changes the display priority of kana-kanji conversion candidates based on the example data between the place name data for each region, and outputs the kana-kanji conversion candidates to the candidate output buffer.

In step 8-5, the steps 8-4
The character string group in the candidate output buffer created by the kana-kanji conversion candidate creation process is displayed on the window display screen WDSP, and a process of selecting a candidate is performed.

In step 8-6, the process waits for an input from the keyboard KB, and upon receiving the input, performs a process of loading data into the keyboard buffer KBBUF. If the top of the keyboard buffer KBBUF is an up / down cursor key, the process branches to step 8-7. If the key is a selection key, the process branches to step 8-8. Without performing the operation, the process proceeds to step 8-6.

In step 8-7, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is
A process of changing the cursor position of the window display screen WDSP to be displayed on the window display screen WDSP and selecting a candidate according to the input of the up and down cursor keys is performed, and the process proceeds to step 8-6.

In step 8-8, the character string group in the candidate output buffer created by the kana-kanji conversion candidate creation process is
The text buffer TEX is displayed on the window display screen WDSP, and the cursor position of the window display screen WDSP for selecting a candidate is regarded as the selected candidate character string, and the text buffer TEX is displayed.
The editing process in T is performed.

In step 8-9, the character string group in the candidate output buffer created in the kana-kanji conversion candidate creation process is
The window display screen WDSP is displayed on the window display screen WDSP, and the cursor position of the window display screen WDSP for selecting a candidate is regarded as the selected candidate character string, and the window display screen WD is displayed.
A process for deleting the SP and displaying and editing the selected candidate character string on the text screen TS is performed.

FIG. 9 shows a Kana-Kanji conversion dictionary KNCNVDI.
Partial detailed flowchart of a process of changing the display priority of kana-kanji conversion candidates based on example data between place-name data for each region by using C, an example dictionary of local information LOCYOREI, and a local information dictionary LOCALDIC, and outputting to a candidate output buffer It is.

First, in step 9-1, the kana-kanji conversion dictionary K is read for the reading of the reading input buffer YOMIBUF.
A process of creating a conversion candidate by NCNV is performed.

In step 9-2, it is determined whether or not the processing in step 9-3 and subsequent steps has been completed for all the conversion candidates created in step 9-1. If the processing after step 9-3 has been completed for all the conversion candidates,
Next, the process proceeds to step 9-7. If the processing after step 9-3 has not been completed for all conversion candidates,
Next, the process proceeds to step 9-3.

At step 9-3, for one candidate of the conversion candidate character string created at step 9-1, a process of extracting a particle, an independent word before particle connection, and an independent word after particle connection is performed. However, the process is performed on an unprocessed conversion candidate character string.

In step 9-4, the local dictionary example dictionary LOCYORE is applied to the particles extracted in step 9-3, the independent words before particle connection, and the independent words after particle connection.
In I, there is matching combination information, and processing is performed to search whether the area of each independent word matches the area obtained by searching in the local information dictionary LOCALDIC.

In step 9-5, if there is no matching combination in step 9-4, the process proceeds to step 9-2, and if there is a matching combination, the process proceeds to step 9-6.

In step 9-6, for the conversion candidates processed in steps 9-3 to 9-5, a process of changing the priority of the conversion candidates to the highest priority display group is performed.

At step 9-7, a process of outputting the final conversion candidates to the candidate output buffer in priority order is performed.

[Other Embodiments] In the above description,
When performing Kana-Kanji conversion, using a means in which the candidate between the place name data for each region is preferentially converted based on the example data between the place name data for each region, a predetermined character string is set according to the region where the document is created. Has been described that can be immediately converted to the priority order.

Similarly, when performing a dictionary conversion for each field, a document is created by using means for converting candidates of the place name data for each region with priority by using example data between place name data for each region. According to the region, it is possible to immediately convert to the priority order of the predetermined character string.

At this time, the conversion key in step 8-4 in FIG. 8 is changed to a dictionary conversion key for each field, the kana-kanji conversion processing in step 8-4 is changed to a dictionary conversion processing for each field, and the conversion in step 8-5 is performed. This is realized by changing the kana-kanji conversion process to a dictionary conversion process for each field and changing the kana-kanji conversion dictionary in step 9-1 of FIG. 9 to a dictionary for each field.

For details, FIG. 10 is a detailed flowchart obtained by changing the flowcharts of FIGS.
And FIG. Except for the above-described changes, the processing is the same as the flowcharts of FIGS. 8 and 9.

Similarly, when performing abbreviated conversion, a region where a document is created is converted by giving priority to a candidate between region-specific place name data based on example data between region-specific place name data. Can be immediately converted to the priority order of the predetermined character string.

At this time, the conversion key in step 8-4 in FIG. 8 is changed to the shortened conversion key, the kana-kanji conversion process in step 8-4 is changed to the shortened conversion process, and the kana-kanji conversion process in step 8-5 is changed. This is realized by changing to the short conversion process and changing the kana-kanji conversion dictionary in step 9-1 in FIG. 9 to the short conversion dictionary.

For details, FIG. 12 is a detailed flowchart obtained by changing the flowcharts of FIGS.
And FIG. Except for the above-described changes, the processing is the same as the flowcharts of FIGS. 8 and 9.

Similarly, at the time of performing proper noun conversion, a means for preferentially converting a candidate between place-specific place name data based on example data between place-specific place data is used.
According to the area where the document is created, the character string can be immediately converted to the priority order of the predetermined character string.

At this time, the conversion key in step 8-4 in FIG. 8 is changed to a proper noun conversion key, the kana-kanji conversion processing in step 8-4 is changed to a proper noun conversion processing, and the kana-kanji conversion processing in step 8-5 is performed. This is realized by changing the processing to proper noun conversion processing and changing the kana-kanji conversion dictionary in step 9-1 in FIG. 9 to a proper noun dictionary.

For details, FIG. 14 is a modified flowchart of FIG.
And FIG. Except for the above-described changes, the flowchart is the same as the flowcharts of FIGS. 8 and 9.

[0086]

As described above, according to the present invention,
Means for storing a dictionary for converting the hiragana reading string into a predetermined character string, converting means for converting the input hiragana reading string into a predetermined character string by the dictionary storage means, and converting the hiragana reading string into a predetermined character string When each character string in the dictionary for conversion is place name data, means for storing the information of the existence area corresponding to each character string, and the character string at the time of converting the input hiragana reading string to a predetermined character string A character processing device comprising: a unit for storing a dictionary for combination information; and a conversion unit for converting an input hiragana reading string into a predetermined character string by a dictionary storage unit for combination information of the character strings. Means for storing a dictionary for combination information of character strings having presence area information at the time of converting the input hiragana reading string into a predetermined character string; At the time of conversion to a character string, the dictionary storage means for the combination information of the character string having the existence area information preferentially applies the combination information of the character string having the existence area information, and converts the information to a predetermined character string. Means, the input hiragana reading sequence is converted to a predetermined character string during the kana-kanji conversion between the place name regions (for example,
Kana-Kanji conversion candidates by example conversion of (prefecture) are converted with priority.

For example, if “Miyagi Ken Sendai” and the Hiragana reading sequence are converted to Kana-Kanji characters, the conversion candidate of “Sendai City” existing in Miyagi Prefecture is converted with priority, and the conversion candidate of “Sendai City in Miyagi Prefecture” is converted with priority. Is converted.

Also, when "Kagoshima Ken Sendai" and the Hiragana reading sequence are converted to Kana-Kanji characters, conversion candidates for "Kawauchi City" existing in Kagoshima Prefecture are converted with priority, and conversion candidates for "Kawauchi City, Kagoshima Prefecture" are converted with priority. Is converted.

Thus, a character string that the user wants to convert can be immediately presented as a candidate.

As described above, the effect of automatically judging conversion candidates along the area of the place name can be obtained immediately and extremely.

As described above, it is possible to realize a character processing device having a very high kanji conversion rate of various conversion functions according to regions.

[Brief description of the drawings]

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

FIG. 2 is a diagram showing a screen configuration of the apparatus of the present invention.

FIG. 3 is a diagram illustrating a reading input operation, a conversion operation, a conversion character string candidate display process, and a candidate selection method which are not affected by example data between place name data for each region when performing kana-kanji conversion according to the present invention. It is a figure showing an example.

FIG. 4 is a diagram showing an example of a reading input operation, a conversion operation, and a case where a candidate between region-specific place name data is preferentially displayed based on example data between region-specific place name data when performing kana-kanji conversion according to the present invention. FIG. 11 is a diagram illustrating an example of a display process of a converted character string candidate and a method of selecting a candidate.

FIG. 5 is a diagram showing a configuration of a text buffer according to the present invention.

FIG. 6 is a diagram showing a configuration of a regional information dictionary according to the present invention.

FIG. 7 is a diagram showing a configuration of an example dictionary of regional information in the present invention.

FIG. 8 is a flowchart showing the operation of the character processing device according to the present invention.

FIG. 9 is a flowchart illustrating an operation of the character processing device according to the present invention.

FIG. 10 is a flowchart illustrating the operation of another embodiment of the character processing device according to the present invention.

FIG. 11 is a flowchart showing an operation of another embodiment of the character processing device according to the present invention.

FIG. 12 is a flowchart illustrating the operation of another embodiment of the character processing device according to the present invention.

FIG. 13 is a flowchart showing the operation of another embodiment of the character processing device according to the present invention.

FIG. 14 is a flowchart showing the operation of another embodiment of the character processing device according to the present invention.

FIG. 15 is a flowchart showing the operation of another embodiment of the character processing device according to the present invention.

[Explanation of symbols]

 DISK External storage device CPU Microprocessor ROM Read only memory RAM Random access memory KBBUF Keyboard buffer TEXT Text buffer YOMIBUF Read input buffer KOUHOBUF Candidate output buffer KNCVVDIC Kana-Kanji conversion dictionary LOCALDIC Local information dictionary LOCYOREI Example of local information

Claims (1)

[Claims] 1. A means for storing a dictionary for converting a hiragana reading string into a predetermined character string; a converting means for converting an input hiragana reading string into a predetermined character string by the dictionary storage means; When each character string in the dictionary for converting the character string into a predetermined character string is a place name data, means for storing information on the existence area corresponding to each character string, and converting the input hiragana reading string into a predetermined character string Character processing comprising: means for storing a dictionary for character string combination information at the time; and conversion means for converting an input hiragana reading string into a predetermined character string by the dictionary storage means for character string combination information. In the apparatus, a unit for storing a dictionary for combination information of character strings having existence area information when the input hiragana reading string is converted into a predetermined character string, When converting the hiragana reading sequence into a predetermined character string, the dictionary storage means for the character string combination information having the presence area information preferentially applies the character string combination information having the existence area information, and A character processing device comprising a conversion unit for converting into a column.