Abstract
Iterated semantic translation as reflected in dual space of two different languages provides - through a normalized reference set of dictionary expressed vocabulary that is inclusive of double sided link direction correspondence - a mechanism for assessment of word extent breadth and meaning delineation. This measure resolves according to the number of source language passages in round translating steps, until content exhaustion. Semantic clusters emerge in above procedural format through graph decomposition of the united word set above language pair to isolated segments of connected semantic vertices. Such a linkage is also present in single language morphological context of thesaurus format with enumerated word content proximity, typically farther subjected to additional support that arises from accompanying clauses, applied level of grammatical compatibility, and overall linguistic usage purity. Resorting to algorithmic reverberation and numerical case studies on stochastic data samples, it is argued that resemblance of contained and mirrored semantic vertex structures follows cultural interaction, although shadowed at various degrees of virtualization, in evolving linguistic relation that ultimately leads to a knowledge cohesion level frame of scientific depth. Since it has been known that complexity information depth as content purity grade paraphrases itself in Kolmogorov efficiency sense, either to stability measure of fixed structures or manifests as a catalytic growth factor in nurturing substances, this work provides a particular instantiation in topological context of semantic graphs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Shiryaev, A. (ed.): Selected Works of Andrey Kolmogorov: Information Theory and Theory of Algorithms. Springer, Heidelberg (1993)
Minsky, M. (ed.): Semantic Information Processing. MIT Press, Cambridge (1968)
Sowa, J.F. (ed.): Principles of Semantic Networks: Explorations in the Representation of Knowledge. Morgan Kaufmann Publishers, San Francisco (1991)
Theoharis, Y., Tzitzikas, Y., Kotzinos, D., Christophides, V.: On Graph Features of Semantic Web Schemas. IEEE Transactions on Knowledge and Data Engineering 20(5), 692 (2008)
Floyd, R.: Algorithm 97: Shortest Path. Communications of the ACM 5(6), 345 (1962); Warshall, S.: A theorem on Boolean matrices. Journal of the ACM 9(1), 11 (1962)
Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)
Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)
Raghavan, S., Rohana, R., Leon, D., Podgurski, A., Augustine, V.: Dex: A semantic-graph differencing tool for studying changes in large code bases. In: Proceedings of the 20th IEEE International Conference on Software Maintenance, pp. 188–197. IEEE Computer Society, Los Alamitos (2004)
Ramamritham, K., Chrysanthis, P.: Semantics-based Concurrency Control. In: Encyclopedia of Database Systems 2009, p. 2591 (2009)
Kumar, A., Kumar, P., Rao, S., Reddy, K.: An Improved Approach to Extract Document Summaries Based on Popularity. In: Bhalla, S. (ed.) DNIS 2005. LNCS, vol. 3433, pp. 310–318. Springer, Heidelberg (2005)
Takagi, M.: Translation Routes and Implicit Language Structure of Japanese and Korean, thesis work, International Christian University Library (2008)
Mikami, N.: Popularity-based Approach to Automatic Extraction of Abstracts from Chinese Text Documents, thesis work, International Christian University Library (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pichl, L. (2010). Semantic Network Closure Structures in Dual Translation of Stochastic Languages. In: Kikuchi, S., Sachdeva, S., Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2010. Lecture Notes in Computer Science, vol 5999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12038-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-12038-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12037-4
Online ISBN: 978-3-642-12038-1
eBook Packages: Computer ScienceComputer Science (R0)