An attempt towards learning semantics: Distributional learning of IO context-free tree grammars

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Solid techniques based on distributional learning have been developed targeting rich subclasses of CFGs and their extensions including linear context-free tree grammars. Along this line we propose a learning algorithm for some subclasses of IO context-free tree grammars.

Original languageEnglish
Title of host publicationTAG+ 2012 - Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms
PublisherAssociation for Computational Linguistics (ACL)
Pages90-98
Number of pages9
ISBN (Electronic)9781937284466
Publication statusPublished - 2012
Event11th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2012 - Paris, France
Duration: 2012 Sep 262012 Sep 28

Publication series

NameTAG+ 2012 - Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms

Conference

Conference11th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2012
Country/TerritoryFrance
CityParis
Period12/9/2612/9/28

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'An attempt towards learning semantics: Distributional learning of IO context-free tree grammars'. Together they form a unique fingerprint.

Cite this