Sökning: "semantisk dependensparsning"

Hittade 2 uppsatser innehållade orden semantisk dependensparsning.

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. 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