Learning reversible categorial grammars from structures
Identifieur interne : 006E80 ( Main/Merge ); précédent : 006E79; suivant : 006E81Learning reversible categorial grammars from structures
Auteurs : Jérôme Besombes [France] ; Jean-Yves Marion [France]Source :
- Advances in Soft Computing [ 1867-5662 ]
Abstract
Abstract: We define the class of reversible classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakkakibara. We show that the class of reversible classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of reversible classical categorial grammars with linguistic examples.
Url:
DOI: 10.1007/978-3-540-39985-8_19
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003436
- to stream Istex, to step Curation: 003394
- to stream Istex, to step Checkpoint: 001785
Links to Exploration step
ISTEX:DBE5F3DDB61630AABEBD6AE90F90A549E42C332CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Learning reversible categorial grammars from structures</title><author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DBE5F3DDB61630AABEBD6AE90F90A549E42C332C</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-39985-8_19</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003436</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003436</idno><idno type="wicri:Area/Istex/Curation">003394</idno><idno type="wicri:Area/Istex/Checkpoint">001785</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001785</idno><idno type="wicri:doubleKey">1867-5662:2004:Besombes J:learning:reversible:categorial</idno><idno type="wicri:Area/Main/Merge">006E80</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Learning reversible categorial grammars from structures</title><author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, 615, rue du jardin botanique, 54602, Villers-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INPL-Ecole Nationale Supérieure des Mines de Nancy, Parc de Saurupt, 54042, Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Advances in Soft Computing</title><idno type="ISSN">1867-5662</idno><idno type="eISSN">1867-5670</idno><idno type="ISSN">1867-5662</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1867-5662</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We define the class of reversible classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakkakibara. We show that the class of reversible classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of reversible classical categorial grammars with linguistic examples.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006E80 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006E80 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:DBE5F3DDB61630AABEBD6AE90F90A549E42C332C
|texte= Learning reversible categorial grammars from structures
}}
| This area was generated with Dilib version V0.6.33. |  |