Dyna: a declarative language for implementing dynamic programs Export

@inproceedings{eisner-etal-acl04, abstract = {We present the first version of a new declarative programming language. Dyna has many uses but was designed especially for rapid development of new statistical NLP systems. A Dyna program is a small set of equations, resembling Prolog inference rules, that specify the abstract structure of a dynamic programming algorithm. It compiles into efficient, portable, C++ classes that can be easily invoked from a larger application. By default, these classes run a generalization of agenda-based parsing, prioritizing the partial parses by some figure of merit. The classes can also perform an exact backward (outside) pass in the service of parameter training. The compiler already knows several implementation tricks, algorithmic transforms, and numerical optimization techniques. It will acquire more over time: we intend for it to generalize and encapsulate best practices, and serve as a testbed for new practices. Dyna is now being used for parsing, machine translation, morphological analysis, grammar induction, and finite-state modeling.}, address = {Morristown, NJ, USA}, author = {Eisner, Jason and Goldlust, Eric and Smith, Noah A.}, booktitle = {Proceedings of the ACL 2004 on Interactive poster and demonstration sessions}, citeulike-article-id = {3255420}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1219044.1219076}, citeulike-linkout-1 = {http://dx.doi.org/10.3115/1219044.1219076}, doi = {10.3115/1219044.1219076}, keywords = {declarative, programming}, location = {Barcelona, Spain}, posted-at = {2008-09-14 22:02:48}, priority = {2}, publisher = {Association for Computational Linguistics}, title = {Dyna: a declarative language for implementing dynamic programs}, url = {http://dx.doi.org/10.3115/1219044.1219076}, year = {2004} }

TY - CONF ID - eisner-etal-acl04 L3 - citeulike-article-id:3255420 N2 - We present the first version of a new declarative programming language. Dyna has many uses but was designed especially for rapid development of new statistical NLP systems. A Dyna program is a small set of equations, resembling Prolog inference rules, that specify the abstract structure of a dynamic programming algorithm. It compiles into efficient, portable, C++ classes that can be easily invoked from a larger application. By default, these classes run a generalization of agenda-based parsing, prioritizing the partial parses by some figure of merit. The classes can also perform an exact backward (outside) pass in the service of parameter training. The compiler already knows several implementation tricks, algorithmic transforms, and numerical optimization techniques. It will acquire more over time: we intend for it to generalize and encapsulate best practices, and serve as a testbed for new practices. Dyna is now being used for parsing, machine translation, morphological analysis, grammar induction, and finite-state modeling. CY - Barcelona, Spain AD - Morristown, NJ, USA TI - Dyna: a declarative language for implementing dynamic programs PB - Association for Computational Linguistics T2 - Proceedings of the ACL 2004 on Interactive poster and demonstration sessions KW - declarative KW - programming AU - Eisner, Jason AU - Goldlust, Eric AU - Smith, Noah PY - 2004/// UR - http://dx.doi.org/10.3115/1219044.1219076 ER -