Multi-dimensional graph configuration for natural language processing
Identifieur interne :
000550 ( PascalFrancis/Corpus );
précédent :
000549;
suivant :
000551
Multi-dimensional graph configuration for natural language processing
Auteurs : Ralph Debusmann ;
Denys Duchier ;
Marco KuhlmannSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0294994
Descripteurs français
English descriptors
Abstract
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3438 |
|---|
| A08 | 01 | 1 | ENG | @1 Multi-dimensional graph configuration for natural language processing |
|---|
| A09 | 01 | 1 | ENG | @1 CSLP 2004 : constraint solving and language processing : Roskilde, 1-3 September 2004, revised selected and invited papers |
|---|
| A11 | 01 | 1 | | @1 DEBUSMANN (Ralph) |
|---|
| A11 | 02 | 1 | | @1 DUCHIER (Denys) |
|---|
| A11 | 03 | 1 | | @1 KUHLMANN (Marco) |
|---|
| A12 | 01 | 1 | | @1 CHRISTIANSEN (Henning) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 SKADHAUGE (Peter Rossen) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 VILLADSEN (Jorgen) @9 ed. |
|---|
| A14 | 01 | | | @1 Programming Systems Lab, Saarland University @2 Saarbrücken @3 DEU @Z 1 aut. @Z 3 aut. |
|---|
| A14 | 02 | | | @1 Équipe Calligramme, LORIA @2 Nancy @3 FRA @Z 2 aut. |
|---|
| A20 | | | | @1 104-120 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-26165-6 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124486690070 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 17 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0294994 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS. |
|---|
| C02 | 01 | X | | @0 001D02C04 |
|---|
| C03 | 01 | X | FRE | @0 Langage naturel @5 06 |
|---|
| C03 | 01 | X | ENG | @0 Natural language @5 06 |
|---|
| C03 | 01 | X | SPA | @0 Lenguaje natural @5 06 |
|---|
| C03 | 02 | X | FRE | @0 Traitement langage @5 07 |
|---|
| C03 | 02 | X | ENG | @0 Language processing @5 07 |
|---|
| C03 | 02 | X | SPA | @0 Tratamiento lenguaje @5 07 |
|---|
| C03 | 03 | X | FRE | @0 Linguistique mathématique @5 08 |
|---|
| C03 | 03 | X | ENG | @0 Computational linguistics @5 08 |
|---|
| C03 | 03 | X | SPA | @0 Linguística matemática @5 08 |
|---|
| C03 | 04 | X | FRE | @0 Contrainte espace état @5 18 |
|---|
| C03 | 04 | X | ENG | @0 State constraint @5 18 |
|---|
| C03 | 04 | X | SPA | @0 Tensión espacio estado @5 18 |
|---|
| C03 | 05 | X | FRE | @0 Grammaire @5 19 |
|---|
| C03 | 05 | X | ENG | @0 Grammar @5 19 |
|---|
| C03 | 05 | X | SPA | @0 Gramática @5 19 |
|---|
| C03 | 06 | X | FRE | @0 Satisfaction contrainte @5 23 |
|---|
| C03 | 06 | X | ENG | @0 Constraint satisfaction @5 23 |
|---|
| C03 | 06 | X | SPA | @0 Satisfaccion restricción @5 23 |
|---|
| C03 | 07 | X | FRE | @0 . @4 INC @5 82 |
|---|
| N21 | | | | @1 206 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Constraint solving and language processing. International workshop @2 1 @3 Roskilde DNK @4 2004-09-01 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 05-0294994 INIST |
|---|
| ET : | Multi-dimensional graph configuration for natural language processing |
|---|
| AU : | DEBUSMANN (Ralph); DUCHIER (Denys); KUHLMANN (Marco); CHRISTIANSEN (Henning); SKADHAUGE (Peter Rossen); VILLADSEN (Jorgen) |
|---|
| AF : | Programming Systems Lab, Saarland University/Saarbrücken/Allemagne (1 aut., 3 aut.); Équipe Calligramme, LORIA/Nancy/France (2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3438; Pp. 104-120; Bibl. 17 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS. |
|---|
| CC : | 001D02C04 |
|---|
| FD : | Langage naturel; Traitement langage; Linguistique mathématique; Contrainte espace état; Grammaire; Satisfaction contrainte; . |
|---|
| ED : | Natural language; Language processing; Computational linguistics; State constraint; Grammar; Constraint satisfaction |
|---|
| SD : | Lenguaje natural; Tratamiento lenguaje; Linguística matemática; Tensión espacio estado; Gramática; Satisfaccion restricción |
|---|
| LO : | INIST-16343.354000124486690070 |
|---|
| ID : | 05-0294994 |
|---|
Links to Exploration step
Pascal:05-0294994
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Multi-dimensional graph configuration for natural language processing</title>
<author><name sortKey="Debusmann, Ralph" sort="Debusmann, Ralph" uniqKey="Debusmann R" first="Ralph" last="Debusmann">Ralph Debusmann</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Saarland University</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Duchier, Denys" sort="Duchier, Denys" uniqKey="Duchier D" first="Denys" last="Duchier">Denys Duchier</name>
<affiliation><inist:fA14 i1="02"><s1>Équipe Calligramme, LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Kuhlmann, Marco" sort="Kuhlmann, Marco" uniqKey="Kuhlmann M" first="Marco" last="Kuhlmann">Marco Kuhlmann</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Saarland University</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0294994</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0294994 INIST</idno>
<idno type="RBID">Pascal:05-0294994</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000550</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Multi-dimensional graph configuration for natural language processing</title>
<author><name sortKey="Debusmann, Ralph" sort="Debusmann, Ralph" uniqKey="Debusmann R" first="Ralph" last="Debusmann">Ralph Debusmann</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Saarland University</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Duchier, Denys" sort="Duchier, Denys" uniqKey="Duchier D" first="Denys" last="Duchier">Denys Duchier</name>
<affiliation><inist:fA14 i1="02"><s1>Équipe Calligramme, LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Kuhlmann, Marco" sort="Kuhlmann, Marco" uniqKey="Kuhlmann M" first="Marco" last="Kuhlmann">Marco Kuhlmann</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Saarland University</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational linguistics</term>
<term>Constraint satisfaction</term>
<term>Grammar</term>
<term>Language processing</term>
<term>Natural language</term>
<term>State constraint</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Langage naturel</term>
<term>Traitement langage</term>
<term>Linguistique mathématique</term>
<term>Contrainte espace état</term>
<term>Grammaire</term>
<term>Satisfaction contrainte</term>
<term>.</term>
</keywords><front><div type="abstract" xml:lang="en">Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3438</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Multi-dimensional graph configuration for natural language processing</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>CSLP 2004 : constraint solving and language processing : Roskilde, 1-3 September 2004, revised selected and invited papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>DEBUSMANN (Ralph)</s1>
</fA11><fA11 i1="02" i2="1"><s1>DUCHIER (Denys)</s1>
</fA11><fA11 i1="03" i2="1"><s1>KUHLMANN (Marco)</s1>
</fA11><fA12 i1="01" i2="1"><s1>CHRISTIANSEN (Henning)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>SKADHAUGE (Peter Rossen)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>VILLADSEN (Jorgen)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Programming Systems Lab, Saarland University</s1>
<s2>Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="02"><s1>Équipe Calligramme, LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>104-120</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-26165-6</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124486690070</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>17 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0294994</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Langage naturel</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Natural language</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Lenguaje natural</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Traitement langage</s0>
<s5>07</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Language processing</s0>
<s5>07</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Tratamiento lenguaje</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Linguistique mathématique</s0>
<s5>08</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Computational linguistics</s0>
<s5>08</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Linguística matemática</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Contrainte espace état</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>State constraint</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Tensión espacio estado</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Grammaire</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Grammar</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Gramática</s0>
<s5>19</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>23</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03><fN21><s1>206</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Constraint solving and language processing. International workshop</s1>
<s2>1</s2>
<s3>Roskilde DNK</s3>
<s4>2004-09-01</s4>
</fA30><server><NO>PASCAL 05-0294994 INIST</NO>
<ET>Multi-dimensional graph configuration for natural language processing</ET>
<AU>DEBUSMANN (Ralph); DUCHIER (Denys); KUHLMANN (Marco); CHRISTIANSEN (Henning); SKADHAUGE (Peter Rossen); VILLADSEN (Jorgen)</AU>
<AF>Programming Systems Lab, Saarland University/Saarbrücken/Allemagne (1 aut., 3 aut.); Équipe Calligramme, LORIA/Nancy/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3438; Pp. 104-120; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (LMCPS). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xDG), a framework for the development of linguistic resources in the context of LMCPS.</EA>
<CC>001D02C04</CC>
<FD>Langage naturel; Traitement langage; Linguistique mathématique; Contrainte espace état; Grammaire; Satisfaction contrainte; .</FD>
<ED>Natural language; Language processing; Computational linguistics; State constraint; Grammar; Constraint satisfaction</ED>
<SD>Lenguaje natural; Tratamiento lenguaje; Linguística matemática; Tensión espacio estado; Gramática; Satisfaccion restricción</SD>
<LO>INIST-16343.354000124486690070</LO>
<ID>05-0294994</ID>
</server>
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 000550 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000550 | 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é= Pascal:05-0294994
|texte= Multi-dimensional graph configuration for natural language processing
}}
| 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 |  |
