An Algorithm of Semantic Representation Assembly

  • Vladimir A. Fomichov
Part of the IFSR International Series on Systems Science and Engineering book series (IFSR, volume 27)


An algorithm transforming a matrix semantic-syntactic representation Matr of a natural language text into a formal expression SemreprLs(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.


Semantic Representation Input Text Semantic Unit Text Unit Natural Language Text 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Innovations and Business in the Sphere of Informational TechnologiesState University – Higher School of EconomicsMoscowRussia

Personalised recommendations