Sökning: "syntactic dependency trees"
Hittade 5 uppsatser innehållade orden syntactic dependency trees.
1. Automatic Pronoun Resolution for Swedish
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : This report describes a quantitative analysis performed to compare two different methods on the task of pronoun resolution for Swedish. The first method, an implementation of Mitkov’s algorithm, is a heuristic-based method — meaning that the resolution is determined by a number of manually engineered rules regarding both syntactic and semantic information. LÄS MER
2. Test Case Dependency Detection Using Syntactic Analysis of Code for Test Optimization Purposes
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : It is not possible to develop high quality software for large systems without a rigorous testing process. However, testing tends to be costly and time consuming, which is why research in test optimization has received a great deal of attention. LÄS MER
3. A Detailed Analysis of Semantic Dependency Parsing with Deep Neural Networks
Master-uppsats, Linköpings universitet/Interaktiva och kognitiva systemSammanfattning : 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
4. 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 systemSammanfattning : 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
5. Summarizing Product Reviews Using Dynamic Relation Extraction
Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskapSammanfattning : The accumulated review data for a single product on Amazon.com could po- tentially take several weeks to examine manually. Computationally extracting the essence of a document is a substantial task, which has been explored pre- viously through many different approaches. LÄS MER