Expert system of Chinese kinship relations
漢語親屬關係專家系統
Zhenyu Chen 陳振宇

Abstract 摘要
Expert System integrated with domain-specific knowledge and experience is an important topic in artificial intelligence in recent years. Our program about ES of Chinese kinship relations mainly compose of three parts: preparatory study, information extraction and reasoning, and applications. The integrated use of statistics and manual correction were adopted in the investigation on the Chinese corpus in order to construct Vocabulary - Syntax Knowledge Base which had an exhaustive list of relative names, relative verbs, and verbs about the events in which specific relations were built, and a list of all their various syntactic structures involved. The semantics of each structure was given by the predicate logic expression. This knowledge base was the basis of information extraction, that is, the syntactic templates used in information identification. Automatic matching by machine was also used in information extraction. The relative information extracted directly from statement was often incomplete, such as the known relations between A and B, B and C but unknown relation between A and C. Information reasoning was required in order to clarify all the relations entailed in text, including all possible ambiguity situation. Basing on the overall analysis of the semantic features and relations of Chinese kindred terms, this program had set up a kindred automatic reasoning model with first-order predicate logic. Seven basic semantic features were chosen at first as the foundation to derive the definitions of all kinship relations. And these features had served as predicates while the character involved as its variables. Then the semantic features of a certain kinship could be connected with disjunction and conjunction operators to form logic expressions of this relation. This was the semantic knowledge base of kinship relations. Finally we offered a succinct algorithm of kinship relation reasoning, including four steps of operation. In the first step, the logic expressions of two known kinship relations were joined together. In the second step, the laws of assistant operation provided all the information entailed in the logic expression. In step three, the laws of simplification operation changed the expression into a simplest one. In the last step, the answer was given from the simplest expression. All the answers deduced from reasoning were recorded in one database.

Article 文章

<< Back 返回

Readers 读者