Constrained Semantic Grammar Enabled Question Answering System

Restricted domain question answering (QA) system is a hotspot in the natural language processing area. Correct understanding of the users' intentions is the key to such QA systems while open domain QA can always make use of data redundancy. In this paper, a robust but highly constrained semantic grammar and corresponding matching algorithm are proposed. On the basis of the domain ontology constructed by domain experts, the grammar experts creat the core semantic grammar, which describes patterns of expression about properties of concepts or relationships between concepts in the interested domain. In order to verify the validity of the proposed method, the method is applied to mobile service consulting area, experimental results show that the proposed method has strong practicability as well as maintainability.