@article{kiperwasser-goldberg-2016-easy,
    title = "Easy-First Dependency Parsing with Hierarchical Tree {LSTM}s",
    author = "Kiperwasser, Eliyahu  and
      Goldberg, Yoav",
    editor = "Lee, Lillian  and
      Johnson, Mark  and
      Toutanova, Kristina",
    journal = "Transactions of the Association for Computational Linguistics",
    volume = "4",
    year = "2016",
    address = "Cambridge, MA",
    publisher = "MIT Press",
    url = "https://preview.aclanthology.org/iwcs-25-ingestion/Q16-1032/",
    doi = "10.1162/tacl_a_00110",
    pages = "445--461",
    abstract = "We suggest a compositional vector representation of parse trees that relies on a recursive combination of recurrent-neural network encoders. To demonstrate its effectiveness, we use the representation as the backbone of a greedy, bottom-up dependency parser, achieving very strong accuracies for English and Chinese, without relying on external word embeddings. The parser{'}s implementation is available for download at the first author{'}s webpage."
}