Learning reversible categorial grammars from structures
Identifieur interne : 003436 ( Istex/Corpus ); précédent : 003435; suivant : 003437Learning reversible categorial grammars from structures
Auteurs : Jérôme Besombes ; Jean-Yves MarionSource :
- 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 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><affiliation><mods:affiliation>LORIA, 615, rue du jardin botanique, 54602, Villers-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jerome.Besombes@loria.fr</mods:affiliation></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><mods:affiliation>INPL-Ecole Nationale Supérieure des Mines de Nancy, Parc de Saurupt, 54042, Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation></affiliation></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></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><mods:affiliation>LORIA, 615, rue du jardin botanique, 54602, Villers-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jerome.Besombes@loria.fr</mods:affiliation></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><mods:affiliation>INPL-Ecole Nationale Supérieure des Mines de Nancy, Parc de Saurupt, 54042, Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation></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><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Jérôme Besombes</name><affiliations><json:string>LORIA, 615, rue du jardin botanique, 54602, Villers-lès-Nancy, France</json:string><json:string>E-mail: Jerome.Besombes@loria.fr</json:string></affiliations></json:item><json:item><name>Jean-Yves Marion</name><affiliations><json:string>INPL-Ecole Nationale Supérieure des Mines de Nancy, Parc de Saurupt, 54042, Nancy Cedex, France</json:string><json:string>E-mail: Jean-Yves.Marion@loria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-49J0X10T-Z</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><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.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>105</abstractWordCount><abstractCharCount>684</abstractCharCount><keywordCount>0</keywordCount><score>6.777</score><pdfWordCount>3517</pdfWordCount><pdfCharCount>17742</pdfCharCount><pdfVersion>1.4</pdfVersion><pdfPageCount>10</pdfPageCount><pdfPageSize>439.37 x 666.142 pts</pdfPageSize></qualityIndicators><title>Learning reversible categorial grammars from structures</title><chapterId><json:string>19</json:string><json:string>Chap19</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Advances in Soft Computing</title><language><json:string>unknown</json:string></language><copyrightDate>2004</copyrightDate><issn><json:string>1867-5662</json:string></issn><eissn><json:string>1867-5670</json:string></eissn><volume>Part III</volume><editor><json:item><name>Prof. Janusz Kacprzyk</name><affiliations><json:string>Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, 01-447, Warsaw, Poland</json:string><json:string>E-mail: kacprzyk@ibspan.waw.pl</json:string></affiliations></json:item></editor></serie><host><title>Intelligent Information Processing and Web Mining</title><language><json:string>unknown</json:string></language><copyrightDate>2004</copyrightDate><doi><json:string>10.1007/978-3-540-39985-8</json:string></doi><issn><json:string>1867-5662</json:string></issn><eissn><json:string>1867-5670</json:string></eissn><eisbn><json:string>978-3-540-39985-8</json:string></eisbn><bookId><json:string>978-3-540-39985-8</json:string></bookId><isbn><json:string>978-3-540-21331-4</json:string></isbn><volume>25</volume><pages><first>181</first><last>190</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Prof. Dr. Mieczysław A. Kłopotek</name><affiliations><json:string>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</json:string></affiliations></json:item><json:item><name>Prof. Dr. Sławomir T. Wierzchoń</name><affiliations><json:string>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</json:string></affiliations></json:item><json:item><name>Dr. Krzysztof Trojanowski</name><affiliations><json:string>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</json:string></affiliations></json:item></editor><subject><json:item><value>Engineering</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item><json:item><value>Popular Computer Science</value></json:item><json:item><value>Appl.Mathematics/Computational Methods of Engineering</value></json:item><json:item><value>Information Systems and Communication Service</value></json:item><json:item><value>Simulation and Modeling</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-49J0X10T-Z</json:string></ark><publicationDate>2004</publicationDate><copyrightDate>2004</copyrightDate><doi><json:string>10.1007/978-3-540-39985-8_19</json:string></doi><id>DBE5F3DDB61630AABEBD6AE90F90A549E42C332C</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Learning reversible categorial grammars from structures</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2004">2004</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Learning reversible categorial grammars from structures</title><author><persName><forename type="first">Jérôme</forename><surname>Besombes</surname></persName><email>Jerome.Besombes@loria.fr</email><affiliation><orgName type="institution">LORIA</orgName><address><street>615, rue du jardin botanique</street><postCode>54602</postCode><settlement>Villers-lès-Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Jean-Yves</forename><surname>Marion</surname></persName><email>Jean-Yves.Marion@loria.fr</email><affiliation><orgName type="institution">INPL-Ecole Nationale Supérieure des Mines de Nancy</orgName><address><street>Parc de Saurupt</street><postCode>54042</postCode><settlement>Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">DBE5F3DDB61630AABEBD6AE90F90A549E42C332C</idno><idno type="ark">ark:/67375/HCB-49J0X10T-Z</idno><idno type="DOI">10.1007/978-3-540-39985-8_19</idno></analytic><monogr><title level="m" type="main">Intelligent Information Processing and Web Mining</title><title level="m" type="sub">Proceedings of the International IIS: IIPWM‘04 Conference held in Zakopane, Poland, May 17–20, 2004</title><title level="m" type="part">Regular Sessions: Natural Language Processing</title><idno type="DOI">10.1007/978-3-540-39985-8</idno><idno type="book-id">978-3-540-39985-8</idno><idno type="ISBN">978-3-540-21331-4</idno><idno type="eISBN">978-3-540-39985-8</idno><idno type="chapter-id">Chap19</idno><idno type="part-id">Part3</idno><editor><persName><forename type="first">Mieczysław</forename><forename type="first">A.</forename><surname>Kłopotek</surname></persName><affiliation><orgName type="department">Institute of Computer Sciences</orgName><orgName type="institution">Polish Academy of Sciences</orgName><address><street>ul. Ordona 21</street><postCode>01-237</postCode><settlement>Warszawa</settlement><country key="PL">POLAND</country></address></affiliation></editor><editor><persName><forename type="first">Sławomir</forename><forename type="first">T.</forename><surname>Wierzchoń</surname></persName><affiliation><orgName type="department">Institute of Computer Sciences</orgName><orgName type="institution">Polish Academy of Sciences</orgName><address><street>ul. Ordona 21</street><postCode>01-237</postCode><settlement>Warszawa</settlement><country key="PL">POLAND</country></address></affiliation></editor><editor><persName><forename type="first">Krzysztof</forename><surname>Trojanowski</surname></persName><affiliation><orgName type="department">Institute of Computer Sciences</orgName><orgName type="institution">Polish Academy of Sciences</orgName><address><street>ul. Ordona 21</street><postCode>01-237</postCode><settlement>Warszawa</settlement><country key="PL">POLAND</country></address></affiliation></editor><imprint><biblScope unit="vol">25</biblScope><biblScope unit="page" from="181">181</biblScope><biblScope unit="page" to="190">190</biblScope><biblScope unit="chapter-count">71</biblScope><biblScope unit="part-chapter-count">10</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Advances in Soft Computing</title><editor><persName><forename type="first">Janusz</forename><surname>Kacprzyk</surname></persName><email>kacprzyk@ibspan.waw.pl</email><affiliation><orgName type="department">Systems Research Institute</orgName><orgName type="institution">Polish Academy of Sciences</orgName><address><street>ul. Newelska 6</street><postCode>01-447</postCode><settlement>Warsaw</settlement><country key="PL">POLAND</country></address></affiliation></editor><idno type="pISSN">1867-5662</idno><idno type="eISSN">1867-5670</idno><idno type="seriesID">4240</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>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.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11647</label><item><term>Engineering</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>SCI</label><item><term type="Primary">Computer Science</term></item><label>SCI21017</label><item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term></item><label>SC521000</label><item><term type="Secondary" subtype="priority-2">Operation Research/Decision Theory</term></item><label>SCQ23000</label><item><term type="Secondary" subtype="priority-3">Popular Computer Science</term></item><label>SCT11006</label><item><term type="Secondary" subtype="priority-4">Appl.Mathematics/Computational Methods of Engineering</term></item><label>SCI18008</label><item><term type="Secondary" subtype="priority-5">Information Systems and Communication Service</term></item><label>SCI21025</label><item><term type="Secondary" subtype="priority-6">Simulation and Modeling</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation><PublisherImprintName>Springer</PublisherImprintName></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>4240</SeriesID><SeriesPrintISSN>1867-5662</SeriesPrintISSN><SeriesElectronicISSN>1867-5670</SeriesElectronicISSN><SeriesTitle Language="En">Advances in Soft Computing</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><Prefix>Prof.</Prefix><GivenName>Janusz</GivenName><FamilyName>Kacprzyk</FamilyName></EditorName><Contact><Email>kacprzyk@ibspan.waw.pl</Email></Contact></Editor><Affiliation ID="Aff1"><OrgDivision>Systems Research Institute</OrgDivision><OrgName>Polish Academy of Sciences</OrgName><OrgAddress><Street>ul. Newelska 6</Street><Postcode>01-447</Postcode><City>Warsaw</City><Country>Poland</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-39985-8</BookID><BookTitle>Intelligent Information Processing and Web Mining</BookTitle><BookSubTitle>Proceedings of the International IIS: IIPWM‘04 Conference held in Zakopane, Poland, May 17–20, 2004</BookSubTitle><BookVolumeNumber>25</BookVolumeNumber><BookSequenceNumber>25</BookSequenceNumber><BookDOI>10.1007/978-3-540-39985-8</BookDOI><BookTitleID>81463</BookTitleID><BookPrintISBN>978-3-540-21331-4</BookPrintISBN><BookElectronicISBN>978-3-540-39985-8</BookElectronicISBN><BookChapterCount>71</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2004</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="SCI" Type="Primary">Computer Science</BookSubject><BookSubject Code="SCI21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="SC521000" Priority="2" Type="Secondary">Operation Research/Decision Theory</BookSubject><BookSubject Code="SCQ23000" Priority="3" Type="Secondary">Popular Computer Science</BookSubject><BookSubject Code="SCT11006" Priority="4" Type="Secondary">Appl.Mathematics/Computational Methods of Engineering</BookSubject><BookSubject Code="SCI18008" Priority="5" Type="Secondary">Information Systems and Communication Service</BookSubject><BookSubject Code="SCI21025" Priority="6" Type="Secondary">Simulation and Modeling</BookSubject><SubjectCollection Code="SUCO11647">Engineering</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>4240</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><Prefix>Prof. Dr.</Prefix><GivenName>Mieczysław</GivenName><GivenName>A.</GivenName><FamilyName>Kłopotek</FamilyName></EditorName><Role>Conference Co-Chair</Role></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><Prefix>Prof. Dr.</Prefix><GivenName>Sławomir</GivenName><GivenName>T.</GivenName><FamilyName>Wierzchoń</FamilyName></EditorName><Role>Conference Co-Chair</Role></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><Prefix>Dr.</Prefix><GivenName>Krzysztof</GivenName><FamilyName>Trojanowski</FamilyName></EditorName><Role>Organizing Committee Chair</Role></Editor><Affiliation ID="Aff2"><OrgDivision>Institute of Computer Sciences</OrgDivision><OrgName>Polish Academy of Sciences</OrgName><OrgAddress><Street>ul. Ordona 21</Street><Postcode>01-237</Postcode><City>Warszawa</City><Country>Poland</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartNumber>Part III</PartNumber><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Regular Sessions: Natural Language Processing</PartTitle><PartChapterCount>10</PartChapterCount><PartContext><SeriesID>4240</SeriesID><BookID>978-3-540-39985-8</BookID><BookTitle>Intelligent Information Processing and Web Mining</BookTitle></PartContext></PartInfo><Chapter ID="Chap19" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><ChapterID>19</ChapterID><ChapterDOI>10.1007/978-3-540-39985-8_19</ChapterDOI><ChapterSequenceNumber>19</ChapterSequenceNumber><ChapterTitle Language="En">Learning reversible categorial grammars from structures</ChapterTitle><ChapterFirstPage>181</ChapterFirstPage><ChapterLastPage>190</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2004</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2012</Year><Month>7</Month><Day>4</Day></RegistrationDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>4240</SeriesID><PartID>3</PartID><BookID>978-3-540-39985-8</BookID><BookTitle>Intelligent Information Processing and Web Mining</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Jérôme</GivenName><FamilyName>Besombes</FamilyName></AuthorName><Contact><Email>Jerome.Besombes@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff4"><AuthorName DisplayOrder="Western"><GivenName>Jean-Yves</GivenName><FamilyName>Marion</FamilyName></AuthorName><Contact><Email>Jean-Yves.Marion@loria.fr</Email></Contact></Author><Affiliation ID="Aff3"><OrgName>LORIA</OrgName><OrgAddress><Street>615, rue du jardin botanique</Street><Postcode>54602</Postcode><City>Villers-lès-Nancy</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>INPL-Ecole Nationale Supérieure des Mines de Nancy</OrgName><OrgAddress><Street>Parc de Saurupt</Street><Postcode>54042</Postcode><City>Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En" OutputMedium="All"><Heading>Abstract</Heading><Para TextBreak="No">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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Learning reversible categorial grammars from structures</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Learning reversible categorial grammars from structures</title></titleInfo><name type="personal"><namePart type="given">Jérôme</namePart><namePart type="family">Besombes</namePart><affiliation>LORIA, 615, rue du jardin botanique, 54602, Villers-lès-Nancy, France</affiliation><affiliation>E-mail: Jerome.Besombes@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jean-Yves</namePart><namePart type="family">Marion</namePart><affiliation>INPL-Ecole Nationale Supérieure des Mines de Nancy, Parc de Saurupt, 54042, Nancy Cedex, France</affiliation><affiliation>E-mail: Jean-Yves.Marion@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2004</dateIssued><copyrightDate encoding="w3cdtf">2004</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>Intelligent Information Processing and Web Mining</title><subTitle>Proceedings of the International IIS: IIPWM‘04 Conference held in Zakopane, Poland, May 17–20, 2004</subTitle></titleInfo><name type="personal"><namePart type="termsOfAddress">Prof. Dr.</namePart><namePart type="given">Mieczysław</namePart><namePart type="given">A.</namePart><namePart type="family">Kłopotek</namePart><affiliation>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</affiliation><role><roleTerm type="text">editor</roleTerm></role><description>Conference Co-Chair</description></name><name type="personal"><namePart type="termsOfAddress">Prof. Dr.</namePart><namePart type="given">Sławomir</namePart><namePart type="given">T.</namePart><namePart type="family">Wierzchoń</namePart><affiliation>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</affiliation><role><roleTerm type="text">editor</roleTerm></role><description>Conference Co-Chair</description></name><name type="personal"><namePart type="termsOfAddress">Dr.</namePart><namePart type="given">Krzysztof</namePart><namePart type="family">Trojanowski</namePart><affiliation>Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland</affiliation><role><roleTerm type="text">editor</roleTerm></role><description>Organizing Committee Chair</description></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2004</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11647">Engineering</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="SCI">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="SCI21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="SC521000">Operation Research/Decision Theory</topic><topic authority="SpringerSubjectCodes" authorityURI="SCQ23000">Popular Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="SCT11006">Appl.Mathematics/Computational Methods of Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="SCI18008">Information Systems and Communication Service</topic><topic authority="SpringerSubjectCodes" authorityURI="SCI21025">Simulation and Modeling</topic></subject><identifier type="DOI">10.1007/978-3-540-39985-8</identifier><identifier type="ISBN">978-3-540-21331-4</identifier><identifier type="eISBN">978-3-540-39985-8</identifier><identifier type="ISSN">1867-5662</identifier><identifier type="eISSN">1867-5670</identifier><identifier type="BookTitleID">81463</identifier><identifier type="BookID">978-3-540-39985-8</identifier><identifier type="BookChapterCount">71</identifier><identifier type="BookVolumeNumber">25</identifier><identifier type="BookSequenceNumber">25</identifier><identifier type="PartChapterCount">10</identifier><part><date>2004</date><detail type="part"><title>Part III: Regular Sessions: Natural Language Processing</title></detail><detail type="volume"><number>25</number><caption>vol.</caption></detail><extent unit="pages"><start>181</start><end>190</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Advances in Soft Computing</title></titleInfo><name type="personal"><namePart type="termsOfAddress">Prof.</namePart><namePart type="given">Janusz</namePart><namePart type="family">Kacprzyk</namePart><affiliation>Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, 01-447, Warsaw, Poland</affiliation><affiliation>E-mail: kacprzyk@ibspan.waw.pl</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2004</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">1867-5662</identifier><identifier type="eISSN">1867-5670</identifier><identifier type="SeriesID">4240</identifier><part><detail type="volume"><number>Part III</number><caption>vol.</caption></detail></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></relatedItem><identifier type="istex">DBE5F3DDB61630AABEBD6AE90F90A549E42C332C</identifier><identifier type="ark">ark:/67375/HCB-49J0X10T-Z</identifier><identifier type="DOI">10.1007/978-3-540-39985-8_19</identifier><identifier type="ChapterID">19</identifier><identifier type="ChapterID">Chap19</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2004</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/record.json</uri></json:item></metadata><annexes><json:item><extension>xml</extension><original>true</original><mimetype>application/xml</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-49J0X10T-Z/annexes.xml</uri></json:item></annexes></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003436 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003436 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:DBE5F3DDB61630AABEBD6AE90F90A549E42C332C
|texte= Learning reversible categorial grammars from structures
}}
| This area was generated with Dilib version V0.6.33. |  |