Sökning: "Semantic Dependency Parsing"

Hittade 4 uppsatser innehållade orden Semantic Dependency Parsing.

1. 1. A Detailed Analysis of Semantic Dependency Parsing with Deep Neural Networks

   Master-uppsats, Linköpings universitet/Interaktiva och kognitiva system

   Författare :Daniel Roxbo; [2019]
   Nyckelord :Semantic Dependency Parsing; LSTM;

   Sammanfattning : The use of Long Short Term Memory (LSTM) networks continues to yield better results in natural language processing tasks. One area which recently has seen significant improvements is semantic dependency parsing, where the current state-of-the-art model uses a multilayer LSTM combined with an attention-based scoring function to predict the dependencies. LÄS MER

3. 2. Relation Classification using Semantically-Enhanced Syntactic Dependency Paths : Combining Semantic and Syntactic Dependencies for Relation Classification using Long Short-Term Memory Networks

   Master-uppsats, Linköpings universitet/Interaktiva och kognitiva system

   Författare :Riley Capshaw; [2018]
   Nyckelord :Natural language processing; NLP; computational linguistics; syntactic dependency trees; semantic dependency graphs; relation classification; relation extraction; artificial intelligence; machine learning; deep learning; neural networks; long short-term memory; LSTM;

   Sammanfattning : Many approaches to solving tasks in the field of Natural Language Processing (NLP) use syntactic dependency trees (SDTs) as a feature to represent the latent nonlinear structure within sentences. Recently, work in parsing sentences to graph-based structures which encode semantic relationships between words—called semantic dependency graphs (SDGs)—has gained interest. LÄS MER

4. 3. From Intent to Code : Using Natural Language Processing

   Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för datalogi

   Författare :Adam Byström; [2017]
   Nyckelord :Natural Language Processing; Semantic Role Labeling; Dependency Parsing; Game; Computational thinking;

   Sammanfattning : Programming and the possibility to express one’s intent to a machine is becoming a very important skill in our digitalizing society. Today, instructing a machine, such as a computer to perform actions is done through programming. LÄS MER

5. 4. Dynamic Programming Algorithms for Semantic Dependency Parsing

   Master-uppsats, Linköpings universitet/Interaktiva och kognitiva system

   Författare :Nils Axelsson; [2017]
   Nyckelord :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;

   Sammanfattning : 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. LÄS MER