Transition-Based Dependency Parsing with Stack Long Short-Term Memory (2015-05-29T00:00:00.000000Z)

TL;DR

This work was sponsored in part by the U. S. Army Research Laboratory and the NSF CAREER grant IIS-1054319 and the European Commission.

Abstract

This work was sponsored in part by the U. S. Army Research Laboratory and the U. S. Army Research Office/nunder contract/grant number W911NF-10-1-0533, and in part by NSF CAREER grant IIS-1054319./nMiguel Ballesteros is supported by the European Commission under the contract numbers FP7-ICT-610411 (project MULTISENSOR) and H2020-RIA-645012 (project KRISTINA).

Authors

Chris Dyer

16 papers

Noah A. Smith

34 papers

Wang Ling

3 papers

TL;DR

Abstract

Authors

References52 items

Greedy Transition-Based Dependency Parsing with Stack LSTMs

Structured Training for Neural Network Transition-Based Parsing

Reinforcement Learning Neural Turing Machines

Grammar as a Foreign Language

Neural Turing Machines

Memory Networks

Greed is Good if Randomized: New Inference for Dependency Parsing

The Inside-Outside Recursive Neural Network model for Dependency Parsing

Sequence to Sequence Learning with Neural Networks

Feature Embedding for Dependency Parsing

Automatic Feature Selection for Agenda-Based Dependency Parsing

Tailoring Continuous Word Representations for Dependency Parsing

New Directions in Vector Space Models of Meaning

Grounded Compositional Semantics for Finding and Describing Images with Sentences

MaltOptimizer: Fast and effective parser optimization

How to Construct Deep Recurrent Neural Networks

Distributed Representations of Words and Phrases and their Compositionality

Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank

Generating Sequences With Recurrent Neural Networks

Transition-based Dependency Parsing with Selectional Branching

Parsing with Compositional Vector Grammars

A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy

Efficient Implementation of Beam-Search Incremental Parsers

The Role of Syntax in Vector Space Models of Compositional Semantics

A Transition-Based System for Joint Part-of-Speech Tagging and Labeled Non-Projective Dependency Parsing

Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection

Transition-based Dependency Parsing with Rich Non-local Features

Deep Sparse Rectifier Neural Networks

Turbo Parsers: Dependency Parsing by Approximate Variational Inference

Understanding the difficulty of training deep feedforward neural networks

Non-Projective Dependency Parsing in Expected Linear Time

Algorithms for Deterministic Incremental Dependency Parsing

A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing

Forest Reranking: Discriminative Parsing with Non-Local Features

Constituent Parsing with Incremental Sigmoid Belief Networks

Multi-dimensional Recurrent Neural Networks

Incremental Non-Projective Dependency Parsing

Generating Typed Dependency Parses from Phrase Structure Parses

Framewise phoneme classification with bidirectional LSTM networks

Incrementality in Deterministic Dependency Parsing

Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network

Statistical Dependency Analysis with Support Vector Machines

SARDSRN: A Neural Network Shift-Reduce Parser

Long Short-Term Memory

Subsymbolic Case-Role Analysis of Sentences With Embedded Clauses

Two/Too Simple Adaptations of Word2Vec for Syntax Problems

Sumit Chopra, and Antoine Bordes. 2015. Memory networks. In Proc. ICLR

A Fast and Accurate Dependency Parser using Neural Networks

Transition-based Dependency Parsing Using Recursive Neural Networks

A Conditional Random Field Word Segmenter for Sighan Bakeoff 2005

An Efficient Algorithm for Projective Dependency Parsing

Learning Context-free Grammars: Capabilities and Limitations of a Recurrent Neural Network with an External Stack Memory (cid:3)

Field of Study

Journal Information

Name

Volume

Venue Information

Name

Type

URL

Alternate Names