![]() ; ; van der Torre, Leon ![]() in Artificial Intelligence and Law (2021), 29(2), 171-211 This article seeks to address the problem of the ‘resource consumption bottleneck’ of creating legal semantic technologies manually. It describes a semantic role labeling based information extraction ... [more ▼] This article seeks to address the problem of the ‘resource consumption bottleneck’ of creating legal semantic technologies manually. It describes a semantic role labeling based information extraction system to extract definitions and norms from legislation and represent them as structured norms in legal ontologies. The output is intended to help make laws more accessible, understandable, and searchable in a legal document management system. [less ▲] Detailed reference viewed: 33 (5 UL)![]() Casini, Giovanni ![]() in CEUR Workshop Proceedings (2020) Detailed reference viewed: 70 (2 UL)![]() ; ; van der Torre, Leon ![]() in Artificial Intelligence and Law (2020) This paper is concerned with the goal of maintaining legal information and compliance systems: the ‘resource consumption bottleneck’ of creating semantic technologies manually. The use of automated ... [more ▼] This paper is concerned with the goal of maintaining legal information and compliance systems: the ‘resource consumption bottleneck’ of creating semantic technologies manually. The use of automated information extraction techniques could significantly reduce this bottleneck. The research question of this paper is: How to address the resource bottleneck problem of creating specialist knowledge management systems? In particular, how to semi-automate the extraction of norms and their elements to populate legal ontologies? This paper shows that the acquisition paradox can be addressed by combining state-of-the-art general-purpose NLP modules with pre- and post-processing using rules based on domain knowledge. It describes a Semantic Role Labeling based information extraction system to extract norms from legislation and represent them as structured norms in legal ontologies. The output is intended to help make laws more accessible, understandable, and searchable in legal document management systems such as Eunomos (Boella et al., 2016). [less ▲] Detailed reference viewed: 90 (4 UL)![]() ; ; et al in proc. of The 30th international conference on Legal Knowledge and Information Systems (JURIX 2017) (2017) Detailed reference viewed: 224 (51 UL)![]() ; ; et al in A Unifying Similarity Measure for Automated Identification of National Implementations of European Union Directives (2017) Detailed reference viewed: 322 (18 UL)![]() ; ; et al in Applied Ontology (2017) Detailed reference viewed: 350 (10 UL)![]() Adebayo, Kolawole John ![]() Scientific Conference (2016, November 15) We describe in this paper, a report of our participation at COLIEE 2016 Information Retrieval (IR) and Legal Question Answering (LQA) tasks. Our solution for the IR part employs the use of a simple but ... [more ▼] We describe in this paper, a report of our participation at COLIEE 2016 Information Retrieval (IR) and Legal Question Answering (LQA) tasks. Our solution for the IR part employs the use of a simple but effective Machine Learning (ML) procedure. Our Question Answering solution answers "YES or 'NO' to a question, i.e., 'YES' if the question is entailed by a text and 'NO' otherwise. With recent exploit of Multi-layered Neural Network systems at language modeling tasks, we presented a Deep Learning approach which uses an adaptive variant of the Long-Short Term Memory (LSTM), i.e. the Child Sum Tree LSTM (CST-LSTM) algorithm that we modified to suit our purpose. Additionally, we benchmarked this approach by handcrafting features for two popular ML algorithms, i.e., the Support Vector Machine (SVM) and the Random Forest (RF) algorithms. Even though we used some features that have performed well from similar works, we also introduced some semantic features for performance improvement. We used the results from these two algorithms as the baseline for our CST-LSTM algorithm. All evaluation was done on the COLIEE 2015 training and test sets. The overall result conforms the competitiveness of our approach. [less ▲] Detailed reference viewed: 351 (12 UL)![]() ; ; Robaldo, Livio ![]() in Proceedings of the 28th Annual Benelux Conference on Artificial Intelligence (BNAIC2016). (2016) Detailed reference viewed: 151 (8 UL)![]() ; ; Humphreys, Llio ![]() in Artificial Intelligence and Law (2016) Detailed reference viewed: 308 (20 UL)![]() Humphreys, Llio ![]() ![]() in The 15th International Conference on Artificial Intelligence & Law — San Diego, June 8-12, 2015 (2015) Detailed reference viewed: 310 (23 UL)![]() Humphreys, Llio ![]() in Proceedings of the 28th International Conference on Legal Knowledge and Information Systems (2015) Detailed reference viewed: 165 (6 UL)![]() ; Humphreys, Llio ![]() in Conceptual Modeling, Lecture Notes in Computer Science 8824 (2014) Detailed reference viewed: 118 (1 UL)![]() ; ; Humphreys, Llio ![]() in Language Resources and Evaluation (LREC) (2012) In this paper, we describe how NLP can semi-automate the construction and analysis of knowledge in Eunomos, a legal knowledge management service which enables users to view legislation from various ... [more ▼] In this paper, we describe how NLP can semi-automate the construction and analysis of knowledge in Eunomos, a legal knowledge management service which enables users to view legislation from various sources and ?nd the right de?nitions and explanations of legal concepts in a given context. NLP can semi-automate some routine tasks currently performed by knowledge engineers, such as classifying norms, or linking key terms within legislation to ontological concepts. This helps overcome the resource bottleneck problem of creating specialist knowledge management systems. While accuracy is of the utmost importance in the legal domain, and the information should be veri?ed by domain experts as a matter of course, a semi-automated approach can result in considerable ef?ciency gains. [less ▲] Detailed reference viewed: 287 (0 UL) |
||