@inproceedings{madhyastha-etal-2017-prepositional,
title = "Prepositional Phrase Attachment over Word Embedding Products",
author = "Madhyastha, Pranava Swaroop and
Carreras, Xavier and
Quattoni, Ariadna",
editor = "Miyao, Yusuke and
Sagae, Kenji",
booktitle = "Proceedings of the 15th International Conference on Parsing Technologies",
month = sep,
year = "2017",
address = "Pisa, Italy",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/W17-6305",
pages = "32--43",
abstract = "We present a low-rank multi-linear model for the task of solving prepositional phrase attachment ambiguity (PP task). Our model exploits tensor products of word embeddings, capturing all possible conjunctions of latent embeddings. Our results on a wide range of datasets and task settings show that tensor products are the best compositional operation and that a relatively simple multi-linear model that uses only word embeddings of lexical features can outperform more complex non-linear architectures that exploit the same information. Our proposed model gives the current best reported performance on an out-of-domain evaluation and performs competively on out-of-domain dependency parsing datasets.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="madhyastha-etal-2017-prepositional">
<titleInfo>
<title>Prepositional Phrase Attachment over Word Embedding Products</title>
</titleInfo>
<name type="personal">
<namePart type="given">Pranava</namePart>
<namePart type="given">Swaroop</namePart>
<namePart type="family">Madhyastha</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Xavier</namePart>
<namePart type="family">Carreras</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Ariadna</namePart>
<namePart type="family">Quattoni</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2017-09</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 15th International Conference on Parsing Technologies</title>
</titleInfo>
<name type="personal">
<namePart type="given">Yusuke</namePart>
<namePart type="family">Miyao</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Kenji</namePart>
<namePart type="family">Sagae</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Pisa, Italy</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>We present a low-rank multi-linear model for the task of solving prepositional phrase attachment ambiguity (PP task). Our model exploits tensor products of word embeddings, capturing all possible conjunctions of latent embeddings. Our results on a wide range of datasets and task settings show that tensor products are the best compositional operation and that a relatively simple multi-linear model that uses only word embeddings of lexical features can outperform more complex non-linear architectures that exploit the same information. Our proposed model gives the current best reported performance on an out-of-domain evaluation and performs competively on out-of-domain dependency parsing datasets.</abstract>
<identifier type="citekey">madhyastha-etal-2017-prepositional</identifier>
<location>
<url>https://aclanthology.org/W17-6305</url>
</location>
<part>
<date>2017-09</date>
<extent unit="page">
<start>32</start>
<end>43</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Prepositional Phrase Attachment over Word Embedding Products
%A Madhyastha, Pranava Swaroop
%A Carreras, Xavier
%A Quattoni, Ariadna
%Y Miyao, Yusuke
%Y Sagae, Kenji
%S Proceedings of the 15th International Conference on Parsing Technologies
%D 2017
%8 September
%I Association for Computational Linguistics
%C Pisa, Italy
%F madhyastha-etal-2017-prepositional
%X We present a low-rank multi-linear model for the task of solving prepositional phrase attachment ambiguity (PP task). Our model exploits tensor products of word embeddings, capturing all possible conjunctions of latent embeddings. Our results on a wide range of datasets and task settings show that tensor products are the best compositional operation and that a relatively simple multi-linear model that uses only word embeddings of lexical features can outperform more complex non-linear architectures that exploit the same information. Our proposed model gives the current best reported performance on an out-of-domain evaluation and performs competively on out-of-domain dependency parsing datasets.
%U https://aclanthology.org/W17-6305
%P 32-43
Markdown (Informal)
[Prepositional Phrase Attachment over Word Embedding Products](https://aclanthology.org/W17-6305) (Madhyastha et al., IWPT 2017)
ACL