Transition-Based Dependency Parsing using Perceptron Learner
arXiv:2001.08279
Abstract
Syntactic parsing using dependency structures has become a standard technique in natural language processing with many different parsing models, in particular data-driven models that can be trained on syntactically annotated corpora. In this paper, we tackle transition-based dependency parsing using a Perceptron Learner. Our proposed model, which adds more relevant features to the Perceptron Learner, outperforms a baseline arc-standard parser. We beat the UAS of the MALT and LSTM parsers. We also give possible ways to address parsing of non-projective trees.
This was part of an assignment at my graduate course at LTI. This does not offer any major novelties
References in corpus (9)
- Transition-Based Dependency Parsing with Stack Long Short-Term Memory
- Joint Embedding of Hierarchical Categories and Entities for Concept Categorization and Dataless Classification
- An Unsupervised Domain-Independent Framework for Automated Detection of Persuasion Tactics in Text
- Event Outcome Prediction using Sentiment Analysis and Crowd Wisdom in Microblog Feeds
- A Heterogeneous Graphical Model to Understand User-Level Sentiments in Social Media
- A Machine Learning Framework for Authorship Identification From Texts
- Simultaneous Identification of Tweet Purpose and Position
- A Correspondence Analysis Framework for Author-Conference Recommendations
- Modeling Product Search Relevance in e-Commerce