JPH06161995A - Method and device for shaping name data - Google Patents

Abstract

PURPOSE:To accurately perform last name punctuation by obtaining the number of characters of a full name from full name data, obtaining the number of words and word length by retrieving a last name dictionary, and punctuating the full name data between a last name and a first/middle name by a last name punctuation means. CONSTITUTION:The data of the full name, for example, (Shinichi Kobayakawa) is inputted to an original data buffer 10, and the data are taken out by a full name data acquisition means 20. After that, last name dictionary retrieval 30 is performed as comparing the last name dictionary with the full name data, and a result in which the full name is segmented into (ko/hayakawa/shinichi) can be obtained. At this time, the number 3 of words is obtained by a word number acquisition 50, and the word length 1:2:2 is obtained by a word length acquisition means 40. In such a case, the number 5 of full name characters can be obtained immediately from the full name data acquisition 20 by a full name character number acquisition means 60. The calculation 70 of the number of last name characters can be performed based on the data in the word number acquisition 50, the word length acquisition 40, and the full name character number acquisition 60, and the last name punctuation 80 is performed by the obtained number of last name characters, then, it is outputted to a data buffer 90 after shaping.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a name data shaping method and apparatus for automatically converting continuous name data without distinction between first name and last name into a character string delimited by first name and last name.

[0002]

2. Description of the Related Art Conventionally, as shown in Japanese Unexamined Patent Publication No. 4-33053, statistically viewed from the number of characters of name data, for example, in the case of a four-character name, the surname is set to two characters and the surname:
The first name was determined to be 2: 2, or as a completely different method, a matching first and last name was searched for from the first and last name dictionary, and the first and last names were separated. The former method lacked accuracy, and the latter method had the disadvantage of enormous dictionary capacity.

[0003]

SUMMARY OF THE INVENTION An object of the present invention is to perform a surname surname separation using a surname and surname dictionary storing a minimum necessary surname and surname word, and search the dictionary even for surname and surname not stored in the dictionary. It is an object of the present invention to provide a name data shaping method and device for performing more accurate surname separation based on the obtained information.

[0004]

Means for Solving the Problem The present invention comprises full name data consisting of a character string in which a family name and a given name are continuous, and a family name dictionary storing a family name character string and single kanji. It is characterized by searching the dictionary and calculating the number of surname characters from the length and number of words matched in the search and the number of characters of the name data, and dividing the name data into surname and surname.

Further, according to the present invention, a name data storage unit storing name data consisting of a character string in which a family name and a first name are consecutive,
A first and last name dictionary storing a first and last name character string and single kanji, a first and last name data acquisition means for obtaining first and last name data from a first and last name data storage part, a first and last name dictionary search means for searching a word matching the first and last name data, A word length acquisition unit that acquires the length of the matched word in the search, a word number acquisition unit that acquires the number of matched words in the search, a name character number acquisition unit that acquires the number of characters of the name data, and a word length, Number of words,
It is characterized by having a surname character number calculation means for calculating the surname character number from the full name character number and a surname and surname delimiter means for delimiting the name data into surname and surname.

[0006]

[Function] The number of characters of the name is obtained from the name data, the number of words and the length of the word are obtained by searching the surname dictionary.

The number of surname characters is calculated from the above three data lengths. Then, the surname and surname delimiter separates the name data into surname and surname. If a blank character is inserted at this position, the name data, for example, "Taro Yamada" will be formatted into a form in which the surname and first name "Taro Yamada" are separated.

[0008]

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is a block diagram of the structure of this embodiment.
1 is a name data shaping device. Original data buffer 10
As an example, input the data of the first and last name "Shinichi Kobayakawa". Next, the name data acquisition means 20 extracts the data in the original data buffer. The surname and surname dictionary is searched while comparing the surname and surname dictionary with the name data to obtain a result separated from "small / Hayakawa / Shinichi". Here, the word number acquisition 50 acquires the word number 3, and the word length acquisition 40 acquires the word length 1: 2: 2. Here, the name character number 5 is immediately obtained from the name data acquisition 20 by the name character number acquisition 60. The number of surname characters is calculated 70 based on the three types of data: word number acquisition 50, word length acquisition 40, and name character number acquisition 60.

The steps of calculating the number of surname characters 70 are shown in FIGS.
And detailed in FIG. The surname and surname delimiter 80 is performed based on the surname and character number obtained in the surname character number calculation 70. The data delimited by the family name is output to the data buffer 90 after shaping.

In FIG. 2, the original data column (A) line is
This is an example of the case of "Ichiro Yamada". As a result of the first and last name dictionary search, "Yamada / Ichiro" is separated, and "Yamada" and "Ichiro" are obtained as the data after shaping. In this example, the surname and given name can be separated only by the search result of the surname dictionary. Also, it can be seen that the number of words is 2, the word length is 2: 2, and the number of name characters is 4.

The original data column (I) line is an example of the case of "Takehiro". Although it is not separated as "Takehiro" in the result of the first and last name dictionary search, the present invention reveals that the number of words is 1, the word length is 2, and the number of name characters is 2. Based on these numerical data, FIG. According to the description of the present invention described above, “Take” and “Hiro” are obtained as the data after shaping.

The original data column (u) line is an example in the case of "Konosuke Suzuki". The result of the first and last name dictionary search is "Suzuki /
However, according to the present invention, it is found that the number of words is 3, the word length is 2: 2: 1, and the number of name characters is 5. Therefore, FIG. By the following description of the present invention, shaping is performed, and "Suzuki" and "Konosuke" are obtained as the shaped data.

The original data column (e) line is an example in the case of "Jiro Higashinishiyama". In the result of the first and last name dictionary search, it is separated from "Higashi / Nishiyama / Jiro", but according to the present invention, it is found that the number of words is 3, the word length is 1: 2: 2, and the number of name characters is 5. The data is shaped according to the description of the present invention from FIG. 3 onward based on the data, and “Higashi Nishiyama” and “Jiro” are obtained as the shaped data.

The original data column (O) line is an example in the case of "Santaro Namboku". In the result of the search of the first and last name dictionary, it is separated from “Minami / North / Santaro”, but according to the present invention, it is found that the number of words is 3, the word length is 1: 1: 3, and the number of name characters is 5. Based on the data, the data is shaped by the description of the present invention, which will be given later with reference to FIG. 3, so that “north-south” and “Santaro” are obtained as the shaped data.

The original data column (or) line is an example in the case of "Shiro Kaminakashita". In the result of the search of the surname and surname dictionary, "upper / middle / lower / shiro" is separated, but according to the present invention, it is found that the number of words is 4, the word length is 1: 1: 1: 2, and the number of name characters is 5. Based on these numerical data, shaping is performed by the description of the present invention after FIG. 3 described later, and “Suzuki” and “Honosuke” are obtained as the shaped data.

FIG. 3 is a flowchart according to the present invention. 2 is a detailed description of the surname character number calculation 70 of FIG. 1
00 to 128 are step numbers. The flowchart of the left half of FIG. 3 will be described with reference to FIG. The surname dictionary is searched from the name data to obtain the word length and the number of words (100, 101, 102, 103, 104). Also,
The number of name characters is obtained from the name data (107).

If the number of words is two as shown in the schematic diagram in the left column in step 105 of FIG. 4, 1 as shown in the schematic diagram in the right column.
Assuming that the second word is the surname and the second word is the first name, the number of surname characters is the first word length. Explaining with the flowchart of FIG.
The 106th word length is substituted 106 for the number of surname characters. 10 of FIG.
In 5, when the number of words = 2 is no, the number of name characters is acquired 107. If the number of characters of the first name is less than 2, the total number of characters of the surname and the first name cannot be 1 character in practice, so the process is terminated. In the case of no in 108, the number of characters = 2, the number of characters = 3, the number of characters = 4, and the number of characters is 6 or more.

When the number of name characters is two, it is as shown in the schematic diagram in the left column and the schematic diagram in the right column of step 109 in FIG.
When the number of characters = 2, substitute 1 for the number of surname characters 10
9,110.

When the number of characters of the name is three, as shown in the schematic diagram in the left column of step 111 in FIG. 4, there may be a case where the three characters are integrated or a case where the three characters are different. As shown in the schematic in the right column, the division is 2: 1. If YES in step 111 of FIG. 3, 2 is substituted for the number of surname characters 113.

When the number of characters of the name is four, as shown in the schematic diagram in the left column of step 112 in FIG. 4, the case of four characters integrated, the case of separating one character before and after two characters, and the case of separating all four characters All of the five cases, that is, the case where the two characters are in the latter half and the case where the two characters are in the first half, are divided into 2: 2 as shown in the schematic diagram in the right column. Steps 112 and 1 in FIG.
As shown in 13. If the number of characters in the name is 6 or more, there are few actual examples, and there are too many patterns of division, and it takes too much processing time and sacrifices processing capacity. (Figure 3 Step 1
14). The case where the number of name characters is 5 will be described with reference to FIG. 5 in the flowchart on the right half of FIG.

As shown in the left column of step 115 in FIG.
If a three-character block comes and then one character continues twice,
As shown in the schematic in the right column, it is divided into 3: 2. If the first word length = 3 in FIG. 3, step 115 substitutes 116 for the number of surname characters. Step 117 of FIG.
As shown in the left column of, when two character blocks come before and after,
When two 2-character blocks first appear consecutively,
When a character block is preceded by 1 and then 3 characters are consecutive, all are divided into 2: 3 as shown in the schematic diagram in the right column. This is as shown in steps 117 and 118 of FIG.

As shown in the left column of step 120 of FIG.
If one character is divided before and after the three-character block, no processing is performed. This is as shown in the case where the second word length = 3 is YES in step 120 of FIG.

As shown in the left column of step 121 in FIG.
If a two-character block continues twice after one character,
When a two-character block comes once after a character, it is divided into 3: 2 as shown in the schematic diagram in the right column. This is as shown in steps 121 and 122 of FIG.

As shown in the left column of step 123 in FIG.
When a two-character block comes after one character continues twice and when a three-character block comes after one character continues twice, they are all divided into 2: 3 as shown in the schematic diagram in the right column. This is as shown in steps 123, 124, and 125 of FIG.

As shown in the left column of step 126 in FIG.
When a two-character block comes after one character continues three times, it is divided into 3: 2 as shown in the schematic diagram in the right column. This is as shown in steps 126 and 127 of FIG.

As shown in the left column of step 126 = NO in FIG. 5, when one character continues five times, the process ends. This is as shown when the fourth word length = 2 is NO in step 126 of FIG.

By the above processing, a fairly accurate number of surname characters can be obtained even if the search result of the surname dictionary is not complete. When the number of surname characters is fixed, one blank is inserted after the number of surname characters to separate the surname (128).

FIG. 6 is a hardware configuration diagram when this embodiment is realized by a personal computer. The personal computer 200 has a C functioning as a control means.
PU201, RAM202 which stores a program, and is used as a buffer and a work of name data, BI
ROM that stores system programs such as OS
And 203. The personal computer 200 also has a CRT 204 for displaying data and the like.
And a keyboard 2 for inputting commands from the user
05 and a magnetic disk 206 for storing data and the like.

[0029]

According to the present invention, the family name dictionary can be made smaller in size and the dictionary search time can be shortened as compared with the conventional case. Furthermore, it is possible to perform the surname delimiter more accurately than ever before for various name data. Of the name data handled by the application software program of the database used in the business card management device, the computer system automatically separates continuous name data that does not distinguish between first name and last name, making it easy to shape the name data. To do. By separating the family name and first name, the display and printing of the name data is beautiful and easy to see.

[Brief description of drawings]

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

FIG. 2 is a specific explanatory diagram of the present invention.

FIG. 3 is a specific explanatory diagram of the present invention.

FIG. 4 is a specific explanatory diagram of the present invention.

FIG. 5 is a specific explanatory diagram of the present invention.

FIG. 6 is a conventional hardware configuration diagram.

[Explanation of symbols]

 1: Name data shaping device 10: Original data buffer 20: Name data acquisition means 30: First and last name dictionary search means 40: Word length acquisition means 50: Word number acquisition means 60: First and last name character number acquisition means 70: First and last name character number calculation means 80: First and last name Separator 90: Data buffer after shaping

Claims (2)

[Claims] 1. A full name data consisting of a character string in which a surname and a first name are consecutive, and a surname and first name dictionary storing a first and last name character string and a single kanji character are searched, and a word that matches the first and last name data is searched from the surname and first name dictionary and searched. A name data shaping method, characterized in that the number of surname characters is calculated from the length of the matched words, the number of words, and the number of characters of the name data to divide the name data into surname and surname. 2. A name data storage unit for storing name data consisting of character strings in which surnames and first names are consecutive, and a surname and first name dictionary storing character names and single kanji characters, and the name data storage unit stores the name data. A full name data acquisition unit for obtaining a name, a full name dictionary search unit for searching for a word matching the name data from the surname dictionary, a word length acquisition unit for acquiring the length of the word matched in the search, and A word number acquisition means for acquiring the number of matched words, a name character number acquisition means for acquiring the number of characters of the name data, a surname character number calculation means for calculating the surname character number from the word length, the number of words, and the name character number, and the name A name data shaping device comprising a surname and first name separating means for separating data into first and last names.