?
Theory of K-representations as a Tool for Designing File Managers with a Natural Language Interface
During last decade, semantic parsing of the instructions in natural language (NL) has become a significant branch of the studies aimed at creating semantics-oriented NL processing systems. A topical problem of the kind is designing file managers with a NL-interface. The principal attention in our previous papers was paid to creating new, more effective theoretical foundations of designing semantic parsers of NL-instructions. In particular, we suggested in a very concise form an original and broadly applicable algorithm of semantic parsing. This paper, firstly, illustrates a correspondence between input instructions and their semantic representations. Secondly, the main attention is given to describing mathematical foundations of executing NL-instructions by computer systems. The methodological basis for these results is the theory of K-representations (knowledge representations), Its basic formal model introduces a system consisting of ten partial operations on conceptual structures. There are solid grounds for conjecturing that, combining these operations in arbitrary order, it is possible and convenient to build step by step a semantic representation of arbitrarily complex sentence or discourse in NL. The stated theoretical results have become the basis for designing a file manager with a NL-interface NLC-2 (Natural Language Commander - Version Two).