Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
Computational Linguistics
Polynomial time parsing of Combinatory Categorial Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Inside-outside reestimation from partially bracketed corpora
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A parsing: fast exact Viterbi parse selection
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Annealing techniques for unsupervised statistical language learning
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Linear tabling strategies and optimizations
Theory and Practice of Logic Programming
Dynamic Programming Algorithms as Products of Weighted Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A compiler for parsing schemata
Software—Practice & Experience
Vine parsing and minimum risk reranking for speed and precision
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Models for Inuktitut-English word alignment
ParaText '05 Proceedings of the ACL Workshop on Building and Using Parallel Texts
Boom analytics: exploring data-centric, declarative programming for the cloud
Proceedings of the 5th European conference on Computer systems
Generation of indexes for compiling efficient parsers from formal specifications
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Dedalus: datalog in time and space
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Compiling declarative specifications of parsing algorithms
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
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.