Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
Dex: A Semantic-Graph Differencing Tool for Studying Changes in Large Code Bases
ICSM '04 Proceedings of the 20th IEEE International Conference on Software Maintenance
On Graph Features of Semantic Web Schemas
IEEE Transactions on Knowledge and Data Engineering
Selected Works of A.N. Kolmogorov: Volume III Information Theory and the Theory of Algorithms
Selected Works of A.N. Kolmogorov: Volume III Information Theory and the Theory of Algorithms
An improved approach to extract document summaries based on popularity
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
Hi-index | 0.00 |
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.