Ruiting Li
Author directory2026
ConvergeWriter: Data-Driven Bottom-Up Article Construction
Binquan Ji | Jiaqi Wang | Ruiting Li | Xingchen Han | Haibo Luo | Yiyang Qi | Shichao Wang | Yifei Lu | Yuantao Han | Feiliang Ren
Findings of the Association for Computational Linguistics: EMNLP 2026
Binquan Ji | Jiaqi Wang | Ruiting Li | Xingchen Han | Haibo Luo | Yiyang Qi | Shichao Wang | Yifei Lu | Yuantao Han | Feiliang Ren
Findings of the Association for Computational Linguistics: EMNLP 2026
Large Language Models (LLMs) excel at text generation, but still struggle to produce accurate, long-form documents grounded in large knowledge bases. Existing “top-down” approaches—which plan before retrieving evidence—often result in fragmented or unfaithful content due to misalignment between the plan and available knowledge.
To overcome this, we introduce a “bottom-up” framework based on a “Retrieval-First for Knowledge, Clustering for Structure” strategy. Our method begins by establishing the “knowledge boundaries” of the source corpus through comprehensive retrieval, followed by unsupervised clustering to group evidence into distinct “knowledge clusters.” These clusters objectively inform a hierarchical outline and subsequent text generation, ensuring strict adherence to the source and significantly reducing hallucination.
Experimental results on both 14B- and 32B-parameter models demonstrate that our method achieves performance comparable to or exceeding state-of-the-art baselines, and is expected to demonstrate unique advantages in knowledge-constrained scenarios that demand high fidelity and structural coherence. Our work presents an effective paradigm for generating reliable, structured, long-form documents, paving the way for more robust LLM applications in high-stakes, knowledge-intensive domains.
To overcome this, we introduce a “bottom-up” framework based on a “Retrieval-First for Knowledge, Clustering for Structure” strategy. Our method begins by establishing the “knowledge boundaries” of the source corpus through comprehensive retrieval, followed by unsupervised clustering to group evidence into distinct “knowledge clusters.” These clusters objectively inform a hierarchical outline and subsequent text generation, ensuring strict adherence to the source and significantly reducing hallucination.
Experimental results on both 14B- and 32B-parameter models demonstrate that our method achieves performance comparable to or exceeding state-of-the-art baselines, and is expected to demonstrate unique advantages in knowledge-constrained scenarios that demand high fidelity and structural coherence. Our work presents an effective paradigm for generating reliable, structured, long-form documents, paving the way for more robust LLM applications in high-stakes, knowledge-intensive domains.
CloRe: Closed-Loop Reasoning via Intermediate-State Maintenance for Multi-Hop Question Answering
Yingxin Pei | Yuantao Han | Ruiting Li | Binquan Ji | Haibo Luo | Yifei Lu | Feiliang Ren
Findings of the Association for Computational Linguistics: EMNLP 2026
Yingxin Pei | Yuantao Han | Ruiting Li | Binquan Ji | Haibo Luo | Yifei Lu | Feiliang Ren
Findings of the Association for Computational Linguistics: EMNLP 2026
Retrieval-Augmented Generation (RAG) has substantially advanced knowledge-intensive question answering (QA). Existing methods typically follow a ’decompose and sequentially solve’ paradigm, mainly optimizing sub-question generation, retrieval, or search decisions, while lacking explicit maintenance of cross-step intermediate reasoning states. As a result, retrieval noise, query drift, and local reasoning errors introduced in early steps can be inherited and amplified along the reasoning chain, eventually causing reasoning failure. We propose **CloRe**, a state-based closed-loop reasoning framework for multi-hop question answering that explicitly maintains hop-level intermediate states and coordinates forward review with dependency-aware backward correction. In the forward phase, CloRe uses conditional query rewriting to mitigate query drift, stage-wise evidence acquisition to mitigate retrieval noise, and step-level review with local repair to filter unreliable intermediate answers before they are propagated. When forward correction is insufficient, CloRe enters a backward phase that uses downstream failure signals to backtrack along explicit dependencies and revise predecessor states that were locally acceptable under earlier review but become incompatible with later dependency constraints. Experiments on three representative multi-hop QA benchmarks show that CloRe achieves competitive performance against strong baselines, demonstrating the effectiveness of explicit intermediate-state maintenance for multi-hop reasoning.
2025
Retrieval over Classification: Integrating Relation Semantics for Multimodal Relation Extraction
Lei Hei | Tingjing Liao | Peiyingxin | Yiyang Qi | Jiaqi Wang | Ruiting Li | Feiliang Ren
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Lei Hei | Tingjing Liao | Peiyingxin | Yiyang Qi | Jiaqi Wang | Ruiting Li | Feiliang Ren
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Relation extraction (RE) aims to identify semantic relations between entities in unstructured text. Although recent work extends traditional RE to multimodal scenarios, most approaches still adopt classification-based paradigms with fused multimodal features, representing relations as discrete labels. This paradigm has two significant limitations: (1) it overlooks structural constraints like entity types and positional cues, and (2) it lacks semantic expressiveness for fine-grained relation understanding. We propose Retrieval Over Classification (ROC), a novel framework that reformulates multimodal RE as a retrieval task driven by relation semantics. ROC integrates entity type and positional information through a multimodal encoder, expands relation labels into natural language descriptions using a large language model, and aligns entity-relation pairs via semantic similarity-based contrastive learning. Experiments show that our method achieves state-of-the-art performance on the benchmark datasets MNRE and MORE and exhibits stronger robustness and interpretability.
2024
A Corpus and Method for Chinese Named Entity Recognition in Manufacturing
Ruiting Li | Peiyan Wang | Libang Wang | Danqingxin Yang | Dongfeng Cai
Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024)
Ruiting Li | Peiyan Wang | Libang Wang | Danqingxin Yang | Dongfeng Cai
Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024)
Manufacturing specifications are documents entailing different techniques, processes, and components involved in manufacturing. There is a growing demand for named entity recognition (NER) resources and techniques for manufacturing-specific named entities, with the development of smart manufacturing. In this paper, we introduce a corpus of Chinese manufacturing specifications, named MS-NERC, including 4,424 sentences and 16,383 entities. We also propose an entity recognizer named Trainable State Transducer (TST), which is initialized with a finite state transducer describing the morphological patterns of entities. It can directly recognize entities based on prior morphological knowledge without training. Experimental results show that TST achieves an overall 82.05% F1 score for morphological-specific entities in zero-shot. TST can be improved through training, the result of which outperforms neural methods in few-shot and rich-resource. We believe that our corpus and model will be valuable resources for NER research not only in manufacturing but also in other low-resource domains.