Semantic Markov Chain Using Synonymous Mapping

Semantic communication is a promising direction for the future of communication systems. Synonyms act as crucial bridges between semantics and syntax. Inspired by this, this paper introduces a semantic Markov chain model based on state synonymous mapping. This paper demonstrates that the syntactic Markov chain can be transformed into a semantic Markov chain through synonymous mapping. The stationary distribution of the semantic Markov chain can be obtained by partly summing the stationary distribution of the syntactic Markov chain. Similarly, the transition probability of the semantic Markov chain can be obtained by performing a weighted summation of the transition probabilities of the syntactic Markov chain. Additionally, we theoretically proves that the sequence entropy and the entropy rate of the semantic Markov source are no more than those of the syntactic Markov source.

Authors

Institutions

Publication Details

Journal
Tsinghua Science & Technology
Published
2025-09-01
DOI
https://doi.org/10.26599/tst.2025.9010064
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Semantic Markov Chain Using Synonymous Mapping

Zijian Liang, Kai Niu, Jin Xu, Ping Zhang
Tsinghua Science & Technology
Natural Language Processing Techniques
article

Semantic Markov Chain Using Synonymous Mapping

Zijian Liang, Kai Niu, Jin Xu, Ping Zhang
article en

Abstract

Semantic communication is a promising direction for the future of communication systems. Synonyms act as crucial bridges between semantics and syntax. Inspired by this, this paper introduces a semantic Markov chain model based on state synonymous mapping. This paper demonstrates that the syntactic Markov chain can be transformed into a semantic Markov chain through synonymous mapping. The stationary distribution of the semantic Markov chain can be obtained by partly summing the stationary distribution of the syntactic Markov chain. Similarly, the transition probability of the semantic Markov chain can be obtained by performing a weighted summation of the transition probabilities of the syntactic Markov chain. Additionally, we theoretically proves that the sequence entropy and the entropy rate of the semantic Markov source are no more than those of the syntactic Markov source.

Tsinghua Science & Technology
Beijing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 88%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Semantic Markov Chain Using Synonymous Mapping — Zijian Liang, Kai Niu, et al. · Tsinghua Science & Technology (2025) | TGRS Research Map | TGRS