Essays about: "entailment"
Found 4 essays containing the word entailment.
-
1. Natural Language Inference Transfer Learning in a Multi-Task Contract Dataset : In the Case of ContractNLI: a Document Information Extraction System
University essay from Uppsala universitet/Institutionen för lingvistik och filologiAbstract : This thesis investigates the enhancement of legal contract Natural Language Inference (NLI) classification through supervised fine-tuning on general domain NLI, in the case of ContractNLI and Span NLI BERT (Koreeda and Manning, 2021), a multi-task document information extraction dataset and framework. Annotated datasets of a specific professional domain are scarce due to the high time and labour cost required to create them. READ MORE
-
2. Methods for data and user efficient annotation for multi-label topic classification
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Machine Learning models trained using supervised learning can achieve great results when a sufficient amount of labeled data is used. However, the annotation process is a costly and time-consuming task. There are many methods devised to make the annotation pipeline more user and data efficient. READ MORE
-
3. Explainable Multimodal Fusion
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Recently, there has been a lot of interest in explainable predictions, with new explainability approaches being created for specific data modalities like images and text. However, there is a dearth of understanding and minimal exploration in terms of explainability in the multimodal machine learning domain, where diverse data modalities are fused together in the model. READ MORE
-
4. Semantics and Implementation of Knowledge Operators in Approximate Databases
University essay from Institutionen för datavetenskapAbstract : In order that epistemic formulas might be coupled with approximate databases, it is necessary to have a well-defined semantics for the knowledge operator and a method of reducing epistemic formulas to approximate formulas. In this thesis, two possible definitions of a semantics for the knowledge operator are proposed for use together with an approximate relational database: * One based upon logical entailment (being the dominating notion of knowledge in literature); sound and complete rules for reduction to approximate formulas are explored and found not to be applicable to all formulas. READ MORE