Efficient enumeration of weighted tree languages over the tropical semiring
暂无分享,去创建一个
[1] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[2] Anoop Sarkar,et al. Discriminative Reranking for Machine Translation , 2004, NAACL.
[3] Mehryar Mohri,et al. A weight pushing algorithm for large vocabulary speech recognition , 2001, INTERSPEECH.
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[5] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[6] Heiko Vogler,et al. n-Best Parsing Revisited , 2010, ATANLP@ACL 2010.
[7] Mehryar Mohri,et al. An efficient algorithm for the n-best-strings problem , 2002, INTERSPEECH.
[8] Björn Borchardt,et al. A Pumping Lemma and Decidability Problems for Recognizable Tree Series , 2004, Acta Cybern..
[9] Frank Drewes,et al. An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring , 2015, LATA.
[10] Michael Collins,et al. Discriminative Reranking for Natural Language Parsing , 2000, CL.
[11] H. Vogler,et al. Weighted Tree Automata and Tree Transducers , 2009 .
[12] Shankar Kumar,et al. Minimum Bayes-Risk Decoding for Statistical Machine Translation , 2004, NAACL.
[13] David Chiang,et al. Better k-best Parsing , 2005, IWPT.
[14] Peter Lammich,et al. Tree Automata , 2009, Arch. Formal Proofs.
[15] Ferenc Gécseg,et al. Tree Languages , 1997, Handbook of Formal Languages.
[16] Jesse B. Wright,et al. Algebraic Automata and Context-Free Sets , 1967, Inf. Control..
[17] Joshua Goodman,et al. Parsing Inside-Out , 1998, ArXiv.
[18] Daniel Jurafsky,et al. Automatic Labeling of Semantic Roles , 2002, CL.
[19] Andrew McCallum,et al. An Integrated, Conditional Model of Information Extraction and Coreference with Appli , 2004, UAI.