Tomoyuki Kajiwara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tomoyuki Kajiwara has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Danushka Bollegala
University of Liverpool, Liverpool, United Kingdom
1 shared publication- Holy Lovenia
SeaCrowd
1 shared publication - Hwanhee Lee
Chung-Ang University Seoul Korea
1 shared publication - Jimin Lee
Chung-Ang University
1 shared publication Ken-Ichi Kawarabayashi
National Institute of Informatics, Tokyo, Japan
1 shared publication- Mamoru Komachi
Hitotsubashi University, 2-1 Naka, Kunitachi, Tokyo 186-8601, Japan
1 shared publication
Latest Publications
- Open Access
- 9 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 25 (7) , 1-14
MultiLexNorm++: A Unified Benchmark and a Generative Model for Lexical Normalization for Asian Languages
Social media data has been of interest to Natural Language Processing (NLP) practitioners for over a decade, because of its richness in information, but also challenges for automatic processing. Since language use is more informal, spontaneous, and adheres to many different sociolects, the performance of NLP models often deteriorates. One solution to this problem is to transform data to a standard variant before processing it, which is also called lexical normalization. There has been a wide variety of benchmarks and models proposed for this task. The MultiLexNorm benchmark proposed to unify these efforts, but it consists almost solely of languages from the Indo-European language family in the Latin script. Hence, we propose an extension to MultiLexNorm, which covers five Asian languages from different language families in four different scripts. We show that the previous state-of-the-art model performs worse on the new languages and propose a new architecture based on Large Language Models (LLMs), which shows more robust performance. Finally, we analyze remaining errors, revealing future directions for this task.
- 9 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 25 (7) , 1-14
Open AccessMultiLexNorm++: A Unified Benchmark and a Generative Model for Lexical Normalization for Asian Languages
Social media data has been of interest to Natural Language Processing (NLP) practitioners for over a decade, because of its richness in information, but also challenges for automatic processing. Since language use is more informal, spontaneous, and adheres to many different sociolects, the performance of NLP models often deteriorates. One solution to this problem is to transform data to a standard variant before processing it, which is also called lexical normalization. There has been a wide variety of benchmarks and models proposed for this task. The MultiLexNorm benchmark proposed to unify these efforts, but it consists almost solely of languages from the Indo-European language family in the Latin script. Hence, we propose an extension to MultiLexNorm, which covers five Asian languages from different language families in four different scripts. We show that the previous state-of-the-art model performs worse on the new languages and propose a new architecture based on Large Language Models (LLMs), which shows more robust performance. Finally, we analyze remaining errors, revealing future directions for this task.
- Open Access
- 1 January 2018
- Published by Association for Computational Linguistics (ACL)
- p. 365-369
TMU System for SLAM-2018
- 1 January 2018
- Published by Association for Computational Linguistics (ACL)
- p. 365-369
Open AccessTMU System for SLAM-2018
- Open Access
- 12 September 2017
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 12 (9) , e0180885
An iterative approach for the global estimation of sentence similarity
Measuring the similarity between two sentences is often difficult due to their small lexical overlap. Instead of focusing on the sets of features in two given sentences between which we must measure similarity, we propose a sentence similarity method that considers two types of constraints that must be satisfied by all pairs of sentences in a given corpus. Namely, (a) if two sentences share many features in common, then it is likely that the remaining features in each sentence are also related, and (b) if two sentences contain many related features, then those two sentences are themselves similar. The two constraints are utilized in an iterative bootstrapping procedure that simultaneously updates both word and sentence similarity scores. Experimental results on SemEval 2015 Task 2 dataset show that the proposed iterative approach for measuring sentence semantic similarity is significantly better than the non-iterative counterparts.
- 12 September 2017
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 12 (9) , e0180885
Open AccessAn iterative approach for the global estimation of sentence similarity
Measuring the similarity between two sentences is often difficult due to their small lexical overlap. Instead of focusing on the sets of features in two given sentences between which we must measure similarity, we propose a sentence similarity method that considers two types of constraints that must be satisfied by all pairs of sentences in a given corpus. Namely, (a) if two sentences share many features in common, then it is likely that the remaining features in each sentence are also related, and (b) if two sentences contain many related features, then those two sentences are themselves similar. The two constraints are utilized in an iterative bootstrapping procedure that simultaneously updates both word and sentence similarity scores. Experimental results on SemEval 2015 Task 2 dataset show that the proposed iterative approach for measuring sentence semantic similarity is significantly better than the non-iterative counterparts.