TY - GEN
T1 - Linguistically rich vector representations of supertags for TAG parsing
AU - Friedman, Dan
AU - Kasai, Jungo
AU - McCoy, R. Thomas
AU - Frank, Robert
AU - Davis, Forrest
AU - Rambow, Owen
N1 - Publisher Copyright:
© 2017 Association for Computational Linguistics.
PY - 2017
Y1 - 2017
N2 - In this paper, we explore several techniques for producing vector representations of TAG supertags that can be used as inputs to a neural network-based TAG parser. In the simplest case, the supertag is encoded as a 1-hot vector that is projected to a dense vector. Secondly, we use a tree-recursive neural network that is given as input the structure of the elementary tree. Thirdly, we use hand-crafted feature vectors that describe the syntactic features of each supertag, and project these to a dense vector. These three representations are learned during the training of a neural network TAG parser with a layer that embeds supertags in a low-dimensional space. Finally, we consider an embedding that is trained only on patterns of linear co-occurrence among supertags. By testing the resulting vector representations on the task of completing syntactic analogies, we show that these vector representations capture syntactically relevant information. While our linguistically-informed embeddings outperform atomic embeddings on the syntactic analogy task, we find that the same embeddings lead to only a slight improvement on the task of TAG parsing, indicating that the neural parser is able to induce useful representations of supertags from the data alone.
AB - In this paper, we explore several techniques for producing vector representations of TAG supertags that can be used as inputs to a neural network-based TAG parser. In the simplest case, the supertag is encoded as a 1-hot vector that is projected to a dense vector. Secondly, we use a tree-recursive neural network that is given as input the structure of the elementary tree. Thirdly, we use hand-crafted feature vectors that describe the syntactic features of each supertag, and project these to a dense vector. These three representations are learned during the training of a neural network TAG parser with a layer that embeds supertags in a low-dimensional space. Finally, we consider an embedding that is trained only on patterns of linear co-occurrence among supertags. By testing the resulting vector representations on the task of completing syntactic analogies, we show that these vector representations capture syntactically relevant information. While our linguistically-informed embeddings outperform atomic embeddings on the syntactic analogy task, we find that the same embeddings lead to only a slight improvement on the task of TAG parsing, indicating that the neural parser is able to induce useful representations of supertags from the data alone.
UR - https://www.scopus.com/pages/publications/85081719238
M3 - Conference contribution
AN - SCOPUS:85081719238
T3 - TAG+ 2017 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Proceedings
SP - 122
EP - 131
BT - TAG+ 2017 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Proceedings
PB - Association for Computational Linguistics (ACL)
T2 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2017
Y2 - 4 September 2017 through 6 September 2017
ER -