An Algorithm of Semantic Representation Assembly
An algorithm transforming a matrix semantic-syntactic representation Matr of a natural language text into a formal expression Semrepr ∈ Ls(B), where B is the conceptual basis being the first component of the used marked-up conceptual basis Cb, and Ls(B) is the SK-language in the basis B, was called above an algorithm of semantic assembly. This chapter describes (a) an algorithm of semantic assembly BuildSem1, (b) an algorithm of semantic-syntactic analysis SemSynt1 being the composition of the algorithms BuildMatr1 and BuildSem1.
KeywordsSemantic Representation Input Text Semantic Unit Text Unit Natural Language Text
Unable to display preview. Download preview PDF.