Ghazal Khalighinejad
2024
Extracting Polymer Nanocomposite Samples from Full-Length Documents
Ghazal Khalighinejad
|
Defne Circi
|
L. Brinson
|
Bhuwan Dhingra
Findings of the Association for Computational Linguistics: ACL 2024
This paper investigates the use of large language models (LLMs) for extracting sample lists of polymer nanocomposites (PNCs) from full-length materials science research papers. The challenge lies in the complex nature of PNC samples, which have numerous attributes scattered throughout the text. The complexity of annotating detailed information on PNCs limits the availability of data, making conventional document-level relation extraction techniques impractical due to the challenge in creating comprehensive named entity span annotations.To address this, we introduce a new benchmark and an evaluation technique for this task and explore different prompting strategies in a zero-shot manner. We also incorporate self-consistency to improve the performance. Our findings show that even advanced LLMs struggle to extract all of the samples from an article. Finally, we analyze the errors encountered in this process, categorizing them into three main challenges, and discuss potential strategies for future research to overcome them.
2023
Approximating CKY with Transformers
Ghazal Khalighinejad
|
Ollie Liu
|
Sam Wiseman
Findings of the Association for Computational Linguistics: EMNLP 2023
We investigate the ability of transformer models to approximate the CKY algorithm, using them to directly predict a sentence’s parse and thus avoid the CKY algorithm’s cubic dependence on sentence length. We find that on standard constituency parsing benchmarks this approach achieves competitive or better performance than comparable parsers that make use of CKY, while being faster. We also evaluate the viability of this approach for parsing under random PCFGs. Here we find that performance declines as the grammar becomes more ambiguous, suggesting that the transformer is not fully capturing the CKY computation. However, we also find that incorporating additional inductive bias is helpful, and we propose a novel approach that makes use of gradients with respect to chart representations in predicting the parse, in analogy with the CKY algorithm being a subgradient of a partition function variant with respect to the chart.
Exploring the Effect of Frequency Resolution in FNet
Gregory Szumel
|
Ghazal Khalighinejad
|
Rickard Stureborg
|
Sam Wiseman
Proceedings of The Fourth Workshop on Simple and Efficient Natural Language Processing (SustaiNLP)
Search
Co-authors
- Sam Wiseman 2
- Ollie Liu 1
- Gregory Szumel 1
- Rickard Stureborg 1
- Defne Circi 1
- show all...