On some universal algebras using in NL-semantics
by
Nina Suszczanska
Institute of Computer Science, Silesian University of Technology

During creation of a semantic representation of sentences in a natural language it is often need to use transformations, for which the results belong to a set of admissible constructions. One of the possible way is the definition of special universal algebras with fixed systems of generators. Then formal semantic constructions correspond to decompositions of elements from such algebra with respect to the fixed generator system, the semantic equivalence correspond to equality of decompositions in such algebra etc.

In the talk we discuss problems connected with constructions of such universal algebras for some natural languages such as Polish, Ukrainian and Russian.

Date received: May 24, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caee-75.