JPH1027173A - Personal name converter - Google Patents

Abstract

PROBLEM TO BE SOLVED: To attain a personal name conversion function utilizing the feature of each personal name by reducing data capacity as less as possible and removing influence to be exerted upon conversion algorithm. SOLUTION: Conversion candidates corresponding to KANA (Japanese syllabary) characters are stored in a personal name dictionary 20E together with an arrangement position to be arranged at the time of converting a personal name. When KANA characters are inputted from an input part 12, a CPU 10 prepares personal name candidates by combining all conversion candidates to be combined by the arrangement position out of conversion candidates corresponding to the inputted KANA characters and stored in the dictionary 20E in accordance with a program stored in a storage medium 24.

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 such as a word processor and, more particularly, to a personal name conversion apparatus for converting input character data into a personal name.

[0002]

2. Description of the Related Art In recent years, a document processing apparatus such as a word processor is often used for creating a document.

As is well known, this type of document processing apparatus can convert input character data (kana character string) into a kanji character string. That is, a conversion dictionary is searched for the input kana character string, the candidates in the dictionary are displayed, and the user selects and inputs.

[0004]

In such a document processing apparatus, there are many cases where a kana character string is input and converted into a personal name. However, personal names have many letters in Hiragana, and even if they are not so many in terms of pronunciation,
In kanji notation, the number is enormous, and most of them are not stored in ordinary conversion dictionaries. Therefore, when inputting a person name that is not in such a dictionary, the only option is to determine single Kanji characters one by one.

[0005] However, such a single kanji conversion result also affects the learning function of the kana-kanji conversion system, and adversely affects subsequent conversion.

In order to solve this problem, a method of registering as many personal names as possible in a conversion dictionary is conceivable.
It is not realistic in terms of memory capacity and conversion algorithm. Further, even if such a large number of conversion candidates are displayed sequentially or collectively, it is very difficult to find a target name.

An object of the present invention is to make use of the characteristics of personal names,
The realization of the personal name conversion function with less data capacity and without affecting the conversion algorithm.

[0008]

Means of the present invention are as follows. The storage means stores the conversion candidate corresponding to the character data together with the arrangement position arranged when the personal name is converted. The input means is a keyboard or the like for inputting character data. When converting the character data input by the input unit into a personal name candidate, the creating unit converts all of the conversion candidates that can be combined at the arrangement position among the conversion candidates of the storage unit corresponding to the input character data. Create personal name candidates by combining the candidates.

The operation of the means of the present invention is as follows. In the storage means, the conversion candidate corresponding to the character data is
When the character data is inputted by the input means, the creating means stores the arrangement position to be arranged when the personal name is converted, and the creating means, among the conversion candidates of the storage means corresponding to the inputted character data, A personal name candidate is created by combining all the conversion candidates that can be combined at the arrangement position. Therefore, the personal name conversion function can be realized with a smaller data capacity and without affecting the conversion algorithm.

The means and operation of the invention of claim 2 are as follows. In the invention described in claim 1, the creating means does not create a personal name candidate having two identical kanji. Therefore, it is possible to eliminate the creation of a conversion candidate that is impossible as a personal name.

The means and operation of the invention of claim 3 are as follows. In the invention described in claim 1, the creating means creates a personal name candidate with a part of the name being hiragana. Therefore,
You can also create personal names that contain kana and kanji.

The means and operation of the invention according to claim 4 are as follows. According to the first aspect of the present invention, the creating unit does not create a previously stored personal name candidate. Therefore, it is possible to prevent creation of an inappropriate conversion candidate as a personal name.

[0013]

Embodiments of the present invention will be described below with reference to FIGS. 1 to 6C.

FIG. 1 is a diagram showing a configuration of a document processing apparatus to which a personal name conversion apparatus according to a first embodiment of the present invention is applied.
Reference numeral 10 in the figure denotes a CPU as a control unit that controls the entire document processing apparatus. Reference numeral 12 denotes an input unit such as a keyboard and a mouse; 14, a display unit such as a CRT;
Denotes a printing unit of a printer or the like. Reference numeral 18 denotes a storage device such as a hard disk or a ROM, and reference numeral 20 denotes a RAM. Reference numeral 22 denotes a mounted floppy disk or optical (magnetic)
A storage medium control unit controls storage and readout of data from and on a storage medium 24 such as a disk, and a communication control unit 26 transmits and receives data to and from the outside via a communication line (wired or wireless).

The storage device 18 or the storage medium 24 is pre-stored with a processing program of the document processing device including the personal name conversion device executed by the CPU 10, data, and the like. The communication control unit 26 receives programs and data stored in the storage device 18 or the storage medium 24 from another device connected via a communication line or the like (for example, the RAM 2).
0) may be stored. Further, the storage device or the storage medium may be provided on another device connected via a communication line or the like, and programs and data stored therein may be stored via the communication line. May be used.

The RAM 20 includes a work memory 20A used as a work area, a dictionary memory 20B for kana-kanji conversion and the like, a character generator (CG) 20C for creating display data, and a document memory for storing created documents. In addition to 20D, in the present embodiment, a personal name dictionary 20E that stores conversion candidates corresponding to kana as shown in FIG. A special person name table 20F storing kanji used in a special combination as shown in FIG.
And a hiragana personal name table 20G storing kanji used for personal names mixed with hiragana as shown in FIG. 2 (C).

That is, the personal name dictionary 20E stores only a single kanji character constituting a personal name instead of having a huge amount of personal data, and the personal name dictionary 20E stores a kanji code,
It is composed of the reading and the position information of the kanji in the personal name. Here, the position information has the following meaning. That is, "2s" indicates that it is used at the beginning of a two-character kanji name, and "2e" indicates that it is used at the end of a two-character kanji name. "3s", "3m", and "3e" indicate that they are kanji used at the beginning, center, and end of a three-character kanji name, respectively.

Next, the operation in such a configuration will be described.

FIG. 3 is a flowchart for explaining the operation of the personal name conversion apparatus according to the first embodiment of the present invention. A program for realizing each function described in this flowchart is stored in the storage device 18 or the storage medium 24 in the form of a program code readable by the CPU 10.

Thus, in the present embodiment, at the time when an instruction to convert a personal name is given, the stored personal name dictionary 20E is searched, and a single kanji is combined to create a personal name.

First, the input hiragana is divided for each kanji (step S10). In this case, the personal name dictionary 20
There is a method of making a correct combination while referring to E.
A method of matching with will be described as an example.

For example, when "Akisuke" is input, combinations such as A / Kisuke Aki / Suke Akisu / Keah / Ki / Sukea / Kisuke / Keaki / Su / Keakisuke are conceivable. .

The hiragana combinations thus created are processed one by one. Here, it is checked whether or not the processing has been completed for all the combinations (step S1).
2).

If the processing has not been completed, the personal name dictionary 20E is searched for pronunciation and position information for one unprocessed hiragana combination (step S14), and the detected kanji is combined to create a personal name, which is then processed. Memory 20A
(Step S16).

For example, for "Aki / Suke", a kanji whose pronunciation is "Aki" and whose position information is "2s" is detected.
A kanji whose pronunciation is “suke” and whose position information is “2e” is detected. Then, all combinations of the detected kanji are output.

Next, the work memory 20 thus created
Check the personal name stored in A and delete the personal name having two identical kanji characters from work memory 20A (step S1).
8).

For example, a combination that is not used in a normal personal name, such as “Nana” created from “Nana” or “Futako” created from “Fujiko”, is deleted.

Thereafter, the flow returns to step S12 to repeat the processing for the next unprocessed hiragana combination.

When the processing for all the combinations is completed, the processing for the special person name, the processing for the kanji used in the special combination, and the hiragana + hiragana +
A person name conversion candidate obtained by processing a kanji person name is additionally stored in the work memory 20A. (Step S20).

For example, a kanji used in a special combination is stored as a special person name table 20F. Using this special person name table 20F, for example, "Yurika" is added to the "Yurika" candidate, and "Asuka" is added to the "Asuka" candidate.

Only when used for a special person's name, a specially pronounced kanji character cannot be handled by the person name dictionary 20E, and is added by special processing. For example, "Yoshito" is added to the candidate "Yoshindo", and "Main tax" is added to the candidate "Chichi".

Further, in order to cope with the hiragana + hiragana + kanji personal name, in the present embodiment, the kanji table frequently used in the last kanji is replaced by the hiragana name candidate table 20G.
If you find a pattern that applies,
Add Hiragana + Hiragana + Kanji personal name. For example, according to the hiragana name candidate table 20G, “Takako” is added to the “Takako” candidate, and “Shizuka”, “Shizuhana”, and “Shizuhana” are added to the “Shizuka” candidate. I do.

In addition, in step S20,
Performs processing according to the specialness of personal names.

The display of the name conversion candidates thus stored in the work memory 20A and key waiting processing, that is, selection of the name using the cursor keys of the input unit 12, and "confirmation"
The personal name is determined by the key (step S22).

Here, the key processing for the personal name conversion in step S22 is performed as shown in FIG.

That is, first, the person name conversion candidates stored in the work memory 20A are displayed on the display unit 14 (step S22A). For example, (A) of FIG.
9 is a display example showing a personal name conversion candidate 30 created and added to the input personal name reading 28. In this figure, reference numeral 32 indicates the page number of the displayed personal name conversion candidate, 34 indicates the total number of pages of the personal name conversion candidate corresponding to the input reading, and 36 indicates the candidate selection position pointer.

Next, the input of the narrowing-down character by the user from the input unit 12 is accepted (step S22B). That is, in the present embodiment, the candidate selection position pointer 3
In step 6, a personal name conversion candidate 30 is selected. When it is difficult to search for the candidate because there are so many candidates over a plurality of pages, a function provided on the keyboard of the input unit 12 or a specific function is provided to facilitate the search for the target candidate. By pressing the "narrow down" key associated with the key, a candidate having the same character as the target candidate is found. Then, following the operation of the above-mentioned "refinement" key, the user operates the refinement character selection position pointer 3 as shown in FIG.
8 is set to the same character position as the character constituting the target candidate by using a cursor key or the like, and an "execute" key is pressed, whereby a narrowing-down character is input.

As a result, the personal memory conversion candidate that matches the narrowing character is searched from the work memory 20A (step S22C), and the searched personal name conversion candidate is stored in the work memory 2A.
It is stored in another area of 0A and displayed on the display unit 14.
For example, in FIG. 5B, when the narrowed-down character selection position pointer 38 is narrowed down to “bright” of “Yume”, as shown in FIG. 5C, the narrowed-down character is selected. The search result is displayed together with 40. By performing the process of extracting only the candidates including the narrowed-down characters and displaying the candidates, the number of display candidates can be significantly reduced, and the target candidate can be easily searched.

Then, it is determined whether or not there is a designation for further narrowing down, that is, whether or not the "confirm" key of the input section 12 has been operated (step S22E). If the key has not been pressed, the flow returns to step S22B to return to the next narrowing down. Accept character input.

If the "confirm" key is operated, the person name conversion candidate pointed by the candidate selection position pointer 36 at that time is determined as the determined person name (step S22F), and FIG. ), The determined person name 42 is displayed on the display unit 14 and the document memory 2 is displayed.
OD is stored (Step S22G).

As described above, even if a person name is not in the person name dictionary 20E, the person name can be easily input by converting the person name.
Input speed can be improved.

In the first embodiment, personal name conversion candidates having two identical kanji characters are deleted. However, by adding naming-related information, personal name candidates can be determined.

Hereinafter, this will be described as a second embodiment of the present invention.

FIG. 6A shows R in the case of the present embodiment.
FIG. 3 is a diagram illustrating a configuration of an AM 20. In the present embodiment,
Further, it has a good luck picture number memory 20H and an inappropriate personal name candidate memory 20I.

Here, the lucky stroke number memory 20H stores the number of strokes of kanji as naming-related information, thereby realizing a function of displaying compatibility of personal names. That is, in general, when naming, it is often determined by the number of strokes of kanji that leads to good luck. Therefore, in the present embodiment, according to the number of strokes of personal name candidates, candidate names other than the number of strokes that lead to good luck are set as candidates. Remove it.

The improper personal name candidate memory 20I stores, as naming-related information, personal name candidates that are not appropriate to be used as personal names such as, for example, "demon" or "gogo" as shown in FIG. 6B. In this embodiment,
These inappropriate personal name candidates are excluded from the candidates.

That is, step S18 as shown in FIG.
Is inserted after the name. Here, in the personal name narrowing down process, as shown in FIG. 6C, first, referring to the good lucky picture number memory 20H, a person name other than the good lucky picture number is deleted from the work memory 20A (step S30). Next, referring to the inappropriate name candidate memory 20I, the name matching the inappropriate name candidate stored therein is deleted from the work memory 20A (step S32).

As described above, by using the naming-related information, only appropriate candidates can be presented as personal name candidates.

The first and second embodiments are described in
Although the case of kana-kanji conversion has been described as an example, it is needless to say that the present invention can also be applied to a case where input Roman characters are directly converted to kanji.

[0050]

According to the first aspect of the present invention, the personal name conversion function can be realized with a smaller data capacity and without affecting the conversion algorithm.

According to the second aspect of the present invention, it is possible to eliminate the creation of a conversion candidate that is impossible as a personal name.

According to the third aspect of the present invention, it is also possible to create a personal name containing kana and kanji.

According to the fourth aspect of the present invention, it is possible to avoid creating a conversion candidate that is inappropriate as a personal name.

[Brief description of the drawings]

FIG. 1 is a block diagram of a document processing device to which a character type conversion device according to a first embodiment of the present invention is applied.

FIGS. 2A to 2C are diagrams showing the stored contents of a personal name dictionary, a special personal name table, and a hiragana personal name candidate table, respectively.

FIG. 3 is a flowchart for explaining the operation of the first embodiment.

4A is a flowchart of a key processing subroutine for personal name conversion in the flowchart of FIG. 3, and FIG. 4B is a diagram showing a display example of a confirmed personal name;

FIGS. 5A to 5C are diagrams showing display examples for explaining key processing for personal name conversion.

FIG. 6 (A) is an illustration of R in a second embodiment of the present invention.
FIG. 4B is a block diagram showing the configuration of the AM, FIG. 4B is a diagram showing the storage contents of an inappropriate personal name candidate memory in FIG. 4A, and FIG. 4C is a flowchart of personal name candidate narrowing down processing.

[Explanation of symbols]

 Reference Signs List 10 CPU 12 Input unit 14 Display unit 18 Storage device 20 RAM 20A Work memory 20D Document memory 20E Person name dictionary 20F Special person name table 20G Hiragana person name candidate table 20H Good lucky picture number memory 20I Unsuitable person name candidate memory 22 Storage medium control unit 24 Storage medium 26 Communication control unit 28 Reading of input personal name 30 Personal name conversion candidate 32 Page number of personal name conversion candidate 34 Total number of pages of personal name conversion candidate 36 Candidate selection position pointer 38 Narrowing character selection position pointer 40 Characters being narrowed down 42 Confirmed person name

Claims (4)

[Claims] 1. A storage means for storing conversion candidates corresponding to character data together with an arrangement position arranged when a person's name is converted, an input means for inputting character data, and a character data input by the input means. Creating means for creating a personal name candidate by combining all the conversion candidates that can be combined at the arrangement position among the conversion candidates of the storage means corresponding to the input character data when converting to the personal name candidate; Person conversion device equipped with. 2. The personal name conversion apparatus according to claim 1, wherein said generating means does not generate a personal name candidate having two identical Chinese characters. 3. The personal name conversion apparatus according to claim 1, wherein said generating means generates a personal name candidate with a part of the name being hiragana. 4. The apparatus according to claim 1, wherein said creating means does not create a previously stored personal name candidate.