May Myo Zin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
May Myo Zin has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ken Satoh
Center for Juris-Informatics, ROIS-DS, Tokyo, Japan
9 shared publications - Ha-Thanh Nguyen
National Institute of Informatics
7 shared publications - Wachara Fungwacharakorn
Center for Juris-Informatics, ROIS-DS, Tokyo, Japan
4 shared publications - Fumihito Nishino
National Institute of Informatics, Tokyo, Japan
3 shared publications - Georg Borges
Saarland University
2 shared publications - Saku Sugawara
National Institute of Informatics, Tokyo, Japan
2 shared publications
Latest Publications
- 6 June 2026
- Published by Springer Nature
- p. 115-130
Improving Reliability in Multimodal Legal Interpretation of Traffic Signs
- 6 June 2026
- Published by Springer Nature
- p. 115-130
Improving Reliability in Multimodal Legal Interpretation of Traffic Signs
- Open Access
Argumentative Reasoning with Language Models on Non-factorized Case Bases
In this paper, we investigate how language models can perform case-based reasoning (CBR) on non-factorized case bases. We introduce a novel framework, argumentative agentic models for case-based reasoning (AAM-CBR), which extends abstract argumentation for case-based reasoning (AA-CBR). Unlike traditional approaches that require factorization of previous cases, AAM-CBR leverages language models to determine case coverage and extract factors based on new cases. This enables factor-based reasoning without exposing or preprocessing previous cases, thus improving both flexibility and privacy. We also present initial experiments to assess AAM-CBR performance by comparing the proposed framework with a baseline that uses a single-prompt approach to incorporate both new and previous cases. The experiments are conducted based on a synthetic credit card application dataset. The result shows that AAM-CBR surpasses the baseline only when the new case contains a richer set of factors. The finding indicates that language models can handle case-based reasoning with a limited number of factors, but face challenges as the number of factors increase. Consequently, integrating symbolic reasoning with language models, as implemented in AAM-CBR, is crucial for effectively handling cases involving many factors.
Open AccessArgumentative Reasoning with Language Models on Non-factorized Case Bases
In this paper, we investigate how language models can perform case-based reasoning (CBR) on non-factorized case bases. We introduce a novel framework, argumentative agentic models for case-based reasoning (AAM-CBR), which extends abstract argumentation for case-based reasoning (AA-CBR). Unlike traditional approaches that require factorization of previous cases, AAM-CBR leverages language models to determine case coverage and extract factors based on new cases. This enables factor-based reasoning without exposing or preprocessing previous cases, thus improving both flexibility and privacy. We also present initial experiments to assess AAM-CBR performance by comparing the proposed framework with a baseline that uses a single-prompt approach to incorporate both new and previous cases. The experiments are conducted based on a synthetic credit card application dataset. The result shows that AAM-CBR surpasses the baseline only when the new case contains a richer set of factors. The finding indicates that language models can handle case-based reasoning with a limited number of factors, but face challenges as the number of factors increase. Consequently, integrating symbolic reasoning with language models, as implemented in AAM-CBR, is crucial for effectively handling cases involving many factors.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 481-482
Data Augmented Pipeline for Legal Information Extraction and Reasoning
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 481-482
Open AccessData Augmented Pipeline for Legal Information Extraction and Reasoning
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 327-336
Towards Machine-Readable Traffic Laws: Formalizing Traffic Rules into PROLOG Using LLMs
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 327-336
Open AccessTowards Machine-Readable Traffic Laws: Formalizing Traffic Rules into PROLOG Using LLMs
- Open Access
- 5 December 2024
- Published by IOS Press
Leveraging LLM for Identification and Extraction of Normative Statements
The development of autonomous vehicles (AVs) requires a comprehensive understanding of both explicit and implicit traffic rules to ensure legal compliance and safety. While explicit traffic laws are well-defined in statutes and regulations, implicit rules derived from judicial interpretations and case law are more nuanced and challenging to extract. This research investigates the potential of Large Language Models (LLMs), particularly GPT-4o, in automating the extraction of implicit traffic rules from judicial decisions. By utilizing various prompt engineering techniques, including Standard Prompts, Chain-of-Thought (CoT), Chain-of-Instructions (CoI), and Layer-of-Thought (LoT) prompts, this study aims to assess the effectiveness of GPT-4o in identifying normative content relevant to specific traffic laws. The contributions of this paper include an assessment of LLMs for legal text processing, the automation of implicit rule extraction, and the development of a scalable framework that can continuously update as new legal precedents emerge. The results indicate promising avenues for integrating automated normative extraction in AV systems, improving both the safety and legal compliance of autonomous driving technologies.
- 5 December 2024
- Published by IOS Press
Open AccessLeveraging LLM for Identification and Extraction of Normative Statements
The development of autonomous vehicles (AVs) requires a comprehensive understanding of both explicit and implicit traffic rules to ensure legal compliance and safety. While explicit traffic laws are well-defined in statutes and regulations, implicit rules derived from judicial interpretations and case law are more nuanced and challenging to extract. This research investigates the potential of Large Language Models (LLMs), particularly GPT-4o, in automating the extraction of implicit traffic rules from judicial decisions. By utilizing various prompt engineering techniques, including Standard Prompts, Chain-of-Thought (CoT), Chain-of-Instructions (CoI), and Layer-of-Thought (LoT) prompts, this study aims to assess the effectiveness of GPT-4o in identifying normative content relevant to specific traffic laws. The contributions of this paper include an assessment of LLMs for legal text processing, the automation of implicit rule extraction, and the development of a scalable framework that can continuously update as new legal precedents emerge. The results indicate promising avenues for integrating automated normative extraction in AV systems, improving both the safety and legal compliance of autonomous driving technologies.
- Open Access
Layer-of-Thoughts Prompting (LoT): Leveraging LLM-Based Retrieval with Constraint Hierarchies
This paper presents a novel approach termed Layer-of-Thoughts Prompting (LoT), which utilizes constraint hierarchies to filter and refine candidate responses to a given query. By integrating these constraints, our method enables a structured retrieval process that enhances explainability and automation. Existing methods have explored various prompting techniques but often present overly generalized frameworks without delving into the nuances of prompts in multi-turn interactions. Our work addresses this gap by focusing on the hierarchical relationships among prompts. We demonstrate that the efficacy of thought hierarchy plays a critical role in developing efficient and interpretable retrieval algorithms. Leveraging Large Language Models (LLMs), LoT significantly improves the accuracy and comprehensibility of information retrieval tasks.
Open AccessLayer-of-Thoughts Prompting (LoT): Leveraging LLM-Based Retrieval with Constraint Hierarchies
This paper presents a novel approach termed Layer-of-Thoughts Prompting (LoT), which utilizes constraint hierarchies to filter and refine candidate responses to a given query. By integrating these constraints, our method enables a structured retrieval process that enhances explainability and automation. Existing methods have explored various prompting techniques but often present overly generalized frameworks without delving into the nuances of prompts in multi-turn interactions. Our work addresses this gap by focusing on the hierarchical relationships among prompts. We demonstrate that the efficacy of thought hierarchy plays a critical role in developing efficient and interpretable retrieval algorithms. Leveraging Large Language Models (LLMs), LoT significantly improves the accuracy and comprehensibility of information retrieval tasks.
- 28 May 2024
- Published by Springer Nature
- p. 77-92
Addressing Annotated Data Scarcity in Legal Information Extraction
- 28 May 2024
- Published by Springer Nature
- p. 77-92
Addressing Annotated Data Scarcity in Legal Information Extraction
- Open Access
- 7 December 2023
- Published by IOS Press
- p. 177-186
Information Extraction from Lengthy Legal Contracts: Leveraging Query-Based Summarization and GPT-3.5
In the legal domain, extracting information from contracts poses significant challenges, primarily due to the scarcity of annotated data. In such situations, leveraging large language models (LLMs), such as the Generative Pretrained Transformer (GPT) models, offers a promising solution. However, the inherent token limitations of these models can be a bottleneck for processing lengthy legal contracts. This paper presents an unsupervised two-step approach to address these challenges. First, we propose a query-based summarization model that extracts sentences pertinent to predefined queries, concisely representing lengthy contracts. This summarization ensures that the core information remains intact while simultaneously addressing the token limitation issue. Subsequently, the generated summary is fed to GPT-3.5 for precise information extraction. Our approach effectively overcomes the challenges of token limitations and zero resources, enabling efficient and scalable information extraction from legal contracts. We compare our results with those obtained from supervised models that have been finetuned on domain-specific annotated data. Experimental results demonstrate the remarkable effectiveness of our approach, as it achieves state-of-the-art performance without the need for domain-specific training data.
- 7 December 2023
- Published by IOS Press
- p. 177-186
Open AccessInformation Extraction from Lengthy Legal Contracts: Leveraging Query-Based Summarization and GPT-3.5
In the legal domain, extracting information from contracts poses significant challenges, primarily due to the scarcity of annotated data. In such situations, leveraging large language models (LLMs), such as the Generative Pretrained Transformer (GPT) models, offers a promising solution. However, the inherent token limitations of these models can be a bottleneck for processing lengthy legal contracts. This paper presents an unsupervised two-step approach to address these challenges. First, we propose a query-based summarization model that extracts sentences pertinent to predefined queries, concisely representing lengthy contracts. This summarization ensures that the core information remains intact while simultaneously addressing the token limitation issue. Subsequently, the generated summary is fed to GPT-3.5 for precise information extraction. Our approach effectively overcomes the challenges of token limitations and zero resources, enabling efficient and scalable information extraction from legal contracts. We compare our results with those obtained from supervised models that have been finetuned on domain-specific annotated data. Experimental results demonstrate the remarkable effectiveness of our approach, as it achieves state-of-the-art performance without the need for domain-specific training data.
- Open Access
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 462-466
Improving Translation of Case Descriptions into Logical Fact Formulas using LegalCaseNER
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 462-466
Open AccessImproving Translation of Case Descriptions into Logical Fact Formulas using LegalCaseNER