JP3090285B2 - Message search device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a message retrieval apparatus for retrieving a required message from a message database, and more particularly to a retrieval of a congratulatory message or the like in which the relationship between a message sender and a destination is important. The present invention relates to a message search device that can be effectively applied in a case.

[0002]

2. Description of the Related Art There are cases in which a telegram message (message) of a wedding celebration or condolence is selected from a set of example sentences prepared in advance. In this selection, the relationship between the sender and the destination (recipient) of the message is important. Has meaning.

Conventionally, a type of message in which the relationship between the sender and the destination of such a message has an important meaning,
In a message search device that searches a message database (message DB) based on a relationship with a destination, a specific relationship between a sender and a destination is added to each message in the message DB as additional information. Search messages directly based on the relationship.

FIG. 5 is a basic block diagram of a conventional example of such a message search device. The message search device 21 adds a message about a specific relationship between a sender and a destination to a message and uses the message DB2 as a database.
2, search condition input unit 23, message DB search unit 24,
It comprises a display unit 25.

When searching for a message, "friends"
"Relative", "Colleague", "Boss", "Subordinate", "Account"
Is sent from the search condition input unit 23 and passed to the message DB search unit 24. The message DB search unit 24 uses the input specific destination as a keyword as a message DB 22
And outputs the matched message to the display unit 25 for display.

For example, it is assumed that the message DB 22 is a database of messages relating to a wedding celebration and has the contents as shown in FIG. In the figure, 31 is a message number, 32 is a message, and 33 is destination information. In this example, whether or not transmission is possible to six types of destinations such as "friends" and "relatives" is shown.

[0007] In this example, when "friend" is input as the destination, the message DB search unit 24 outputs "friend".
, That is, the third, fourth, and sixth messages are retrieved and displayed on the display unit 25.

[0008]

In the configuration of the conventional message search apparatus as described above, since it is necessary to consider all destinations for each message in the message DB, a new message is not transmitted. Message D
When adding to B, it is necessary to check whether or not transmission is possible with respect to all destinations, and to add the information to the message. In addition, when a new relationship with the destination appears, all the messages in the message DB must be re-attached with information on the relationship with the destination.
As described above, maintenance for adding a new message and a relationship with a new transmission destination is very troublesome.

Therefore, an object of the present invention is to provide a message which can be searched for by inputting a relationship with a destination as in the prior art, and which is easy to maintain for adding a message and adding a relationship with a destination. A search device is provided.

[0010]

[Means for Solving the Problems] When selecting a type of message in which the relationship between the sender and the destination, such as a wedding celebration or condolence message, is important, the politeness that the recipient (destination) feels from the content of the message. The degree of intimacy is an important selection criterion. Then, depending on the relationship with the destination, the degree of politeness and intimacy appropriate to the message is naturally determined from social common sense.

The present invention focuses on the correlation between the politeness and intimacy of such a message and the relationship between the sender and the destination of the message, and provides a message search device with a politeness and a politeness indicating the politeness of the content of the message. A message database having a database in which intimacy indicating friendliness is added, an input means for inputting a relation between a message sender and a destination, and a relation between the input destination and the message intimacy or politeness Mapping means for mapping to the search condition expressed using one of the less frequent,
The object is achieved by including a search unit for searching a message database for a message that matches the mapped search condition, and a display unit for displaying the searched message.

[0012]

When a specific relationship between a message sender and a destination, for example, "friend", "boss", "business partner", etc., is input from an input means, the relationship with the destination is determined by the mapping means. Alternatively, it is mapped to a search condition using one or both of intimacy. And
Searching of the message database using the mapped search condition is performed by the search means, and a message having politeness and intimacy matching the search condition is displayed by the display means. As described above, according to the message search device of the present invention, a message related to congratulations or the like, in which the relationship between the sender and the destination of the message is important, is compared with the conventional message search device based on the relationship with the specific destination. You can search similarly.

Further, in the message search apparatus of the present invention, each message in the message database is added with information on the politeness and intimacy of the message in place of the specific destination information. Since the message database is searched according to the search condition expressed by using, it is not necessary to consider the possibility of all destinations for each message, and when adding a new message, the message is referred to by its politeness and parental level. It can be dealt with simply by adding density to the message database and when a relationship with a new destination appears, it is possible to simply map the relationship with the destination to the search condition without changing the message database at all. This can be dealt with simply by adding rules (mapping rules). Therefore, the message search device of the present invention is much easier to maintain than the conventional message search device.

[0014]

Embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a basic block diagram of a message search device according to one embodiment of the present invention. In the message retrieval device 1 shown in FIG. 1, the message DB 2 adds, as additional information, politeness and intimacy, which express the politeness and intimacy of the message by numerical values, to a message whose relationship with the destination is important. This is a database. The search condition input unit 3 is used for inputting a relationship between a message sender and a destination (a specific relationship between friends, relatives, business partners, and the like) when searching for a message. The search condition mapping unit 4 uses a search condition (a search condition expression) that expresses a relationship with a specific destination input from the search condition input unit 3 using one or both of politeness and intimacy according to the mapping rule 4A. ) And passed to the message DB search unit 5. The mapping rule 4A is a rule for mapping a relationship with a specific destination to a search condition (search condition expression) based on intimacy or politeness, and is incorporated in the search condition mapping unit 4 as illustrated. Alternatively, it is stored in an external auxiliary storage and referred to by the search condition mapping unit 4. The message DB search unit 5 uses the mapped search condition (search condition expression)
2 is a part for searching and outputting a message having additional information matching the search condition to the display unit 6. The display unit 6
This is a part for displaying the retrieved message and the like. In addition,
Such a message search device 1 can be easily realized by software on hardware of a general computer system including a CPU, a memory, and the like.

FIG. 2 shows an example of the contents of the message DB2. In the figure, 10 is a message number, 11 is a message, and 12 and 13 are information on politeness and intimacy given to the message. This example is a database of messages relating to a wedding celebration, and the politeness and intimacy are classified into five levels and assigned as numerical values to each of the six messages. A message with a larger value indicates that the recipient (destination) feels more polite or intimate.

FIG. 3 shows an example of the contents of the mapping rule 4A. In the figure, 15 is a rule number, 16 is a destination, 17 is a condition of politeness, and 18 is a condition of closeness.
In this example, one rule is set for each destination of friends, relatives, colleagues, bosses, subordinates, and business partners. Each rule is based on social common sense that, for example, if the destination is a "friend", a message that feels intimacy is good, if the destination is "business partner", a message that feels the most polite is good, etc. It has been decided.

FIG. 4 is a flowchart showing the flow of the message search process. Next, referring to FIGS. 1 to 4,
Processing for searching for a wedding gift message to be sent to a "friend" will be specifically described.

First, the relationship with the destination is input from the search condition input unit 3 as "friend" (step 1).

The search condition mapping unit 4 checks the mapping rule 4A, obtains a rule matching the input destination "friend" (step 2), and applies the obtained rule to match the "friend" to the degree of politeness. Alternatively, mapping is performed to a search condition (expression) using intimacy (step 3).

In the example of the mapping rule shown in FIG.
Since the first rule is obtained for “friend”, it can be understood that “intimacy ≧ 4” is a search condition (search condition expression) by applying this rule.

Next, the message DB search unit 5 uses the search condition (expression) obtained in step 3 to store the message DB 2
Is retrieved (step 4), and the retrieved message is output to and displayed on the display unit 6 (step 5).

In the example of the message DB shown in FIG. 2, the third, fourth, and sixth messages that match “intimacy ≧ 4” are searched and displayed. The sender will ultimately choose.

In the example of the mapping rule shown in FIG. 3, each destination rule is mapped to a search condition using only politeness or intimacy. It goes without saying that rules that map to search conditions using both densities can be set.

Next, maintenance of the message search device 1 will be described.

First, a maintenance method for adding a new destination will be described. As an example, consider a case where a school teacher or the like can search for a message to be sent to a "student". Since the mapping rule example shown in FIG. 3 does not have the destination “teacher”, even if “teacher” is input as it is, the rule cannot be acquired in step 2 of FIG. 4 and the search fails. Therefore, from the common sense that “the student” is “current” to the teacher and the politeness of the message sent from the teacher to the “student” does not need to be high, if “the student”, “politeness ≦ 4” Rule 7
The rule is added to the mapping rule 4A as the third rule.
Then, when "teacher" is input as the destination, the seventh rule is obtained in step 2, and as a result, the first, second, third, and sixth messages shown in FIG. 2 are searched. As described above, only by adding a rule to the mapping rule 4A, it is possible to deal with a new destination without changing the message DB 2 at all.

Next, a maintenance method for adding a message will be described. For example, if you add the message "Always talk with each other and build a happy home. I am looking forward to the birth of the second generation." You can evaluate the politeness and intimacy of this message as 3, for example. Then, this message is added to the message DB 2 as the seventh message, with the intimacy degree 3 and the politeness 3 added. In this way, when a friend, relative, or subordinate is input as a destination, the seventh message is also displayed. In this way, it is possible to easily add a message.

In this embodiment, the message relating to a wedding celebration has been described as an example. However, the present invention is applied to a message relating to condolences and other types of messages in which the relationship between the sender and the destination is important. The same applies.

Further, in addition to the relation with the destination, information such as the sex of the sender is added to the message database,
Naturally, it is also possible to enable a search based on the gender of the sender.

[0030]

As described above, according to the present invention,
As with the conventional message search device, messages can be searched based on the specific relationship between the message sender and the destination, and maintenance for adding a new message and the relationship with the destination is extremely easy. Message retrieval device can be realized.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a basic configuration of a message search device according to one embodiment of the present invention.

FIG. 2 is an explanatory diagram of a content example of a message database in the embodiment.

FIG. 3 is an explanatory diagram of an example of a mapping rule in the embodiment.

FIG. 4 is a flowchart of a message search process in the embodiment.

FIG. 5 is a block diagram showing a conventional example of a message search device.

FIG. 6 is an explanatory diagram of a content example of a message database in the conventional example.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 Message search apparatus 2 Message database (DB) 3 Search condition input part 4 Search condition mapping part 4A mapping rule 5 Message DB search part 6 Display part 10 Message number 11 Message 12 Politeness 13 Intimacy 15 Rule number 16 Destination 17 Politeness Condition 18 Intimacy condition

──────────────────────────────────────────────────続 き Continuing on the front page (72) Inventor Tsuneaki Kato 1-1-6 Uchisaiwaicho, Chiyoda-ku, Tokyo Nippon Telegraph and Telephone Corporation (72) Masahiro Oku 1-16-1 Uchisaiwaicho, Chiyoda-ku, Tokyo Japan (56) References JP-A-64-38876 (JP, A) JP-A-63-101963 (JP, A) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06F 17 / 30

Claims (1)

(57) [Claims] 1. A message database in which a message is added with information of intimacy indicating the degree of familiarity of the contents and politeness indicating the degree of politeness of the message, and a message database between the message sender and the destination. Input means for inputting a relationship, mapping means for mapping the relationship with the destination input from the input means to a search condition expressed using at least one of intimacy and politeness, and A message search device comprising: a search unit for searching a message database for a message that matches a mapped search condition; and a display unit for displaying the message searched by the search unit.