Chalkidis, Ilias
University of Copenhagen
6 papers on CoChatORCID 0000-0002-0706-7772
Most cited papers
- Verified
Neural Legal Judgment Prediction in English
Chalkidis, I., Androutsopoulos, I., & Aletras, N. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics
Artificial Intelligence in LawTopic Modeling
Cited by 352
- Verified
LexGLUE: A Benchmark Dataset for Legal Language Understanding in English
Chalkidis, I., Jana, A., Hartung, D., Bommarito, M. J., Androutsopoulos, I., Katz, D. M., & Aletras, N. (2021) · SSRN Electronic Journal
Artificial Intelligence in LawTopic Modeling
Cited by 111
- Verified
Challenges and Strategies in Cross-Cultural NLP
Hershcovich, D., Frank, S., Lent, H., de Lhoneux, M., Abdou, M., Brandl, S., Bugliarello, E., Cabello Piqueras, L., Chalkidis, I., Cui, R., et al. (2022) · Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Natural Language Processing TechniquesTopic Modeling
Cited by 99
- Verified
Paragraph-level Rationale Extraction through Regularization: A case study on European Court of Human Rights Cases
Chalkidis, I., Fergadiotis, M., Tsarapatsanis, D., Aletras, N., Androutsopoulos, I., & Malakasiotis, P. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Artificial Intelligence in LawTopic Modeling
Cited by 78
- Verified
Revisiting Transformer-based Models for Long Document Classification
Dai, X., Chalkidis, I., Darkner, S., & Elliott, D. (2022) · arXiv
Topic ModelingText and Document Classification Technologies
Cited by 58
- Verified
LEXTREME: A Multi-Lingual and Multi-Task Benchmark for the Legal Domain
Niklaus, J., Matoshi, V., Rani, P., Galassi, A., Stürmer, M., & Chalkidis, I. (2023) · Findings of the Association for Computational Linguistics: EMNLP 2023
Artificial Intelligence in LawTopic Modeling
Cited by 50
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free