id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_5u2zpk2fhfbwneryxw4r65giga	Eliyahu Kiperwasser	Easy-First Dependency Parsing with Hierarchical Tree LSTMs	2016	18	.pdf	application/pdf	9733	973	66	We suggest a compositional vector representation of parse trees that relies on a recursive Dependency parse-trees encode not only the syntactic structure of a sentence the head word, and the last input is the vector representation of the left-most or the right-most modifier. encoding trees as vectors, and methods for parsing The popular approach for encoding trees as vectors is using recursive neural networks (Goller and Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1159–1168, Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1159–1168, Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1159–1168,	./cache/work_5u2zpk2fhfbwneryxw4r65giga.pdf	./txt/work_5u2zpk2fhfbwneryxw4r65giga.txt