@inproceedings{becker-rambow-1995-parsing,
title = "Parsing Non-Immediate Dominance Relations",
author = "Becker, Tilman and
Rambow, Owen",
booktitle = "Proceedings of the Fourth International Workshop on Parsing Technologies",
month = sep # " 20-24",
year = "1995",
address = "Prague and Karlovy Vary, Czech Republic",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/1995.iwpt-1.6",
pages = "26--33",
abstract = "We present a new technique for parsing grammar formalisms that express non-immediate dominance relations by {`}dominance-links{'}. Dominance links have been introduced in various formalisms such as extensions to CFG and TAG in order to capture long-distance dependencies in free-word order languages (Becker et al., 1991; Rambow, 1994). We show how the addition of {`}link counters{'} to standard parsing algorithms such as CKY- and Earley-based methods for TAG results in a polynomial time complexity algorithm for parsing lexicalized V-TAG, a multi-component version of TAGs defined in (Rambow, 1994). A variant of this method has previously been applied to context-free grammar based formalisms such as UVG-DL.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="becker-rambow-1995-parsing">
<titleInfo>
<title>Parsing Non-Immediate Dominance Relations</title>
</titleInfo>
<name type="personal">
<namePart type="given">Tilman</namePart>
<namePart type="family">Becker</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Owen</namePart>
<namePart type="family">Rambow</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1995-sep" 20-24"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Fourth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Prague and Karlovy Vary, Czech Republic</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>We present a new technique for parsing grammar formalisms that express non-immediate dominance relations by ‘dominance-links’. Dominance links have been introduced in various formalisms such as extensions to CFG and TAG in order to capture long-distance dependencies in free-word order languages (Becker et al., 1991; Rambow, 1994). We show how the addition of ‘link counters’ to standard parsing algorithms such as CKY- and Earley-based methods for TAG results in a polynomial time complexity algorithm for parsing lexicalized V-TAG, a multi-component version of TAGs defined in (Rambow, 1994). A variant of this method has previously been applied to context-free grammar based formalisms such as UVG-DL.</abstract>
<identifier type="citekey">becker-rambow-1995-parsing</identifier>
<location>
<url>https://aclanthology.org/1995.iwpt-1.6</url>
</location>
<part>
<date>1995-sep" 20-24"</date>
<extent unit="page">
<start>26</start>
<end>33</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Parsing Non-Immediate Dominance Relations
%A Becker, Tilman
%A Rambow, Owen
%S Proceedings of the Fourth International Workshop on Parsing Technologies
%D 1995
%8 sep" 20 24"
%I Association for Computational Linguistics
%C Prague and Karlovy Vary, Czech Republic
%F becker-rambow-1995-parsing
%X We present a new technique for parsing grammar formalisms that express non-immediate dominance relations by ‘dominance-links’. Dominance links have been introduced in various formalisms such as extensions to CFG and TAG in order to capture long-distance dependencies in free-word order languages (Becker et al., 1991; Rambow, 1994). We show how the addition of ‘link counters’ to standard parsing algorithms such as CKY- and Earley-based methods for TAG results in a polynomial time complexity algorithm for parsing lexicalized V-TAG, a multi-component version of TAGs defined in (Rambow, 1994). A variant of this method has previously been applied to context-free grammar based formalisms such as UVG-DL.
%U https://aclanthology.org/1995.iwpt-1.6
%P 26-33
Markdown (Informal)
[Parsing Non-Immediate Dominance Relations](https://aclanthology.org/1995.iwpt-1.6) (Becker & Rambow, IWPT 1995)
ACL
- Tilman Becker and Owen Rambow. 1995. Parsing Non-Immediate Dominance Relations. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 26–33, Prague and Karlovy Vary, Czech Republic. Association for Computational Linguistics.