@inproceedings{chappelier-etal-2002-polynomial,
title = "Polynomial Tree Substitution Grammars: Characterization and New Examples",
author = "Chappelier, Jean-C{\'e}dric and
Rajman, Martin and
Rozenknop, Antoine",
editor = "Pierrel, Jean-Marie",
booktitle = "Actes de la 9{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Posters",
month = jun,
year = "2002",
address = "Nancy, France",
publisher = "ATALA",
url = "https://aclanthology.org/2002.jeptalnrecital-poster.7/",
pages = "357--362",
abstract = "Polynomial Tree Substitution Grammars, a subclass of STSGs for which finding the most probable parse is no longer NP-hard but polynomial, are defined and characterized in terms of general properties on the elementary trees in the grammar. Various sufficient and easy to compute properties for a STSG to be polynomial are presented. The min-max selection principle is shown to be one such sufficient property. In addition, another, new, instance of a sufficient property, based on lexical heads, is presented. The performances of both models are evaluated on several corpora."
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="chappelier-etal-2002-polynomial">
<titleInfo>
<title>Polynomial Tree Substitution Grammars: Characterization and New Examples</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jean-Cédric</namePart>
<namePart type="family">Chappelier</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Martin</namePart>
<namePart type="family">Rajman</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Antoine</namePart>
<namePart type="family">Rozenknop</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2002-06</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Actes de la 9ème conférence sur le Traitement Automatique des Langues Naturelles. Posters</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jean-Marie</namePart>
<namePart type="family">Pierrel</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>ATALA</publisher>
<place>
<placeTerm type="text">Nancy, France</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>Polynomial Tree Substitution Grammars, a subclass of STSGs for which finding the most probable parse is no longer NP-hard but polynomial, are defined and characterized in terms of general properties on the elementary trees in the grammar. Various sufficient and easy to compute properties for a STSG to be polynomial are presented. The min-max selection principle is shown to be one such sufficient property. In addition, another, new, instance of a sufficient property, based on lexical heads, is presented. The performances of both models are evaluated on several corpora.</abstract>
<identifier type="citekey">chappelier-etal-2002-polynomial</identifier>
<location>
<url>https://aclanthology.org/2002.jeptalnrecital-poster.7/</url>
</location>
<part>
<date>2002-06</date>
<extent unit="page">
<start>357</start>
<end>362</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Polynomial Tree Substitution Grammars: Characterization and New Examples
%A Chappelier, Jean-Cédric
%A Rajman, Martin
%A Rozenknop, Antoine
%Y Pierrel, Jean-Marie
%S Actes de la 9ème conférence sur le Traitement Automatique des Langues Naturelles. Posters
%D 2002
%8 June
%I ATALA
%C Nancy, France
%F chappelier-etal-2002-polynomial
%X Polynomial Tree Substitution Grammars, a subclass of STSGs for which finding the most probable parse is no longer NP-hard but polynomial, are defined and characterized in terms of general properties on the elementary trees in the grammar. Various sufficient and easy to compute properties for a STSG to be polynomial are presented. The min-max selection principle is shown to be one such sufficient property. In addition, another, new, instance of a sufficient property, based on lexical heads, is presented. The performances of both models are evaluated on several corpora.
%U https://aclanthology.org/2002.jeptalnrecital-poster.7/
%P 357-362
Markdown (Informal)
[Polynomial Tree Substitution Grammars: Characterization and New Examples](https://aclanthology.org/2002.jeptalnrecital-poster.7/) (Chappelier et al., JEP/TALN/RECITAL 2002)
ACL