Hai-Lun Tu

12 papers A 1B 2Journal 4Unranked 5
YearRankTypeTitle / Venue / Authors
2025 B conf
Improve & Explain: AI-Based Writing Improvement and Informative Feedback.
ICALT
Wei-Chin Lee, Kai-Wen Tuan, Cheng-En Hsu, Jo-Chi Hsiao, Hai-Lun Tu, Jason S. Chang
2024 — conf
Generative Dictionary: Improving Language Learner Understanding with Contextual Definitions.
EMNLP (System Demonstrations)
Kai-Wen Tuan, Hai-Lun Tu, Jason S. Chang
2024 — conf
LingglePolish: Elevating Writing Proficiency Through Comprehensive Grammar and Lexical Refinement.
HCI (37)
Kai-Wen Tuan, Alison Chi, Hai-Lun Tu, Zi-Han Liao, Jason S. Chang
2021 — conf
Learning to Find Translation of Grammar Patterns in Parallel Corpus.
ROCLING
Kai-Wen Tuan, Yi-Jyun Chen, Yi-Chien Lin, Chun-Ho Kwok, Hai-Lun Tu, Jason S. Chang
2019 — conf
Extracting Grammatical Error Corrections from Wikipedia Revision History.
IEEE BigData
Jhih-Jie Chen, Yi-Dong Wu, Yu-Chuan Tai, Ching-Yu Helen Yang, Hai-Lun Tu, Jason S. Chang
2019 J jnl
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.
Algorithmica
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2019 — conf
Word Sense Disambiguation Using Wikipedia Link Graph.
IEEE BigData
Hai-Lun Tu, Peichen Ho, Jason S. Chang, Li-Guang Chen
2018 A conf
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity.
ICS
Hai-Lun Tu, Mong-Jen Kao, D. T. Lee
2016 B conf
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
ISAAC
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2016 J jnl
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
CoRR
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2015 J jnl
A linear-time algorithm for paired-domination on circular-arc graphs.
Theor. Comput. Sci.
Ching-Chi Lin, Hai-Lun Tu
2014 J jnl
Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs.
CoRR
Ching-Chi Lin, Hai-Lun Tu