Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dakun Zhang

dblp:64/4478 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0002-4308-5900ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Machine translation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation
bilingual lexicon induction
0.212015
Iterative Learning of Parallel Lexicons and Phrases from Non-Parallel Corpora · IJCAI 2015
Natural language and speech › Machine translation
statistical machine translation
0.212015
Iterative Learning of Parallel Lexicons and Phrases from Non-Parallel Corpora · IJCAI 2015
Natural language and speech › Machine translation
non-parallel corpora
0.112015
Iterative Learning of Parallel Lexicons and Phrases from Non-Parallel Corpora · IJCAI 2015

Methods — techniques the papers use, named apart from their topics

iterative learning · 0.2global sentence representation · 0.2
YearPublicationVenuePosition
2026 Improving Retrieval-Augmented Neural Machine Translation with Monolingual Data
abstract
Conventional retrieval-augmented neural machine translation (RANMT) systems leverage bilingual corpora, e.g., translation memories (TMs). Yet, in many settings, monolingual corpora in the target language are often available. This work explores ways to take advantage of such resources by directly retrieving relevant target language segments, based on a source-side query. For this, we design improved cross-lingual retrieval systems, trained with both sentence level and word-level matching objectives. In our experiments with two RANMT architectures, we assess of such cross-lingual objectives in a controlled setting, reaching performances that match those of standard TM-based models. We also showcase our method on real-world settings, using much larger monolingual corpora, and observe strong improvements over both the baseline setting, and general-purpose cross-lingual retrievers.
Maxime Bouthors, Josep Maria Crego, Dakun Zhang, François Yvon
EAMT (1)3
2017 A novel mapping algorithm for three-dimensional network on chip based on quantum-behaved particle swarm optimization
Cui Huang, Dakun Zhang, Guozhi Song
Frontiers Comput. Sci.2
2015 Iterative Learning of Parallel Lexicons and Phrases from Non-Parallel Corpora
Meiping Dong, Yang Liu 0005, Huan-Bo Luan, Maosong Sun 0001, Tatsuya Izuha, Dakun Zhang
IJCAI6
2015 Local Translation Prediction with Global Sentence Representation
Dakun Zhang
IJCAI2
2015 Well-Formed Dependency to String translation with BTG Grammar
Dakun Zhang
PACLIC3
2014 A Neural Reordering Model for Phrase-based Translation
Peng Li 0030, Yang Liu 0005, Maosong Sun 0001, Tatsuya Izuha, Dakun Zhang
COLING5
2009 Fault-Tolerant Routing Schemes for Wormhole Mesh
abstract
Fault tolerance is an important issue for the design of interconnection networks. In this paper, a new fault tolerant routing algorithm is presented and is applied in mesh networks employing wormhole switching. Due to its low routing restrictions, the presented routing algorithm is so highly adaptive that it is connected and deadlock free in spite of the various fault regions in mesh networks. Due to the minimal virtual channels it uses, the presented routing algorithm only employs as few buffers as possible and is suitable for fault-tolerant interconnection networks with low cost. Since it chooses the path around fault regions according to the local fault information, the presented routing algorithm takes routing decisions quickly and is applicable in interconnection networks. Moreover, a simulation is conducted for the proposed routing algorithm and the results show that the algorithm exhibits a graceful degradation in performance.
Xinming Duan, Dakun Zhang, Xuemei Sun
ISPA2
2008 A Structured Prediction Approach for Statistical Machine Translation
Dakun Zhang, Le Sun 0001
IJCNLP1