MozartV1, Main, Exploration, bibRecordById, Pascal:05-0295484

An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing

Identifieur interne : 001919 ( Main/Exploration ); précédent : 001918; suivant : 001920

An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing

Auteurs : Irene Langkilde-Geary [États-Unis]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.

RBID : ISTEX:D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9

Descripteurs français

Pascal (Inist)
- Analyse syntaxique, Approche probabiliste, Langage naturel, Langage probabiliste, Linguistique mathématique, Optimisation sous contrainte, Phrase, Satisfaction contrainte, Traitement langage.

English descriptors

KwdEn :
- Computational linguistics, Constrained optimization, Constraint satisfaction, Language processing, Natural language, Probabilistic approach, Probabilistic language, Sentence, Syntactic analysis.

Abstract

Abstract: This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.

Url:

https://api.istex.fr/document/D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9/fulltext/pdf

DOI: 10.1007/11424574_11

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing</title>
<author><name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11424574_11</idno>
<idno type="url">https://api.istex.fr/document/D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000495</idno>
<idno type="wicri:Area/Istex/Curation">000392</idno>
<idno type="wicri:Area/Istex/Checkpoint">001248</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Langkilde Geary I:an:exploratory:application</idno>
<idno type="wicri:Area/Main/Merge">001945</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:05-0295484</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000176</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000029</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000100</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Langkilde Geary I:an:exploratory:application</idno>
<idno type="wicri:Area/Main/Merge">001C50</idno>
<idno type="wicri:Area/Main/Curation">001919</idno>
<idno type="wicri:Area/Main/Exploration">001919</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing</title>
<author><name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Brigham Young University, 84602, Provo, UT</wicri:regionArea>
<placeName><region type="state">Utah</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2005</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
</series>
<idno type="istex">D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9</idno>
<idno type="DOI">10.1007/11424574_11</idno>
<idno type="ChapterID">Chap11</idno>
<idno type="ChapterID">11</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational linguistics</term>
<term>Constrained optimization</term>
<term>Constraint satisfaction</term>
<term>Language processing</term>
<term>Natural language</term>
<term>Probabilistic approach</term>
<term>Probabilistic language</term>
<term>Sentence</term>
<term>Syntactic analysis</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Analyse syntaxique</term>
<term>Approche probabiliste</term>
<term>Langage naturel</term>
<term>Langage probabiliste</term>
<term>Linguistique mathématique</term>
<term>Optimisation sous contrainte</term>
<term>Phrase</term>
<term>Satisfaction contrainte</term>
<term>Traitement langage</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.</div>
</front>
</TEI>
<affiliations><list><country><li>États-Unis</li>
</country>
<region><li>Utah</li>
</region>
</list>
<tree><country name="États-Unis"><region name="Utah"><name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
</region>
<name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration

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

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001919 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:D1044EE6FCF8E28D09A49BC2E91DBF1984208AD9
   |texte=   An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

Serveur d'exploration sur Mozart

An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing

An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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

	Serveur d'exploration sur Mozart
	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.