Sökning: "semantic dependency graphs"

Hittade 2 uppsatser innehållade orden semantic dependency graphs.

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

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