An Efficient Implementation of Conceptual Structures

Abstract

This paper presents an efficient implementation of conceptual structures to build a practical knowledge-based natural language processing system. For efficiency, we represent conceptual structures with trees, which are called conceptual trees in this paper. The motive of the representation is to implement conceptual structures with frames, which are well known as a poweful tool for organizing our knowledge inside conputer. In addition, conceptual structures are so extended and restricted that they have the consistency and the simplicity of the representation. For the consistency, we exten set referents and redeifne the operation set join to manipulate them. For the simplicity, we put some restrictions on conceptual structures, including preorder expression - they put the head concept first. By experiment, we show that conputing time in performaing operations for conceptual trees is signigicantly reduced.