Go Kamoda

According to our database1, Go Kamoda authored at least 9 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
SoftMatcha 2: A Fast and Soft Pattern Matcher for Trillion-Scale Corpora.
CoRR, February, 2026

2025
Can Language Models Handle a Non-Gregorian Calendar?
CoRR, September, 2025

Weight-based Analysis of Detokenization in Language Models: Understanding the First Stage of Inference Without Inference.
Proceedings of the Findings of the Association for Computational Linguistics: NAACL 2025, Albuquerque, New Mexico, USA, April 29, 2025

Can Language Models Handle a Non-Gregorian Calendar? The Case of the Japanese wareki.
Proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics, 2025

SoftMatcha: A Soft and Fast Pattern Matcher for Billion-Scale Corpus Searches.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

How a Bilingual LM Becomes Bilingual: Tracing Internal Representations with Sparse Autoencoders.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2025, 2025

Quantifying the Influence of Evaluation Aspects on Long-Form Response Assessment.
Proceedings of the 31st International Conference on Computational Linguistics, 2025

2024
The Curse of Popularity: Popular Entities have Catastrophic Side Effects when Deleting Knowledge from Language Models.
CoRR, 2024

2023
Test-time Augmentation for Factual Probing.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023


  Loading...