InforLorV4, PascalFrancis, Corpus, bibRecord, 000499

Generating with a grammar based on tree descriptions: A constraint-based approach

Identifieur interne : 000499 ( PascalFrancis/Corpus ); précédent : 000498; suivant : 000500

Generating with a grammar based on tree descriptions: A constraint-based approach

Auteurs : Claire Gardent ; Stefan Thater

Source :

RBID : Francis:524-06-10147

Descripteurs français

Pascal (Inist)
- Linguistique informatique, Linguistique mathématique, Traitement automatique des langues naturelles, Analyse syntaxique automatique, Génération automatique, Grammaire formelle, Grammaire d'arbres adjoints, Contrainte.

English descriptors

KwdEn :
- Automatic generation, Computational linguistics, Constraint, Formal grammar, Mathematical linguistics, Natural language processing, Syntactic parsing, Tree adjoining grammar.

Abstract

While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A08	`01`	`1`	`ENG`	`@1 Generating with a grammar based on tree descriptions: A constraint-based approach`
A09	`01`	`1`	`ENG`	`@1 39th annual meeting & 10th conference of the European Chapter : Toulouse, 9-11 July 2001`
A11	`01`	`1`		`@1 GARDENT (Claire)`
A11	`02`	`1`		`@1 THATER (Stefan)`
A14	`01`			`@1 CNRS, LORIA, BP 239 Campus Scientifique @2 54506 Vandoeuvre-les-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 Computational Linguistics Universität des Saarlandes @2 Saarbrücken @3 DEU @Z 2 aut.`
A18	`01`	`1`		`@1 Association for Computational Linguistics @3 INC @9 patr.`
A20				`@1 212-219`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A25	`01`			`@1 Morgan Kaufman Publishers @2 [S. l.]`
A26	`01`			`@0 1-55860-767-6`
A30	`01`	`1`	`ENG`	`@1 Association for Computational Linguistics. Annual meeting @2 39 @3 Toulouse FRA @4 2001-07-09`
A30	`02`	`1`	`ENG`	`@1 Association for Computational Linguistics. Conference @2 10 @3 Toulouse FRA @4 2001-07-09`
A43	`01`			`@1 INIST @2 Y 38263 @5 354000124405670270`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 23 ref.`
A47	`01`	`1`		`@0 524-06-10147`
A60				`@1 C`
A61				`@0 A`
A66	`01`			`@0 INC`
A68	`01`	`1`	`FRE`	`@1 Un système de génération utilisant une grammaire basée sur des descriptions arborescentes : Une approche par contraintes`
C01	`01`		`ENG`	`@0 While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.`
C02	`01`	`L`		`@0 52478 @1 XV`
C02	`02`	`L`		`@0 524`
C03	`01`	`L`	`FRE`	`@0 Linguistique informatique @2 NI @5 02`
C03	`01`	`L`	`ENG`	`@0 Computational linguistics @2 NI @5 02`
C03	`02`	`L`	`FRE`	`@0 Linguistique mathématique @2 NI @5 03`
C03	`02`	`L`	`ENG`	`@0 Mathematical linguistics @2 NI @5 03`
C03	`03`	`L`	`FRE`	`@0 Traitement automatique des langues naturelles @2 NI @5 04`
C03	`03`	`L`	`ENG`	`@0 Natural language processing @2 NI @5 04`
C03	`04`	`L`	`FRE`	`@0 Analyse syntaxique automatique @2 NI @5 05`
C03	`04`	`L`	`ENG`	`@0 Syntactic parsing @2 NI @5 05`
C03	`05`	`L`	`FRE`	`@0 Génération automatique @2 NI @5 06`
C03	`05`	`L`	`ENG`	`@0 Automatic generation @2 NI @5 06`
C03	`06`	`L`	`FRE`	`@0 Grammaire formelle @2 NI @5 07`
C03	`06`	`L`	`ENG`	`@0 Formal grammar @2 NI @5 07`
C03	`07`	`L`	`FRE`	`@0 Grammaire d'arbres adjoints @2 NI @5 08`
C03	`07`	`L`	`ENG`	`@0 Tree adjoining grammar @2 NI @5 08`
C03	`08`	`L`	`FRE`	`@0 Contrainte @2 NI @5 09`
C03	`08`	`L`	`ENG`	`@0 Constraint @2 NI @5 09`
N21				`@1 002`

Format Inist (serveur)

NO :	FRANCIS 524-06-10147 INIST
FT :	(Un système de génération utilisant une grammaire basée sur des descriptions arborescentes : Une approche par contraintes)
ET :	Generating with a grammar based on tree descriptions: A constraint-based approach
AU :	GARDENT (Claire); THATER (Stefan)
AF :	CNRS, LORIA, BP 239 Campus Scientifique/54506 Vandoeuvre-les-Nancy/France (1 aut.); Computational Linguistics Universität des Saarlandes/Saarbrücken/Allemagne (2 aut.)
DT :	Congrès; Niveau analytique
SO :	Association for Computational Linguistics. Annual meeting/39/2001-07-09/Toulouse FRA; Inconnu; [S. l.]: Morgan Kaufman Publishers; Da. 2001; Pp. 212-219; ISBN 1-55860-767-6
LA :	Anglais
EA :	While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.
CC :	52478; 524
FD :	Linguistique informatique; Linguistique mathématique; Traitement automatique des langues naturelles; Analyse syntaxique automatique; Génération automatique; Grammaire formelle; Grammaire d'arbres adjoints; Contrainte
ED :	Computational linguistics; Mathematical linguistics; Natural language processing; Syntactic parsing; Automatic generation; Formal grammar; Tree adjoining grammar; Constraint
LO :	INIST-Y 38263.354000124405670270
ID :	524

Links to Exploration step

Francis:524-06-10147

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Generating with a grammar based on tree descriptions: A constraint-based approach</title>
<author><name sortKey="Gardent, Claire" sort="Gardent, Claire" uniqKey="Gardent C" first="Claire" last="Gardent">Claire Gardent</name>
<affiliation><inist:fA14 i1="01"><s1>CNRS, LORIA, BP 239 Campus Scientifique</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Thater, Stefan" sort="Thater, Stefan" uniqKey="Thater S" first="Stefan" last="Thater">Stefan Thater</name>
<affiliation><inist:fA14 i1="02"><s1>Computational Linguistics Universität des Saarlandes</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">524-06-10147</idno>
<date when="2001">2001</date>
<idno type="stanalyst">FRANCIS 524-06-10147 INIST</idno>
<idno type="RBID">Francis:524-06-10147</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000499</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Generating with a grammar based on tree descriptions: A constraint-based approach</title>
<author><name sortKey="Gardent, Claire" sort="Gardent, Claire" uniqKey="Gardent C" first="Claire" last="Gardent">Claire Gardent</name>
<affiliation><inist:fA14 i1="01"><s1>CNRS, LORIA, BP 239 Campus Scientifique</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Thater, Stefan" sort="Thater, Stefan" uniqKey="Thater S" first="Stefan" last="Thater">Stefan Thater</name>
<affiliation><inist:fA14 i1="02"><s1>Computational Linguistics Universität des Saarlandes</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automatic generation</term>
<term>Computational linguistics</term>
<term>Constraint</term>
<term>Formal grammar</term>
<term>Mathematical linguistics</term>
<term>Natural language processing</term>
<term>Syntactic parsing</term>
<term>Tree adjoining grammar</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Linguistique informatique</term>
<term>Linguistique mathématique</term>
<term>Traitement automatique des langues naturelles</term>
<term>Analyse syntaxique automatique</term>
<term>Génération automatique</term>
<term>Grammaire formelle</term>
<term>Grammaire d'arbres adjoints</term>
<term>Contrainte</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA08 i1="01" i2="1" l="ENG"><s1>Generating with a grammar based on tree descriptions: A constraint-based approach</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>39th annual meeting & 10th conference of the European Chapter : Toulouse, 9-11 July 2001</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>GARDENT (Claire)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>THATER (Stefan)</s1>
</fA11>
<fA14 i1="01"><s1>CNRS, LORIA, BP 239 Campus Scientifique</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Computational Linguistics Universität des Saarlandes</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>Association for Computational Linguistics</s1>
<s3>INC</s3>
<s9>patr.</s9>
</fA18>
<fA20><s1>212-219</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA25 i1="01"><s1>Morgan Kaufman Publishers</s1>
<s2>[S. l.]</s2>
</fA25>
<fA26 i1="01"><s0>1-55860-767-6</s0>
</fA26>
<fA30 i1="01" i2="1" l="ENG"><s1>Association for Computational Linguistics. Annual meeting</s1>
<s2>39</s2>
<s3>Toulouse FRA</s3>
<s4>2001-07-09</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG"><s1>Association for Computational Linguistics. Conference</s1>
<s2>10</s2>
<s3>Toulouse FRA</s3>
<s4>2001-07-09</s4>
</fA30>
<fA43 i1="01"><s1>INIST</s1>
<s2>Y 38263</s2>
<s5>354000124405670270</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>23 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>524-06-10147</s0>
</fA47>
<fA60><s1>C</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA66 i1="01"><s0>INC</s0>
</fA66>
<fA68 i1="01" i2="1" l="FRE"><s1>Un système de génération utilisant une grammaire basée sur des descriptions arborescentes : Une approche par contraintes</s1>
</fA68>
<fC01 i1="01" l="ENG"><s0>While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.</s0>
</fC01>
<fC02 i1="01" i2="L"><s0>52478</s0>
<s1>XV</s1>
</fC02>
<fC02 i1="02" i2="L"><s0>524</s0>
</fC02>
<fC03 i1="01" i2="L" l="FRE"><s0>Linguistique informatique</s0>
<s2>NI</s2>
<s5>02</s5>
</fC03>
<fC03 i1="01" i2="L" l="ENG"><s0>Computational linguistics</s0>
<s2>NI</s2>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="L" l="FRE"><s0>Linguistique mathématique</s0>
<s2>NI</s2>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="L" l="ENG"><s0>Mathematical linguistics</s0>
<s2>NI</s2>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="L" l="FRE"><s0>Traitement automatique des langues naturelles</s0>
<s2>NI</s2>
<s5>04</s5>
</fC03>
<fC03 i1="03" i2="L" l="ENG"><s0>Natural language processing</s0>
<s2>NI</s2>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="L" l="FRE"><s0>Analyse syntaxique automatique</s0>
<s2>NI</s2>
<s5>05</s5>
</fC03>
<fC03 i1="04" i2="L" l="ENG"><s0>Syntactic parsing</s0>
<s2>NI</s2>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="L" l="FRE"><s0>Génération automatique</s0>
<s2>NI</s2>
<s5>06</s5>
</fC03>
<fC03 i1="05" i2="L" l="ENG"><s0>Automatic generation</s0>
<s2>NI</s2>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="L" l="FRE"><s0>Grammaire formelle</s0>
<s2>NI</s2>
<s5>07</s5>
</fC03>
<fC03 i1="06" i2="L" l="ENG"><s0>Formal grammar</s0>
<s2>NI</s2>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="L" l="FRE"><s0>Grammaire d'arbres adjoints</s0>
<s2>NI</s2>
<s5>08</s5>
</fC03>
<fC03 i1="07" i2="L" l="ENG"><s0>Tree adjoining grammar</s0>
<s2>NI</s2>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="L" l="FRE"><s0>Contrainte</s0>
<s2>NI</s2>
<s5>09</s5>
</fC03>
<fC03 i1="08" i2="L" l="ENG"><s0>Constraint</s0>
<s2>NI</s2>
<s5>09</s5>
</fC03>
<fN21><s1>002</s1>
</fN21>
</pA>
</standard>
<server><NO>FRANCIS 524-06-10147 INIST</NO>
<FT>(Un système de génération utilisant une grammaire basée sur des descriptions arborescentes : Une approche par contraintes)</FT>
<ET>Generating with a grammar based on tree descriptions: A constraint-based approach</ET>
<AU>GARDENT (Claire); THATER (Stefan)</AU>
<AF>CNRS, LORIA, BP 239 Campus Scientifique/54506 Vandoeuvre-les-Nancy/France (1 aut.); Computational Linguistics Universität des Saarlandes/Saarbrücken/Allemagne (2 aut.)</AF>
<DT>Congrès; Niveau analytique</DT>
<SO>Association for Computational Linguistics. Annual meeting/39/2001-07-09/Toulouse FRA; Inconnu; [S. l.]: Morgan Kaufman Publishers; Da. 2001; Pp. 212-219; ISBN 1-55860-767-6</SO>
<LA>Anglais</LA>
<EA>While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.</EA>
<CC>52478; 524</CC>
<FD>Linguistique informatique; Linguistique mathématique; Traitement automatique des langues naturelles; Analyse syntaxique automatique; Génération automatique; Grammaire formelle; Grammaire d'arbres adjoints; Contrainte</FD>
<ED>Computational linguistics; Mathematical linguistics; Natural language processing; Syntactic parsing; Automatic generation; Formal grammar; Tree adjoining grammar; Constraint</ED>
<LO>INIST-Y 38263.354000124405670270</LO>
<ID>524</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000499 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000499 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Francis:524-06-10147
   |texte=   Generating with a grammar based on tree descriptions: A constraint-based approach
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Generating with a grammar based on tree descriptions: A constraint-based approach

Generating with a grammar based on tree descriptions: A constraint-based approach

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri