Essays about: "SemEval"

Found 3 essays containing the word SemEval.

  1. 1. Exploration of Knowledge Distillation Methods on Transformer Language Models for Sentiment Analysis

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Haonan Liu; [2022]
    Keywords : Natural Language Processing; Sentiment Analysis; Language Model; Transformers; Knowledge Distillation; Behandling av Naturligt Språk; Analys av Känslor; Språkmodell; Omvandlare; Kunskapsdestillation;

    Abstract : Despite the outstanding performances of the large Transformer-based language models, it proposes a challenge to compress the models and put them into the industrial environment. This degree project explores model compression methods called knowledge distillation in the sentiment classification task on Transformer models. READ MORE

  2. 2. WANNA BE ON TOP? The Hyperparameter Search for Semantic Change's Next Top Model

    University essay from Göteborgs universitet / Institutionen för filosofi, lingvistik och vetenskapsteori

    Author : Kate Viloria; [2021-09-22]
    Keywords : semantic change; language change; diachronic word embeddings;

    Abstract : Lexical semantic change (LSC) detection through the use of diachronic corpora and computational methods continues to be a prevalent research area in language change (Tahmasebi et al., 2018). READ MORE

  3. 3. Dynamic Programming Algorithms for Semantic Dependency Parsing

    University essay from Linköpings universitet/Interaktiva och kognitiva system

    Author : Nils Axelsson; [2017]
    Keywords : semantic dependency parsing; machine learning; parsing; logic; deduction system; crossing edges; SemEval; coverage; crossing arcs; graph; graph class; non-crossing; QAC; quartic; acyclic; semantisk dependensparsning; maskininlärning; parsning; logik; deduktionssystem; korsande bågar; SemEval; täckning; korsande kanter; graf; grafklass; ickekorsande; QAC; kvartiskt; acykliskt;

    Abstract : Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. READ MORE