Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language (2005)
Cached
Download Links
| Venue: | In Advances in Probabilistic and Other Parsing |
| Citations: | 9 - 7 self |
BibTeX
@INPROCEEDINGS{Eisner05compilingcomp,
author = {Jason Eisner and Eric Goldlust and Noah A. Smith},
title = {Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language},
booktitle = {In Advances in Probabilistic and Other Parsing},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Weighted deduction with aggregation is a powerful theoretical formalism that encompasses many NLP algorithms. This paper proposes a declarative specification language, Dyna; gives general agenda-based algorithms for computing weights and gradients; briefly discusses Dyna-to-Dyna program transformations; and shows that a first implementation of a Dyna-to-C++ compiler produces code that is efficient enough for real NLP research, though still several times slower than hand-crafted code. 1
