Compiling comp ling: Practical weighted dynamic programming and the Dyna language

HLT/EMNLP 2005 - Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2005, Pages 281-290

  Eisner, Jason ^a   Goldlust, Eric ^a   Smith, Noah A ^a  

^a Whiting School of Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM TRANSFORMATIONS;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DYNAMIC PROGRAMMING; PROGRAM COMPILERS; SPECIFICATION LANGUAGES;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 80053265598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (47)

1. J. Binder, K. Murphy, and S. Russell. 1997. Space-efficient inference in dynamic probabilistic networks. In Proc. of IJCAI.
2. S. A. Caraballo and E. Charniak. 1998. New figures of merit for best-first probabilistic chart parsing. CL, 24(2):275-298. (Pubitemid 128455531)
3. E. Charniak, S. Goldwater, and M. Johnson. 1998. Edge-based best-first chart parsing. In Proc. of COLING-ACL.
4. M. J. Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, U. of Pennsylvania.
5. J. C. Culberson and J. Schaeffer. 1998. Pattern databases. Computational Intelligence.
6. A. Dempster, N. Laird, and D. Rubin. 1977. Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1-38.
7. J. Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
8. J. Eisner and G. Satta. 1999. Efficient parsing for bilexical CFGs and headautomaton grammars. In Proc. of ACL.
9. J. Eisner and D. A. Smith. 2005a. Quasi-synchronous grammars: Alignment by soft projection of syntactic dependencies. Technical report, Johns Hopkins U.
10. J. Eisner and N. A. Smith. 2005b. Parsing with soft and hard constraints on dependency length. In Proc. of IWPT.
11. J. Eisner, E. Goldlust, and N. A. Smith. 2004. Dyna: A declarative language for implementing dynamic programs. In Proc. of ACL (companion vol.).
12. J. Eisner. 2001. Smoothing a Probabilistic Lexicon via Syntactic Transformations. Ph.D. thesis, U. of Pennsylvania.
13. J. Eisner. 2002. Parameter estimation for probabilistic FS transducers. In Proc. of ACL.
14. J. Goodman. 1999. Semiring parsing. CL, 25(4):573-605.
15. A. Griewank and G. Corliss, editors. 1991. Automatic Differentiation of Algorithms. SIAM.
16. M. Johnson. 2000. Inside-outside (computer program). http://www.cog. brown.edu/∼mj/Software.htm.
17. L. Karttunen, J.-P. Chanod, G. Grefenstette, and A. Schiller. 1996. Regular expressions for language engineering. JNLE, 2(4):305-328.
18. M. Kifer and V. S. Subrahmanian. 1992. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12(4):335-368.
19. D. Klein and C. D. Manning. 2002. A generative constituent-context model for grammar induction. In Proc. of ACL.
20. D. Klein and C. D. Manning. 2003a. A* parsing: Fast exact Viterbi parse selection. In Proc. of HLT-NAACL.
21. D. Klein and C. D. Manning. 2003b. Accurate unlexicalized parsing. In Proc. of ACL.
22. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. of ICML.
23. I. D. Melamed. 2003. Multitext grammars and synchronous parsers. In Proc. HLT-NAACL.
24. G. Minnen. 1996. Magic for filter optimization in dynamic bottom-up processing. In Proc. of ACL.
25. M. Mohri, F. Pereira, and M. Riley. 1998. A rational design for a weighted FST library. LNCS, 1436.
26. M.-J. Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. CL, 29(1):135-143. (Pubitemid 37049771)
27. I. Niemelä. 1998. Logic programs with stable model semantics as a constraint programming paradigm. In Proc. Workshop on Computational Aspects of Nonmonotonic Reasoning.
28. F. Pereira and Y. Schabes. 1992. Inside-outside reestimation from partially bracketed corpora. In Proc. of ACL.
29. F. Pereira and D. H. D. Warren. 1983. Parsing as deduction. In Proc. of ACL.
30. A. Pfeffer. 2001. IBAL: An integrated Bayesian agent language. In Proc. of IJCAI.
31. A. Prieditis. 1993. Machine discovery of effective admissible heuristics. Machine Learning, 12:117-41.
32. R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadri. 1994. The CORAL deductive system. The VLDB Journal, 3(2):161-210.
33. R. Ramakrishnan. 1991. Magic templates: a spellbinding approach to logic programs. J. Log. Program., 11(3-4):189-216.
34. K. A. Ross and Y. Sagiv. 1992. Monotonic aggregation in deductive databases. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.
35. S. M. Shieber, Y. Schabes, and F. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36.
36. K. Sikkel. 1997. Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science. Springer.
37. N. A. Smith and J. Eisner. 2004. Annealing techniques for unsupervised statistical language learning. In Proc. of ACL.
38. N. A. Smith and J. Eisner. 2005. Contrastive estimation: Training log-linear models on unlabeled data. In Proc. of ACL.
39. D. A. Smith and N. A. Smith. 2004. Bilingual parsing with factored estimation: Using English to parse Korean. In Proc. of EMNLP.
40. N. A. Smith, D. A. Smith, and R. W. Tromble. 2005. Context-based morphological disambiguation with random fields. In Proc. of HLT-EMNLP.
41. G. Specht and B. Freitag. 1995. AMOS: A NL parser implemented as a deductive database in LOLA. In Applications of Logic Databases. Kluwer.
42. A. Stolcke. 1995. An efficient probabilistic CF parsing algorithm that computes prefix probabilities. CL, 21(2):165-201.
43. H. Tamaki and T. Sato. 1984. Unfold/fold transformation of logic programs. In S. Å. Tärnlund, editor, Proceedings Second International Conference on Logic Programming, pages 127-138, Uppsala University.
44. R. J. Williams and D. Zipser. 1989. A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2):270-280.
45. D. Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. CL, 23(3):377-404.
46. N.-F. Zhou and T. Sato. 2003. Toward a high-performance system for symbolic and statistical modeling. In Proc. of Workshop on Learning Statistical Models from Relational Data.
47. U. Zukowski and B. Freitag. 1997. The deductive database system LOLA. In Logic Programming and Nonmonotonic Reasoning, LNAI 1265. Springer.