JP2006163802A - Automatic name selecting system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide step-by-step operability, which a user easily learns, and a value determination criterion to which a user satisfies, in an online type chargeable name selecting service based on telling a person's fortune on the basis of his name, to eliminate a user's uneasiness about purchasing and reduce the occurrence of complaints after the purchase to consequently increase a sales amount. <P>SOLUTION: (1) An automatic name selecting system displays multiple sets of the number of particular examples of names, evaluation scores and prices as the result of a name selection which satisfies input conditions, and makes a user select candidates, which satisfy his requirement, and then carries out purchasing processing (settlement). (2) The automatic name-selecting system has a name's "reading" input means and carries out purchasing processing by using the means mentioned in (1) while making the user confirm the presence of absence of a "reading" which he or she desires. (3) The automatic name selecting system makes a user select the purpose of use of names, makes the user input desired family names (or names), and then carries out purchasing processing by displaying names which conform to the family names (or family names which conform to the names) by the method mentioned in (1). <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

The present invention relates to a computer system for providing a paid automatic name selection service based on first and last name determination via the Internet. In other words, in order to allow users to use an automatic name selection system that runs on a server via the Internet for a fee, it provides users with easy-to-understand charges, ease of use (convenience), and immediacy, and improves sales. The invention relates to a software program that can be realized.

There are many first and last name judgments using Internet technology. Currently, various paid services such as naming and renaming of newborns, stage names, etc. are provided for selecting names based on first name and last name, but most of the requirements such as surname (last name), gender (sex), date of birth, etc. are Web An order is received by inputting via a browser, and the actual name selection is performed manually by an appraiser, and the name selection results are sent off-line by email or mail at a later date.

Although there is an online automatic name selection function that is provided free of charge, (1) a list of strokes with names that meet the input conditions is displayed together with a simple appraisal text. (2) Enter a combination of name strokes to display a list of all combinations of kanji that can be combined. Although there is a system that selects names in two stages, user convenience is poor.
Patent Publication 2002-117129 (1) Enter the user's “image” in the name, or (2) Enter the number of strokes (the number of strokes of the five ranks of tense / personality / geographical / general / external) The invention relates to a program for determining a name by directly inputting a numerical value. However, (1) “image” is an abstract expression and is a problem that deviates from the essence of first and last name judgment, and is not the subject of the present invention. (2) cannot be entered unless you basically know what stroke number and what fortune. This cannot be used by users who do not have general knowledge of first and last names, and does not respond to the common request of "I want you to choose a good name with an appraiser". Web site: http://naming.jp/cgi/name/namnavi.htm If you enter your last name and gender (male and female), you will first see a list of strokes for the name. The first and last name judgment results are displayed according to the number of strokes. Next, click the “Find Name” button in each candidate to display a list of all combinations of kanji that match the number of strokes. Although it is free, there are too many candidates, and there are many that are mechanically combined with kanji and are not suitable as names. Moreover, when paying is assumed, the judgment criteria on the user side are only complex appraisal sentences, and it is difficult to compare with price setting.

First of all, it is a basic story about automatic name selection, but there has been an off-line type using personal computer software. In this case, the result can be obtained immediately, but the software needs to be purchased, the operation of the software depends on the OS type and version number of the personal computer, and the problem of the capacity of the memory and the hard disk is always accompanied. The users are basically limited to users who have knowledge of personal computers. Furthermore, since the data contents are fixed, it is difficult to add name data. From the provider's point of view, it is a sold-out business, and it is not a very favorable business model because it allows the software to be reused when content is universally determined.
In recent years, web browser functions have become standardized as a result of technological advances in the Internet, and any commercially available personal computer can be easily handled by anyone. On the other hand, it is not an exaggeration to say that the penetration rate of the line can be remarkably used anywhere. In the case of via a Web browser, the basic program and database exist on the server side, so there is no need to purchase software, and the database can be updated immediately. Also, pay-as-you-go is easy and it is more preferable as a business model. Therefore, in the present invention, automatic name selection via a web browser is handled as a basic theme.

First problem (conventional problem related to claim 1)
It is an object of the present invention to provide automatic name selection to a user for a fee. In the conventional manual selection, after the application, basically exchanges (dialogs) with mail and letters are entered with the user, so the user's request that cannot be expressed on the application screen can be reflected. The situation of returned goods and redoing is unlikely to occur and the business risk is extremely low. On the other hand, since it takes a certain amount of time to obtain a result from the application, for example, in the case of naming a newborn, it is necessary for the user to make a name selection request in advance by checking the number of days before the birthday. However, according to the inventor's many years of experience, about half of the actual name selection requests have already been born, and it is an urgent need to say “I want you to hurry as much as possible”.
Also, in the past, there was a feeling of parents about the name, and it was usual that detailed orders such as reading and kanji images were attached, but the recent request tendency is `` I will leave it to the teacher, as much as possible It is also characterized by the overwhelming number of very simple requests to “many good names”. In that sense, the free name selection site explained earlier seems to be a user's salvation. However, there are many users who actually use it and cry over to the inventor, and there are many user evaluations that “they were hardly useful”. There are three reasons for this. (1) There are too many candidates and hesitates which one is better. (2) Selection judgment is difficult even after reading the appraisal wording. As a result, “Ki” is a good name. (3) There are many specific names that are displayed as combinations of stroke numbers that do not fit well as names because of simple kanji combinations. In short, the problem is that there are many elements left to the user's judgment. This just invites impatients from users who are in a hurry.
On the other hand, the number of name candidates for the last name is quite different, and there are some surnames that are difficult to select with good fortune. That is, there are few kanji characters that can be used as names, and there are very few specific name candidates. In the case of manual name selection, adjustments such as discounting of charges and presentation to the user up to the second candidate are possible, and it is unlikely that user complaints will occur. However, when online automatic name selection is provided as a paid service, it is necessary to consider dealing with this problem.

Second problem (conventional problem related to claim 2)
The next most frequently requested user in the name selection request is the case where the name “reading” is designated. In particular, in the case of a “rename” request for a person who already has a name, not a newborn, this request is almost certainly issued. ("Rename" here means not only changing the name in the family register, but also a request for selecting a common name that is normally used on a daily basis.) There is no service that responds to this request online. The inventor is aware.

Third problem (conventional problem related to claim 3)
In the name selection request, there is a case in which a name other than the real name / common name, that is, a name such as a stage name, a pen name, a Japanese name, and a name of Genji is requested as a special name. In these selections, it is common to change both the last name and last name, and because of the nature of first name and last name selection, it takes many steps (hours), so online services are currently available not exist. Even in the offline type, the current service is to accept only by e-mail, etc., and then select manually while consulting with the user. However, there are many people who are not good at interacting with young people recently, and this service is also expected to be online.

Solution for the first problem The following two items are the minimum necessary to provide an automatic name selection service for a fee.
1. When there are multiple candidates, the superiority or inferiority is displayed in an easily understandable manner.
2. Provide a clear basis for the price.
First, regarding superiority or inferiority, this is difficult to understand simply by ranking the first candidate or the second candidate or by expressing words. After all, some numerical display is necessary. In the present invention, by quantifying the four cases in the first and last name judgment (main luck, basic luck, late luck, interpersonal luck) and the arrangement of three years old (healthy luck), and by uniquely determining the influence of the four cases by age, I decided to express the total fortune as a perfect score. Although it is not perfect, it seems that it is a perfect standard for users to judge whether the result of selection is good or bad.
Next, with regard to price, what can be said from the inventor's past experience is that it is the user's mind that the price should change depending on the number of specific names. Surnames that are difficult to give names with good fortunes have few specific names and take time and effort, but the real feeling is that if the number is small, the price should be lowered. Therefore, by displaying the number of specific examples and presenting a price commensurate with the number of specific examples, the user is provided with a satisfactory value. Moreover, although it is a specific example of a name, as understood from the user's voice of the above-mentioned problem, it is difficult for the user to recognize the value even if the kanji characters are simply combined and displayed. Therefore, this problem is avoided by collecting the names that have been actually used as names from the past name selection experiences of applicants and creating a database as the name selection results.

Solution to the second problem According to the inventor's past experience, matching the desired “reading” may have a higher priority than the natural kanji connection of the name. For example, if a person who already has a name is asked to change the name or select a common name, he / she can input the desired `` reading '' in hiragana or katakana, and the system will be able to do so. A method of separating “reading” into 1 to 3 kanji characters, searching for kanji candidates that can be read, and combining them as names is preferable. In this case as well, it is preferable to display not only the number of combinations but also the evaluation based on the first and last name judgment and display the consideration. However, if the “reading” is arbitrarily mechanically disassembled, kanji characters that disappoint the user's expectation may be displayed as name candidates. Therefore, the input field for the “reading” candidate is provided with a plurality of input cells. By making it possible to specify “reading” that you don't want, you can select names that are as close to the user's request as possible.

Solution for the third problem In the case of stage names and calligraphy, the first and last names are usually different from their real names, including their last names. In this case, you must first decide either your last name or name. First name and last name are determined for the determined last name (or first name), and a suitable name (or last name) is determined according to the type of business or occupation in which the first and last names are required. Although it is possible to decide the name first, the basic program is different from the general selection process. Therefore, in the present invention, a method for determining the last name first, which can commonly use the basic program, was considered. First, one user's desired industry or job type is selected. In addition, the desired surname is entered in multiple kanji. These are processed on the system side to display the optimum last name. Choose one last name from the candidates, and enter the name of the best name for that last name. The subsequent processes are basically the same as in the first invention.

According to the present invention, the recommended order, the number of candidates, the number of evaluation points, and the price of a name can be displayed at the same time by simply filling in a simple request form via the Internet. To attract. In addition, purchase procedures can be performed on the spot, and the user can immediately obtain the desired name selection result, so that the use can be promoted and sales can be expected to improve. In addition, renaming and entertainment names that have been difficult in the past will be possible, and further sales increase can be expected.

FIG. 1 shows an embodiment according to the invention of claim 1 in a transition diagram of a user screen by a web browser. When the user inputs or selects items necessary for selecting a name according to the screen description, the number of name candidates that meet the selection condition, the number of specific examples of names in each candidate, and the price are displayed. The user selects one of the candidates in consideration of these conditions. Once you have made a payment with a credit card after selection, the name candidates you want will be displayed immediately. If necessary, other candidates can be purchased as well.

  FIG. 2 shows an embodiment according to the invention of claim 2 in a transition diagram of a user screen by a Web browser. The user inputs necessary information to select a name according to the explanation on the screen, and at that time, "reading" of the desired name is entered in an input box delimited by squares. Enter the desired “reading” in Hiragana or Katakana in this part. As a basic rule, you have to fill in the “reading” that you do not want to break into kanji. In addition, please fill in several squares for readings that can be divided. When the “search” button is pressed after the input is completed, the name candidate kanji is searched based on the input “reading”, and the number of candidate names, evaluation points, price, and the like are displayed. When the user presses the “order” button according to the displayed conditions, the credit card settlement is started, and the desired “reading” name candidate is displayed immediately after the settlement is completed. You can also purchase names with different “reading” if necessary.

FIG. 3 shows an embodiment of the invention of claim 3 in a transition diagram of a user screen by a web browser. In order to select a name other than the real name, such as a stage name or a calligraphy, this time, the user inputs the necessary information to select the name according to the screen explanation. (1) The last name provided with the input of the desired last name Fill in the candidate space. (2) Choose from multiple choices of occupations that use names. An input field is added, so enter it here as a condition and press the "Search for surname" button. Then, only the last name that can be used for the desired job category is automatically selected and displayed. If you further narrow down the last name and press the “Search Name” button, the name that matches the last name and the desired condition is searched, and the number of specific examples of the name, the evaluation score, and the price are displayed. When you press the “Order” button, you will be transferred to credit card payment. When payment is completed, the best name candidates for your desired last name and job type will be displayed. You can also purchase names with different desired surnames as needed.
In this way, the user can purchase an optimal name immediately online while making the value judgment of the name himself by inputting interactively via a Web browser.

A specific example of the present invention will be described with reference to a program flow diagram based on an actual Web site. This flow diagram is based on three-tier computing, the most basic computer architecture today for Web services. Display and processing on the user computer's Web browser in the "User Screen" column, processing on the data center side Web server in the "Internal Program" column, and processing of the database server that stores data in the "Database" column The data flow described and flowing between the servers is indicated by arrows along with the data format. The basic is sequential time-series processing.

First, the first invention (invention 1) will be described with reference to flowcharts 1 to 12.
First, the user accesses the site of the present invention from the web browser of the personal computer, selects the surname (surname) in Kanji from the input screen of U010, selects the date of birth from the pull-down menu, and selects the gender by radio button. "I press the button. Immediately by the server internal program P010, the last name is digitized to (X, Y) based on the first and last name judgment rule (Appendix 1). Using P020, name candidates (An, Bn) are extracted with reference to the last name / name stroke number database (Appendix 2) of the database server using (X, Y) value and gender (SEX) value as keys (D010). The number (M) of candidates extracted by P025 is calculated. If the gender (SEX) is male and the number of candidates (M) is less than 4, the shortage is extracted from the female candidates. (P026, D015) In that case, the candidate rank is given priority to the candidates that were originally in the boys, and then the one extracted from the girls candidates is added. This is the principle of first name and last name judgment, and the female stroke number candidate can also be used for boys. The reverse is due to an impossible law. (P027, P028) If the number of candidates is zero (M = 0), an error screen (U020) is displayed and automatic selection is refused. Next, the number (N) of specific name examples in each stroke number candidate is calculated by P030. Using the gender (SEX) and the number of name strokes (An, Bn) as keys, the number of specific names (Nn) is counted by D020 while referring to the name stroke number / specific name candidate database (Appendix 3) of the database server. If a specific example is not described in the database by P035, it is deleted from the candidates and the candidate rank is advanced. Next, the evaluation score of each candidate is calculated by P040. The rules for assigning evaluation points are as shown in FIG. Basically, the number of strokes determined based on the principle of first and last name determination is subdivided and replaced with evaluation points. This is weighted by age, weighted by gender and age, and the average value is taken as the final score. Next, the amount of money is calculated by P050. The data generated so far is taken as a reservation number (R) (P060) and stored in the database as reservation data. (P065) The role of the reservation data is (1) session management of the subsequent user screens (2) preventing duplicate purchases at the time of additional orders (such as purchase of other candidates, purchases by siblings, etc. at a later date). (3) Improved response by reducing the program load at the time of additional purchase. Especially in session management, there is also a role of not showing the name stroke number data to the user until the order is confirmed and the payment of the price is completed. (If the number of strokes is known, the name selection operation is the same as having been completed in half, and there is a possibility that the user uses only this data and does not purchase the name.) When the reservation registration is completed, the search result screen U030 is displayed. The user decides which candidate to purchase based on this screen information. The candidate number determined to be purchased by the user is transmitted to the Web server, and the user's mail address (MAIL) is additionally registered in the reservation database by P080, and a confirmation screen U040 is generated. When the user approves P040, the order is determined, and the number of name strokes (An, Bn) matching the candidate selected from the reservation database is acquired by P070, and is registered in the sales database by P090 via P075, P080. At this time, the settlement is not completed and the status is recorded as “unsettled”. The role of the sales database is as follows: (1) Purchasing records when credit settlement is not successful. (2) Maintaining purchase history during support. Thereafter, data to the credit card settlement company is generated by P100, and the data is taken over by P110. U050 is an example of credit settlement. The entered data is processed by the payment company, and the payment result (approval / rejection) is returned to the server. The status is updated in the sales database by P120 and P130, and the order data is called by D030. If so, an error screen U055 is displayed and the process ends. If “approved”, the process proceeds to P140, and the specific name (MEI) is extracted from the name stroke number / specific name candidate database using the gender (SEX) and the name stroke number (A, B) as keys. Next, the first and last name judgment result of the name selected using the existing last name judgment program is generated from the last name (X, Y) and the name (A, B). (P150) At this point in time, the “name example” as the name selection result and its “first and last name determination result” are sent in the mail format. (P160) The result screen U060 is also displayed. When the display is completed, the status is updated to “completed name selection” in the sales database.
If you wish to continue purchasing other candidates from the selection result screen U060, the reservation number (R), purchased candidate number (n), number of purchased name strokes (A, B) ) As a key to extract other candidate information. In P190, the number of candidates is corrected except for purchased candidates, and in P200, the price is adjusted. In this example, if the number of specific names is 5 or less, it is free, but means such as discounting can also be executed. Other candidates generated in this way are displayed as a re-search result screen like U070. Here, when the user selects a purchase candidate, a confirmation screen U080 is generated by P210, and when an order is confirmed, the number of name strokes (An, Bn) is called by P220 and recorded in the sales database in P230 to P250. However, the order number (S ') is the parent number (S) with a hyphen attached to facilitate later inquiry support. Thereafter, the program from the credit card settlement to the completion of the selection is the same as the first program, and therefore will be omitted.
The above is usually based on the expected purchase behavior of the user, but in the case of selecting a newborn, the wife wants to make a decision after conducting a preliminary survey in the daytime web browser and the husband consults after returning home There is also a demand. In order to deal with such a case, it is necessary to advance to the reservation screen once and put it on hold so that it can be started later from the purchase screen. U090 is a screen for resuming orders received up to the reservation. When the reservation number is input, the reservation contents are extracted from the reservation database by P260 and displayed from the search result screen U030. In addition, a re-purchase screen U100 is prepared in the case where one purchase is made and another item is desired to be purchased later. In the case of re-purchasing, it is necessary to present candidates without duplicate purchases while comparing the contents of the reservation database and the sales database. Programs P270, P280, and P290 are prepared for this purpose. As a result, only candidates that have not been purchased so far are displayed and displayed as a sibling search screen (U110) on a Web browser. Since the purchase after this is the same as P210 and later, it is omitted.
In the description of this specific example, the maximum number of candidates is 4. However, if the number of registered last name / name stroke number databases is increased, the total number of candidates can be increased.

Next, the second invention (claim 2) will be described with reference to flowcharts 13 to 18.
A specific example will be described in the case where a specific name candidate is searched for by specifying how to read the name. First, the input screen (U510) will be described. When “reading” is designated, the most difficult thing is inputting “reading” and “corresponding to kanji”. First, regarding “reading”, it is easy to input “reading” in plain text in hiragana / katakana and mechanically divide it into several kanji patterns by the program, but in reality the user ’s “reading” and “kanji” "Is something that is imagined to some extent in my head, and what is determined mechanically often does not come as a person's name. For example, when the boy name is “Yasunori”, most of them are asked to select “Yasu” and “Nori” in two kanji. Also, if you wish to have “Ayako” as your girl ’s name, you do n’t know whether you want “Aya” or “Ko” for 2 kanji characters, or “A”, “Ya”, or “Ko” for 3 kanji characters. Therefore, for efficient search, it is convenient to ask the user to specify the kanji division range intentionally at the “reading” input stage. Therefore, in the present invention, the “reading” input field is provided as □□□□□, and input is made within a range that the user does not want to divide. There is also a prohibition in Japanese. For example, in the case of “n”, there is no single kanji or kanji that begins with “n”, and it naturally corresponds to the kanji “○”. The roaring sounds such as “Yu” and “Yo” are the same, and they always correspond to the kanji characters “Yu ○” and “○ ○ ○” with the characters before and after. These forbidden processes can be easily executed by a program, but according to the experience of the inventor, the user should enter “Syuichi” with carelessness, but “Syuichi” may be entered incorrectly. It is clear that the results are output even if it is automated, and the user side is forced to input correct readings. If it is entered incorrectly, it can be checked whether it is in the format of “○○”, and a warning can be issued. The above-described programs P010 to P028 are executed based on the input conditions as described above, and first, it is determined whether there is a number of name strokes based on the number of candidates (M). If there is no candidate, an error screen (U520) is displayed and the process ends. If there is a candidate number of strokes, first, a “reading array” for making “reading” correspond to kanji is generated. By P520, the input “reading” for 5 squares is made an array of @Yomi (a, b, c, d, e), and each array element is combined into 5 types of “reading array” (@ Yomi0 = abcde: Only this is a scalar value, the rest is a two-element array, @ Yomi1 = (a, bcde), @ Yomi2 = (ab, cde), @ Yomi3 = (abc, de), @ Yomi4 = (abcd, e) ) Is generated. For example, if you entered `` ma '', `` ko '', `` to '', @ Yomi = (Ma, Ko, and), @ Yomi0 = (Makoto), @ Yomi1 = (Ma, Koto ), @ Yomi2 = (Mako, and). Here, it is divided into two elements because the name is based on a two-character name in the first and last name determination as described in FIG. Name stroke number candidates are also expressed as an array (An, Bn) based on two-letter names (initial and final characters). Then, what about three-letter names? In the case of surname determination, it is considered that the last part of the name is divided into two or more characters. In other words, in the case of a name selection, there is a thing in which two characters are registered as one set in the “Kanji → reading database” (Appendix 3) for the number of retained characters Bn, and this is used as one character. More specifically, the 10 strokes of data include “Riko”, “Riko”, and “Riko”, and “Yuriko” is the number of strokes (5, Even if specified in 10), Yuriko, Mariko, and Mariko can be extracted as candidates if they are decomposed into only two elements, “Yu” and “Riko”. ("Yu" is in the data of 5 strokes) Therefore, it is only necessary to handle one-character names and two-character names as names. In P530, “reading arrangement” is converted to “kanji arrangement”. If there are M name candidates suitable for the last name (X, Y) and there are name stroke numbers (An, Bn) as the nth candidate, “reading arrangement” for each name stroke number An (or Bn) Whether or not there is a specific kanji corresponding to each array element is checked from the kanji → reading database (Appendix 3), and the kanji is extracted. Here, when Bn = 0 (that is, one character name), only @ Yomi0 is applied, kanji matching @ Yomi0 is extracted from the kanji candidate data of the stroke number An, and stored in an array @KanjiAn (@ Yomi0). When B is not 0, @ Yomi1 to @ Yomi4 are applied as the two-character name, and @ Yomi1 [0], @ Yomi2 [0], @ Yomi3 [0], @ Yomi4 [0] ( The meaning of [0] is the first element of each array), and KanjiAn (@ Yomi1), @KanjiAn (@ Yomi2), @KanjiAn (@ Yomi3), @KanjiAn (@ Yomi4) Is stored in the array. Similarly, from the kanji candidate data of stroke number Bn, it matches @ Yomi1 [1], @ Yomi2 [1], @ Yomi3 [1], @ Yomi4 [1] ([1] means the second element of each array) Are extracted and stored in arrays @KanjiAn (@ Yomi1), @KanjiAn (@ Yomi2), @KanjiAn (@ Yomi3), and @KanjiAn (@ Yomi4), respectively. To explain this process with a specific example, for example, if the last name is Nakamura and “Hiro”, “Aki” and “Reading” are specified, the optimal number of strokes for the last name (4,7) is (17,4) So, @ Yomi1 = (Hiro, Aki), @ KanjiAn = (Ya, Yu) (Kanji that can be used for the names of 17 strokes that can be read as “Hiro”), @ KanjiBn = (husband, suke, public, day) ( In both cases, kanji that can be used for the names of four strokes that can be read as “aki” are extracted. Next, in P540, a specific name is generated by combining the obtained sequences. When Bn = 0, since it is a single character name, the extracted Kanji character array @KanjiAn (@ Yomi0) is used as the specific name @KanjiAnBn. If B is not 0, the image elements of @kanjiAn (@YomiQ) and @kanjiBn (@YomiQ) (Q = 1, 2, 3, 4) are replaced with the initial (stroke number An) and retained characters (stroke number Bn). The specific name @KanjiAnBn is generated by combining them while maintaining the order. For example, in the case of the above-mentioned `` Hiroaki Nakamura '', (Miya, Yu) and (Husu, Yusuke, Komon, Sun) are combined (Yao, Yusuke, Yakou, Yahi, Yuo, Yusuke, Yuko, Yuhi) ) Is generated. In P550, the number Nn of name candidates to be notified to the user is calculated for each candidate. This only counts the number of elements in @KanjiAnBn. Next, a price (YENn) is set based on the number of candidates Nn by P560. If there is no specific name candidate for any candidate at this time, an error screen U525 is displayed as an error and the process ends. If it is not an error, all the data is provisionally registered in the “reservation database” via P570 and P580, the search result display screen U530 is displayed, and the user is prompted to select a candidate. When the user selects a candidate, an order confirmation screen U540 is generated by P590. When the user confirms the order, it is registered in the “sales database” via P600, P610, and P620. Thereafter, as in the first invention (P100 to P130), credit card payment is performed, and if the payment is rejected, an error screen U055 is displayed and the process ends. If payment is approved, P640 generates an appraisal text for surname / name judgment from the number of surnames and genders (X, Y, SEX, A, B), and specifies the selected name and appraisal text by the user At the same time as sending an email to the email address, the result screen U560 is displayed. If the user also desires other candidates at this time, another candidate is extracted from the reservation database again by P670, the search result screen is displayed, and the same process as described above is repeated.

Next, the third invention (claim 3) will be described with reference to flowcharts 19 to 25.
A specific example will be described in which a desired surname and a profession to which the name is applied are specified, and a specific name candidate is searched for a name suitable for the profession (such as a stage name, a calligraphy name, an elegance, a name of Genji). In this case, different from the normal selection, the name is given so that the part (arrangement of celestial paintings, human paintings, and ground paintings in FIG. 1), which is said to be the arrangement of the three-year-old, becomes a special pattern in judging the first and last names. This pattern can be divided into four categories depending on the job category to which the name is applied. In such a name selection, the user usually wants to change the last name, and it is difficult to select the name unless the last name is changed. Therefore, first, the desired last name is heard, it is confirmed that the last name matches the desired job type, and then the name is selected according to the last name decided earlier. Conversely, a desired name can be determined and a surname matching the name can be selected. However, in this embodiment, the former pattern will be described in order to be consistent with the above-described two inventions.
U010 is a user input screen. The user inputs a desired surname candidate together with his / her information (first name, last name, gender, date of birth, etc.). One last name candidate can be input per square, and multiple candidates can be input collectively. Next, select the job type that uses the name from 4 patterns. In this example, there are four selections: stage name 1 (technical expert ability type), stage name 2 (a flashy and prominent type), brush name (pen name of novelist and writer, calligrapher and painter, etc.), and magician. Among the input data, a combination (Xp, Yp) of the surname strokes optimal for the selected occupation is extracted from the “stage name database” (Appendix 5). (P1010) Next, the number of strokes of the inputted surname candidate is determined by the “kanji database”, and the surname name stroke number (Xn, Yn) is obtained from the existing surname determination program. (P1020) Of (Xn, Yn), only those that match (Xp, Yp) are extracted and classified as the first pattern and the second pattern. (P1030) If there is no match at this point, a no-candidate screen (U1015) is displayed as an error and the process ends. If they match, the last name selection screen is displayed. (U1020) On the last name selection screen, if there are multiple patterns, select one. (If there is only one pattern, ask `` Confirm '') When one pattern (Xn, Yn) is selected, the number of name strokes (An, Bn) suitable for the last name (Xn, Yn) is now selected from the `` Entertainment database '' ) (P1040) Since there may be a plurality of name strokes found here, the first candidate, the second candidate, etc. are set in the order of discovery. For each retrieved number of name strokes (An, Bn) and gender (SEX), the number Nn of specific examples of names is calculated from “name stroke number → specific name candidate database”. (P1050) Next, for each candidate, the first and last name is determined by the first and last name determination program, and the evaluation score is calculated. (P1060) Further, the price (YEN) is assigned by the number of candidates Nn. (P1070) The results so far are stored in the reservation database by P060 and P1080, and the name candidate selection screen (U1030) is displayed. When the user makes a comprehensive judgment based on the number of names, evaluation points, prices, etc. in each candidate and selects one candidate number, P1090 adds the user's email address to the reservation database, and then generates a confirmation screen U1040. When the user confirms the order contents, necessary information is extracted from the reservation database by P1100, and the order reception result is recorded in the sales database by P1110, P080, and P1120. After this, the existing credit card payment processing (similar to P100 to 160) is performed, and when the payment is approved, the name selection result is mailed to the user's e-mail address, and the name selection result (U1060) is also displayed on the user screen. ) Is displayed. After the display is completed, the processing completion status is recorded in the sales database. After the name selection result (U1060) is displayed, if the user also wishes to purchase another candidate, the other candidate is extracted from the reservation database by P1140 and the re-search screen (U1070) is displayed. (If there are no other candidates, the “No candidate” screen is displayed.) If purchase is selected here, the above is repeated (P1090 to 1110), and P240 and P1150 are used for the sales database. The order number is recorded as a branch number with a hyphen. The following is a common flow diagram.

In addition to a system using a Web browser and the Internet, it can also be applied to a system using dedicated terminal software, a dedicated network, and a server. For example, it can be applied to browser software such as BML for digital television, CATV network, and servers in CATV broadcasting companies.

User screen transition diagram for general selection User screen transition diagram when selecting a name by specifying "Reading" User screen transition diagram in stage name selection Figure 1 shows the number of strokes for surname and name by Yamamoto's first and last name judgment. Figure 2 shows the structure of last name → name stroke number database (excerpt). Figure 3 shows the number of name strokes → specific name candidate database configuration (excerpt) Figure 4 shows how to calculate the evaluation score based on Yamamoto's first and last name judgment. Figure 5 shows the structure of kanji → reading database (excerpt). Figure 6 shows the structure of the stage name database (excerpt). FIG. 1 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 2 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 3 is a flow diagram of a data program according to an embodiment of the invention of claim 1 FIG. 4 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 5 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 6 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 7 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 8 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 9 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 10 is a flowchart of a data program according to an embodiment of the invention of claim 1 FIG. 11 is a flowchart of a data program according to an embodiment of the invention of claim 1 Flow diagram of data program of specific example of invention of claim 1 Flow chart of data program of specific example of invention of claim 2 Flow chart of data program of specific example of invention of claim 2 Flow chart of data program of specific example of invention of claim 2 FIG. 16 is a flowchart of a data program according to an embodiment of the invention of claim 2 Flow chart of data program of specific example of invention of claim 2 FIG. 18 is a flowchart of a data program according to an embodiment of the invention of claim 2 FIG. 19 is a flowchart of a data program according to an embodiment of the invention of claim 3. FIG. 20 is a flowchart of a data program according to an embodiment of the invention of claim 3 FIG. 21 is a flowchart of a data program according to an embodiment of the invention of claim 3 Flow chart of data program of specific example of invention of claim 3 FIG. 23 is a flowchart of a data program according to an embodiment of the invention of claim 3 FIG. 24 is a flowchart of a data program according to an embodiment of the invention of claim 3 FIG. 25 is a flowchart of a data program according to a specific example of the invention of claim 3.

Explanation of symbols

In each flowchart, the user screen is displayed in Uxxx, the internal program number of the Web server is displayed in Pxxx, and the program number of the database server is displayed in Dxxx. The numbers displayed in parentheses are the common program numbers used in the previous flow diagrams.

Claims (3)

In the automatic name selection system that displays the optimal name by judging the first name and last name by accessing the server via a web browser and entering the information necessary for selecting the last name (last name), gender (sex), date of birth, etc. Name candidates are automatically searched from a predetermined algorithm and database based on the input conditions, and the search results are displayed on the web browser screen as “first candidate, second candidate,...” By displaying at least one of “Recommendation Order”, “Number of Specific Examples of Names”, and “Numerical Evaluation by First / Last Name Determination” and “Sales Price”, it is possible to give the user a condition for value determination and facilitate selection of candidates, and then make online payment The automatic name selection system that can receive the name selection result immediately. The system according to claim 1, wherein a name "reading" can be input as a user request, and an automatic name selection system for selecting a name that matches the "reading". By entering hiragana or katakana in the (input field) and combining “reading” for one square sequentially from the top, “reading” corresponding to 1 to 3 kanji characters is automatically generated, and the first name and surname calculated separately An automatic name selection system that extracts kanji that matches “reading” from kanji data of the corresponding number of strokes in the kanji database and automatically generates names by combining each kanji while referring to the optimal combination of name strokes. In the system of claim 1, “user's name or purpose” such as a stage name, a brush name, an elegant name, or a popular name can be selected and input as a user request, and any desired “last name” or “name” can be input. An automatic name selection system characterized by doing so.

Images