@inproceedings{rakshit-2019-joint,
title = "Joint Inference on Bilingual Parse Trees for {PP}-attachment Disambiguation",
author = "Rakshit, Geetanjali",
editor = "Axelrod, Amittai and
Yang, Diyi and
Cunha, Rossana and
Shaikh, Samira and
Waseem, Zeerak",
booktitle = "Proceedings of the 2019 Workshop on Widening NLP",
month = aug,
year = "2019",
address = "Florence, Italy",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/W19-3615",
pages = "43--45",
abstract = "Prepositional Phrase (PP) attachment is a classical problem in NLP for languages like English, which suffer from structural ambiguity. In this work, we solve this problem with the help of another language free from such ambiguities, using the parse tree of the parallel sentence in the other language, and word alignments. We formulate an optimization framework that encourages agreement between the parse trees for two languages, and solve it using a novel Dual Decomposition (DD) based algorithm. Experiments on the English-Hindi language pair show promising improvements over the baseline.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="rakshit-2019-joint">
<titleInfo>
<title>Joint Inference on Bilingual Parse Trees for PP-attachment Disambiguation</title>
</titleInfo>
<name type="personal">
<namePart type="given">Geetanjali</namePart>
<namePart type="family">Rakshit</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2019-08</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 2019 Workshop on Widening NLP</title>
</titleInfo>
<name type="personal">
<namePart type="given">Amittai</namePart>
<namePart type="family">Axelrod</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Diyi</namePart>
<namePart type="family">Yang</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Rossana</namePart>
<namePart type="family">Cunha</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Samira</namePart>
<namePart type="family">Shaikh</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Zeerak</namePart>
<namePart type="family">Waseem</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Florence, Italy</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>Prepositional Phrase (PP) attachment is a classical problem in NLP for languages like English, which suffer from structural ambiguity. In this work, we solve this problem with the help of another language free from such ambiguities, using the parse tree of the parallel sentence in the other language, and word alignments. We formulate an optimization framework that encourages agreement between the parse trees for two languages, and solve it using a novel Dual Decomposition (DD) based algorithm. Experiments on the English-Hindi language pair show promising improvements over the baseline.</abstract>
<identifier type="citekey">rakshit-2019-joint</identifier>
<location>
<url>https://aclanthology.org/W19-3615</url>
</location>
<part>
<date>2019-08</date>
<extent unit="page">
<start>43</start>
<end>45</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Joint Inference on Bilingual Parse Trees for PP-attachment Disambiguation
%A Rakshit, Geetanjali
%Y Axelrod, Amittai
%Y Yang, Diyi
%Y Cunha, Rossana
%Y Shaikh, Samira
%Y Waseem, Zeerak
%S Proceedings of the 2019 Workshop on Widening NLP
%D 2019
%8 August
%I Association for Computational Linguistics
%C Florence, Italy
%F rakshit-2019-joint
%X Prepositional Phrase (PP) attachment is a classical problem in NLP for languages like English, which suffer from structural ambiguity. In this work, we solve this problem with the help of another language free from such ambiguities, using the parse tree of the parallel sentence in the other language, and word alignments. We formulate an optimization framework that encourages agreement between the parse trees for two languages, and solve it using a novel Dual Decomposition (DD) based algorithm. Experiments on the English-Hindi language pair show promising improvements over the baseline.
%U https://aclanthology.org/W19-3615
%P 43-45
Markdown (Informal)
[Joint Inference on Bilingual Parse Trees for PP-attachment Disambiguation](https://aclanthology.org/W19-3615) (Rakshit, WiNLP 2019)
ACL