Greedy Transition-Based Dependency Parsing with Stack LSTMs | Citedby Results | Computational Linguistics | MIT Press

Skip to Main Content

Skip Nav Destination

Greedy Transition-Based Dependency Parsing with Stack LSTMs

Computational Linguistics (2017) 43 (2): 311–347.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Hybrid embeddings for transition-based dependency parsing of free word order languages

Fatima Tuz Zuhra
Khalid Saleem

Information Processing & Management (2023) 60 (3): 103334.

Prediction of Landslide Displacement Based on the Combined VMD-Stacked LSTM-TAR Model

Yaping Gao
Xi Chen
Rui Tu
Guo Chen
Tong Luo
Dongdong Xue

Remote Sensing (2022) 14 (5): 1164.

Predicting the number of customer transactions using stacked LSTM recurrent neural networks

M. V. Sebt
S. H. Ghasemi
S. S. Mehrkian

Social Network Analysis and Mining (2021) 11 (1)

A survey of syntactic-semantic parsing based on constituent and dependency structures

MeiShan Zhang

Science China Technological Sciences (2020) 63 (10): 1898.

Explore a deep learning multi-output neural network for regional multi-step-ahead air quality forecasts

Yanlai Zhou
Fi-John Chang
Li-Chiu Chang
I-Feng Kao
Yi-Shin Wang

Journal of Cleaner Production (2019) 209: 134.