Two Equivalent Regularizations for Tree Adjoining Grammars
Identifieur interne : 000E44 ( Main/Exploration ); précédent : 000E43; suivant : 000E45Two Equivalent Regularizations for Tree Adjoining Grammars
Auteurs : Anna KasprzikSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: We present and compare two methods of how to make derivation in a Tree Adjoining Grammar a regular process (in the Chomsky hierarchy sense) without loss of expressive power. One regularization method is based on an algebraic operation called Lifting, while the other exploits an additional spatial dimension by transforming the components of a TAG into three-dimensional trees. The regularized grammars generate two kinds of “encoded” trees, from which the intended ones can be reconstructed by a simple decoding function. We can show the equivalence of these two two-step approaches by giving a direct translation between lifted and three-dimensional trees and proving that via this translation it is possible to switch between the encodings without losing the information necessary for the reconstruction of the intended trees.
Url:
DOI: 10.1007/978-3-642-00982-2_40
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001A50
- to stream Istex, to step Curation: 001933
- to stream Istex, to step Checkpoint: 000391
- to stream Main, to step Merge: 000F18
- to stream Main, to step Curation: 000E44
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Two Equivalent Regularizations for Tree Adjoining Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B71467CCB0267521D8E3E195076903E90DAB8787</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-00982-2_40</idno><idno type="url">https://api.istex.fr/document/B71467CCB0267521D8E3E195076903E90DAB8787/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A50</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A50</idno><idno type="wicri:Area/Istex/Curation">001933</idno><idno type="wicri:Area/Istex/Checkpoint">000391</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000391</idno><idno type="wicri:doubleKey">0302-9743:2009:Kasprzik A:two:equivalent:regularizations</idno><idno type="wicri:Area/Main/Merge">000F18</idno><idno type="wicri:Area/Main/Curation">000E44</idno><idno type="wicri:Area/Main/Exploration">000E44</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Two Equivalent Regularizations for Tree Adjoining Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">B71467CCB0267521D8E3E195076903E90DAB8787</idno><idno type="DOI">10.1007/978-3-642-00982-2_40</idno><idno type="ChapterID">40</idno><idno type="ChapterID">Chap40</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present and compare two methods of how to make derivation in a Tree Adjoining Grammar a regular process (in the Chomsky hierarchy sense) without loss of expressive power. One regularization method is based on an algebraic operation called Lifting, while the other exploits an additional spatial dimension by transforming the components of a TAG into three-dimensional trees. The regularized grammars generate two kinds of “encoded” trees, from which the intended ones can be reconstructed by a simple decoding function. We can show the equivalence of these two two-step approaches by giving a direct translation between lifted and three-dimensional trees and proving that via this translation it is possible to switch between the encodings without losing the information necessary for the reconstruction of the intended trees.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E44 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000E44 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B71467CCB0267521D8E3E195076903E90DAB8787
|texte= Two Equivalent Regularizations for Tree Adjoining Grammars
}}
| This area was generated with Dilib version V0.6.31. |  |