Distributional Learning of Simple Context-Free Tree Grammars
Identifieur interne : 001796 ( Istex/Corpus ); précédent : 001795; suivant : 001797Distributional Learning of Simple Context-Free Tree Grammars
Auteurs : Anna Kasprzik ; Ryo YoshinakaSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.
Url:
DOI: 10.1007/978-3-642-24412-4_31
Links to Exploration step
ISTEX:B0186252445537B2343714CEAE46FF0F4725DEB8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation><mods:affiliation>FB IV Informatik, University of Trier, 54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name><affiliation><mods:affiliation>ERATO MINATO Project, Japan Science and Technology Agency, Japan</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ry@ist.hokudai.ac.jp</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B0186252445537B2343714CEAE46FF0F4725DEB8</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-24412-4_31</idno><idno type="url">https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001796</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001796</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation><mods:affiliation>FB IV Informatik, University of Trier, 54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name><affiliation><mods:affiliation>ERATO MINATO Project, Japan Science and Technology Agency, Japan</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ry@ist.hokudai.ac.jp</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">B0186252445537B2343714CEAE46FF0F4725DEB8</idno><idno type="DOI">10.1007/978-3-642-24412-4_31</idno><idno type="ChapterID">31</idno><idno type="ChapterID">Chap31</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: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Anna Kasprzik</name><affiliations><json:string>FB IV Informatik, University of Trier, 54286, Trier</json:string><json:string>E-mail: kasprzik@informatik.uni-trier.de</json:string></affiliations></json:item><json:item><name>Ryo Yoshinaka</name><affiliations><json:string>ERATO MINATO Project, Japan Science and Technology Agency, Japan</json:string><json:string>E-mail: ry@ist.hokudai.ac.jp</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</abstract><qualityIndicators><score>7.436</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.442 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>554</abstractCharCount><pdfWordCount>6855</pdfWordCount><pdfCharCount>29464</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>78</abstractWordCount></qualityIndicators><title>Distributional Learning of Simple Context-Free Tree Grammars</title><chapterId><json:string>31</json:string><json:string>Chap31</json:string></chapterId><refBibs><json:item><author><json:item><name>D López</name></json:item><json:item><name>J,M Sempere</name></json:item><json:item><name>P García</name></json:item></author><host><volume>34</volume><pages><last>1665</last><first>1658</first></pages><issue>4</issue><author></author><title>IEEE Transactions on Systems, Man, and Cybernetics Part B</title><publicationDate>2004</publicationDate></host><title>Inference of reversible tree languages</title><publicationDate>2004</publicationDate></json:item><json:item><author><json:item><name>F Drewes</name></json:item><json:item><name>J Högberg</name></json:item></author><host><pages><last>291</last><first>279</first></pages><author></author><title>DLT 2003</title><publicationDate>2003</publicationDate></host><title>Learning a regular tree language from a teacher</title><publicationDate>2003</publicationDate></json:item><json:item><author><json:item><name>J Besombes</name></json:item><json:item><name>J,Y Marion</name></json:item></author><host><volume>382</volume><pages><last>197</last><first>183</first></pages><author></author><title>Theoretical Computer Science</title><publicationDate>2007</publicationDate></host><title>Learning tree languages from positive examples and membership queries</title><publicationDate>2007</publicationDate></json:item><json:item><host><author><json:item><name>J Oncina</name></json:item><json:item><name>P Garcia</name></json:item></author><title>Inference of recognizable tree sets</title><publicationDate>1993</publicationDate></host></json:item><json:item><author><json:item><name>H Shirakawa</name></json:item><json:item><name>T Yokomori</name></json:item></author><host><volume>34</volume><pages><last>390</last><first>380</first></pages><author></author><title>Japan</title><publicationDate>1993</publicationDate></host><title>Polynomial-time MAT learning of c-deterministic context-free grammars</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>A Clark</name></json:item><json:item><name>R Eyraud</name></json:item></author><host><volume>8</volume><pages><last>1745</last><first>1725</first></pages><author></author><title>Journal of Machine Learning Research</title><publicationDate>2007</publicationDate></host><title>Polynomial identification in the limit of substitutable context-free languages</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>A Clark</name></json:item><json:item><name>R Eyraud</name></json:item><json:item><name>A Habrard</name></json:item></author><host><volume>11</volume><pages><last>2744</last><first>2707</first></pages><author></author><title>Journal of Machine Learning Research</title><publicationDate>2010</publicationDate></host><title>Using contextual representations to efficiently learn context-free languages</title><publicationDate>2010</publicationDate></json:item><json:item><host><pages><last>37</last><first>24</first></pages><author><json:item><name>A Clark</name></json:item></author><title>Distributional learning of some context-free languages with a minimally adequate teacher</title></host></json:item><json:item><author><json:item><name>A Clark</name></json:item></author><host><pages><last>30</last><first>11</first></pages><author></author><title>ALT 2010</title><publicationDate>2010</publicationDate></host><title>Towards general algorithms for grammatical inference</title><publicationDate>2010</publicationDate></json:item><json:item><author><json:item><name>R Yoshinaka</name></json:item></author><host><volume>412</volume><pages><last>1831</last><first>1821</first></pages><author></author><title>Theor. Comput. Sci</title><publicationDate>2011</publicationDate></host><title>Efficient learning of multiple context-free languages with multidimensional substitutability from positive data</title><publicationDate>2011</publicationDate></json:item><json:item><host><author><json:item><name>A,K Joshi</name></json:item></author><title>Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description Natural Language Processing</title><publicationDate>1985</publicationDate></host></json:item><json:item><author><json:item><name>R Yoshinaka</name></json:item><json:item><name>M Kanazawa</name></json:item></author><host><volume>6736</volume><pages><last>266</last><first>251</first></pages><author></author><title>LNCS</title><publicationDate>2011</publicationDate></host><title>Distributional learning of abstract categorial grammars</title><publicationDate>2011</publicationDate></json:item><json:item><author><json:item><name>H Comon</name></json:item><json:item><name>M Dauchet</name></json:item><json:item><name>R Gilleron</name></json:item><json:item><name>F Jacquemard</name></json:item><json:item><name>D Lugiez</name></json:item><json:item><name>S Tison</name></json:item><json:item><name>M Tommasi</name></json:item></author><host><author></author><title>Tree Automata Techniques and Applications</title><publicationDate>2008</publicationDate></host><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>H Seki</name></json:item><json:item><name>Y Kato</name></json:item></author><host><volume>91</volume><pages><last>221</last><first>209</first></pages><issue>2</issue><author></author><title>IEICE Transactions</title><publicationDate>2008</publicationDate></host><title>On the generative power of multiple context-free grammars and macro grammars</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>M Kanazawa</name></json:item><json:item><name>S Salvati</name></json:item></author><host><pages><last>355</last><first>344</first></pages><author></author><title>LATA 2010</title><publicationDate>2010</publicationDate></host><title>The copying power of well-nested multiple contextfree grammars</title><publicationDate>2010</publicationDate></json:item><json:item><author><json:item><name>C Lautemann</name></json:item></author><host><volume>27</volume><pages><last>421</last><first>399</first></pages><issue>5</issue><author></author><title>Acta. Inf</title><publicationDate>1990</publicationDate></host><title>The complexity of graph languages generated by hyperedge replacement</title><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>E,M Gold</name></json:item></author><host><volume>10</volume><pages><last>474</last><first>447</first></pages><issue>5</issue><author></author><title>Information and Control</title><publicationDate>1967</publicationDate></host><title>Language identification in the limit</title><publicationDate>1967</publicationDate></json:item><json:item><host><pages><last>51</last><first>38</first></pages><author><json:item><name>A Clark</name></json:item></author><title>Learning context free grammars with the syntactic concept lattice</title></host></json:item><json:item><author><json:item><name>R Yoshinaka</name></json:item></author><host><pages><last>440</last><first>429</first></pages><author></author><title>DLT 2011</title><publicationDate>2011</publicationDate></host><title>Towards dual approaches for learning context-free grammars based on syntactic concept lattices</title><publicationDate>2011</publicationDate></json:item><json:item><author><json:item><name>A Habel</name></json:item><json:item><name>H Kreowski</name></json:item></author><host><pages><last>219</last><first>207</first></pages><author></author><title>STACS 1987</title><publicationDate>1987</publicationDate></host><title>Some structural aspects of hypergraph languages generated by hyperedge replacement</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>A Clark</name></json:item></author><host><author></author><title>Proceedings of CoNLL. Association for Computational Linguistics</title><publicationDate>2010</publicationDate></host><title>Efficient, correct, unsupervised learning of context-sensitive languages</title><publicationDate>2010</publicationDate></json:item><json:item><author><json:item><name>E Charniak</name></json:item></author><host><pages><last>1036</last><first>1031</first></pages><author></author><title>Proceedings of the Thirteenth National Conference on Artificial Intelligence</title><publicationDate>1996</publicationDate></host><title>Tree-bank grammars</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>J Chen</name></json:item><json:item><name>S Bangalore</name></json:item><json:item><name>K Vijay-Shanker</name></json:item></author><host><volume>12</volume><pages><last>299</last><first>251</first></pages><author></author><title>Nat. Lang. Eng</title><publicationDate>2006</publicationDate></host><title>Automated extraction of treeadjoining grammars from treebanks</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>J,M Sempere</name></json:item><json:item><name>P García</name></json:item></author><host><author></author><title>ICGI 2010</title><publicationDate>2010</publicationDate></host><publicationDate>2010</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2011</copyrightDate></serie><host><editor><json:item><name>Jyrki Kivinen</name><affiliations><json:string>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</json:string><json:string>E-mail: jyrki.kivinen@cs.helsinki.fi</json:string></affiliations></json:item><json:item><name>Csaba Szepesvári</name><affiliations><json:string>Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, AB, Canada</json:string><json:string>E-mail: szepesva@cs.ualberta.ca</json:string></affiliations></json:item><json:item><name>Esko Ukkonen</name><affiliations><json:string>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</json:string><json:string>E-mail: ukkonen@cs.helsinki.fi</json:string></affiliations></json:item><json:item><name>Thomas Zeugmann</name><affiliations><json:string>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan</json:string><json:string>E-mail: thomas@gmail.com</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Information Systems Applications (incl. Internet)</value></json:item></subject><isbn><json:string>978-3-642-24411-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Algorithmic Learning Theory</title><bookId><json:string>978-3-642-24412-4</json:string></bookId><volume>6925</volume><pages><last>412</last><first>398</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-24412-4</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-24412-4</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-24412-4_31</json:string></doi><id>B0186252445537B2343714CEAE46FF0F4725DEB8</id><score>0.9851705</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag GmbH Berlin Heidelberg, 2011</p></availability><date>2011</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><author xml:id="author-1"><persName><forename type="first">Anna</forename><surname>Kasprzik</surname></persName><email>kasprzik@informatik.uni-trier.de</email><affiliation>FB IV Informatik, University of Trier, 54286, Trier</affiliation></author><author xml:id="author-2"><persName><forename type="first">Ryo</forename><surname>Yoshinaka</surname></persName><email>ry@ist.hokudai.ac.jp</email><affiliation>ERATO MINATO Project, Japan Science and Technology Agency, Japan</affiliation></author></analytic><monogr><title level="m">Algorithmic Learning Theory</title><title level="m" type="sub">22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings</title><idno type="pISBN">978-3-642-24411-7</idno><idno type="eISBN">978-3-642-24412-4</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-24412-4</idno><idno type="book-ID">978-3-642-24412-4</idno><idno type="book-title-ID">273482</idno><idno type="book-sequence-number">6925</idno><idno type="book-volume-number">6925</idno><idno type="book-chapter-count">35</idno><editor><persName><forename type="first">Jyrki</forename><surname>Kivinen</surname></persName><email>jyrki.kivinen@cs.helsinki.fi</email><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation></editor><editor><persName><forename type="first">Csaba</forename><surname>Szepesvári</surname></persName><email>szepesva@cs.ualberta.ca</email><affiliation>Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, AB, Canada</affiliation></editor><editor><persName><forename type="first">Esko</forename><surname>Ukkonen</surname></persName><email>ukkonen@cs.helsinki.fi</email><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation></editor><editor><persName><forename type="first">Thomas</forename><surname>Zeugmann</surname></persName><email>thomas@gmail.com</email><affiliation>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">6925</biblScope><biblScope unit="page" from="398">398</biblScope><biblScope unit="page" to="412">412</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Randy</forename><surname>Goebel</surname></persName><affiliation>University of Alberta, Edmonton, Canada</affiliation></editor><editor><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName><affiliation>University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Wolfgang</forename><surname>Wahlster</surname></persName><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Jyrki</forename><surname>Kivinen</surname></persName><email>jyrki.kivinen@cs.helsinki.fi</email><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation></editor><editor><persName><forename type="first">Csaba</forename><surname>Szepesvári</surname></persName><email>szepesva@cs.ualberta.ca</email><affiliation>Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, AB, Canada</affiliation></editor><editor><persName><forename type="first">Esko</forename><surname>Ukkonen</surname></persName><email>ukkonen@cs.helsinki.fi</email><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation></editor><editor><persName><forename type="first">Thomas</forename><surname>Zeugmann</surname></persName><email>thomas@gmail.com</email><affiliation>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan</affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope unit="seriesId">1244</biblScope></series><idno type="istex">B0186252445537B2343714CEAE46FF0F4725DEB8</idno><idno type="DOI">10.1007/978-3-642-24412-4_31</idno><idno type="ChapterID">31</idno><idno type="ChapterID">Chap31</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I21017</label><label>I16048</label><label>I16021</label><label>I16013</label><label>I1603X</label><label>I18040</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Information Systems Applications (incl. Internet)</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher 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></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Randy</GivenName><FamilyName>Goebel</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Wolfgang</GivenName><FamilyName>Wahlster</FamilyName></EditorName></Editor><Affiliation ID="Aff16"><OrgName>University of Alberta</OrgName><OrgAddress><City>Edmonton</City><Country>Canada</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>DFKI and University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-24412-4</BookID><BookTitle>Algorithmic Learning Theory</BookTitle><BookSubTitle>22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings</BookSubTitle><BookVolumeNumber>6925</BookVolumeNumber><BookSequenceNumber>6925</BookSequenceNumber><BookDOI>10.1007/978-3-642-24412-4</BookDOI><BookTitleID>273482</BookTitleID><BookPrintISBN>978-3-642-24411-7</BookPrintISBN><BookElectronicISBN>978-3-642-24412-4</BookElectronicISBN><BookChapterCount>35</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I16021" Priority="3" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I16013" Priority="4" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I1603X" Priority="5" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I18040" Priority="6" Type="Secondary">Information Systems Applications (incl. Internet)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Jyrki</GivenName><FamilyName>Kivinen</FamilyName></EditorName><Contact><Email>jyrki.kivinen@cs.helsinki.fi</Email></Contact></Editor><Editor AffiliationIDS="Aff20"><EditorName DisplayOrder="Western"><GivenName>Csaba</GivenName><FamilyName>Szepesvári</FamilyName></EditorName><Contact><Email>szepesva@cs.ualberta.ca</Email></Contact></Editor><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Esko</GivenName><FamilyName>Ukkonen</FamilyName></EditorName><Contact><Email>ukkonen@cs.helsinki.fi</Email></Contact></Editor><Editor AffiliationIDS="Aff21"><EditorName DisplayOrder="Western"><GivenName>Thomas</GivenName><FamilyName>Zeugmann</FamilyName></EditorName><Contact><Email>thomas@gmail.com</Email></Contact></Editor><Affiliation ID="Aff19"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Helsinki</OrgName><OrgAddress><Street>(Gustaf Hällströmin katu 2b)</Street><Postbox>P.O. Box 68</Postbox><Postcode>00014</Postcode><City>Helsinki</City><Country>Finland</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgDivision>Department of Computing Science</OrgDivision><OrgName>University of Alberta</OrgName><OrgAddress><Postcode>T6G 2E8</Postcode><City>Edmonton</City><State>AB</State><Country>Canada</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgDivision>Division of Computer Science</OrgDivision><OrgName>Hokkaido University</OrgName><OrgAddress><Street>N-14, W-9</Street><Postcode>060-0814</Postcode><City>Sapporo</City><Country>Japan</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part9"><PartInfo TocLevels="0"><PartID>9</PartID><PartSequenceNumber>9</PartSequenceNumber><PartTitle>Other Learning Models</PartTitle><PartChapterCount>4</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Algorithmic Learning Theory</BookTitle></PartContext></PartInfo><Chapter ID="Chap31" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>31</ChapterID><ChapterDOI>10.1007/978-3-642-24412-4_31</ChapterDOI><ChapterSequenceNumber>31</ChapterSequenceNumber><ChapterTitle Language="En">Distributional Learning of Simple Context-Free Tree Grammars</ChapterTitle><ChapterFirstPage>398</ChapterFirstPage><ChapterLastPage>412</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><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>558</SeriesID><PartID>9</PartID><BookID>978-3-642-24412-4</BookID><BookTitle>Algorithmic Learning Theory</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff22"><AuthorName DisplayOrder="Western"><GivenName>Anna</GivenName><FamilyName>Kasprzik</FamilyName></AuthorName><Contact><Email>kasprzik@informatik.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff23"><AuthorName DisplayOrder="Western"><GivenName>Ryo</GivenName><FamilyName>Yoshinaka</FamilyName></AuthorName><Contact><Email>ry@ist.hokudai.ac.jp</Email></Contact></Author><Affiliation ID="Aff22"><OrgDivision>FB IV Informatik</OrgDivision><OrgName>University of Trier</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City></OrgAddress></Affiliation><Affiliation ID="Aff23"><OrgDivision>ERATO MINATO Project</OrgDivision><OrgName>Japan Science and Technology Agency</OrgName><OrgAddress><Country>Japan</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to <Emphasis Type="Italic">simple context-free tree grammars</Emphasis> in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Distributional Learning of Simple Context-Free Tree Grammars</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Distributional Learning of Simple Context-Free Tree Grammars</title></titleInfo><name type="personal"><namePart type="given">Anna</namePart><namePart type="family">Kasprzik</namePart><affiliation>FB IV Informatik, University of Trier, 54286, Trier</affiliation><affiliation>E-mail: kasprzik@informatik.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Ryo</namePart><namePart type="family">Yoshinaka</namePart><affiliation>ERATO MINATO Project, Japan Science and Technology Agency, Japan</affiliation><affiliation>E-mail: ry@ist.hokudai.ac.jp</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</abstract><relatedItem type="host"><titleInfo><title>Algorithmic Learning Theory</title><subTitle>22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Jyrki</namePart><namePart type="family">Kivinen</namePart><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation><affiliation>E-mail: jyrki.kivinen@cs.helsinki.fi</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Csaba</namePart><namePart type="family">Szepesvári</namePart><affiliation>Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, AB, Canada</affiliation><affiliation>E-mail: szepesva@cs.ualberta.ca</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Esko</namePart><namePart type="family">Ukkonen</namePart><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation><affiliation>E-mail: ukkonen@cs.helsinki.fi</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Thomas</namePart><namePart type="family">Zeugmann</namePart><affiliation>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan</affiliation><affiliation>E-mail: thomas@gmail.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl. Internet)</topic></subject><identifier type="DOI">10.1007/978-3-642-24412-4</identifier><identifier type="ISBN">978-3-642-24411-7</identifier><identifier type="eISBN">978-3-642-24412-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">273482</identifier><identifier type="BookID">978-3-642-24412-4</identifier><identifier type="BookChapterCount">35</identifier><identifier type="BookVolumeNumber">6925</identifier><identifier type="BookSequenceNumber">6925</identifier><identifier type="PartChapterCount">4</identifier><part><date>2011</date><detail type="part"><title>Other Learning Models</title></detail><detail type="volume"><number>6925</number><caption>vol.</caption></detail><extent unit="pages"><start>398</start><end>412</end></extent></part><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Randy</namePart><namePart type="family">Goebel</namePart><affiliation>University of Alberta, Edmonton, Canada</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Wolfgang</namePart><namePart type="family">Wahlster</namePart><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jyrki</namePart><namePart type="family">Kivinen</namePart><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation><affiliation>E-mail: jyrki.kivinen@cs.helsinki.fi</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Csaba</namePart><namePart type="family">Szepesvári</namePart><affiliation>Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, AB, Canada</affiliation><affiliation>E-mail: szepesva@cs.ualberta.ca</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Esko</namePart><namePart type="family">Ukkonen</namePart><affiliation>Department of Computer Science, University of Helsinki, (Gustaf Hällströmin katu 2b), P.O. Box 68, 00014, Helsinki, Finland</affiliation><affiliation>E-mail: ukkonen@cs.helsinki.fi</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Thomas</namePart><namePart type="family">Zeugmann</namePart><affiliation>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan</affiliation><affiliation>E-mail: thomas@gmail.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">B0186252445537B2343714CEAE46FF0F4725DEB8</identifier><identifier type="DOI">10.1007/978-3-642-24412-4_31</identifier><identifier type="ChapterID">31</identifier><identifier type="ChapterID">Chap31</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001796 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001796 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:B0186252445537B2343714CEAE46FF0F4725DEB8
|texte= Distributional Learning of Simple Context-Free Tree Grammars
}}
| This area was generated with Dilib version V0.6.31. |  |