A better N-best list: Practical determinization of weighted finite tree automata

HLT-NAACL 2006 - Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2006, Pages 351-358

  May, Jonathan ^a   Knight, Kevin ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINIZATION; FINITE TREE AUTOMATON; N-BEST LIST; NON-DETERMINISM; WEIGHTED AUTOMATA;

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; TREES (MATHEMATICS);

FORESTRY;

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

References (21)

1. Rens Bod. 1992. A Computational model of language performance: data oriented parsing. In Proc. COLING
2. Rens Bod. 2003. An efficient implementation of a new DOP model. In Proc. EACL,
3. Björn Borchardt and Heiko Vogler. 2003. Determinization of finite state weighted tree automata. Journal of Automata, W Languages and Combinatorics, 8(3).
4. S. Brainerd. 1969. Tree generating regular systems. Infor-Fmation and Control, 14.
5. F. Casacuberta and C. de la Higuera. 2000. Computational complexity of problems on probabilistic grammars and transducers. In Proc. ICGI.
6. Michael Collins and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proc. ACL.
7. H. Comon and M. Dauchet and R. Gilleron and F. Jacquemard and D. Lugiez and S. Tison and M. Tommasi. 1997 Tree Automata Techniques and Applications.
8. S. DeNeefe and K. Knight and H. Chan. 2005. Interactively exploring a machine translation model. Poster in Proc. ACL.
9. Edsger W. Dijkstra 1959. A note on two problems in connexion with graphs Numerische Mathematik, 1.
10. J. E. Doner 1970. Tree acceptors and some of their applications J. Comput. System Sci., 4
11. M. Galley and M. Hopkins and K. Knight and D. Marcu. 2004. What's in a translation rule? In Proc. HLT-NAACL.
12. Ferenc Gécseg and Magnus Steinby 1984. Tree Automata. Akadémiai Kiado, Budapest.
13. Liang Huang and David Chiang 2005. Better k-best parsing In Proc. IWPT
14. Irene Langkilde and Kevin Knight 1998 The Practical Value of N-Grams in Generation In Proc. INLG.
15. M. Magidor and G. Moran. 1969. Finite automata over finite trees Technical Report 30. Hebrew University, Jerusalem.
16. Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2).
17. Mehryar Mohri and Michael Riley. 2002. An efficient algorithm for the n-best strings problem. In Proc. ICSLP.
18. M. O. Rabin. 1969. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc, 141.
19. Yves Schabes. 1990. Mathematical and computational aspects of lexicalized grammars. Ph.D. thesis. University of Pennsylvania, Philadelphia, PA.
20. Khalil Sima'an. 1996. Computational complexity of probabilistic disambiguation by means of tree-grammars. In Proc. COLING.
21. J. W. Thatcher and J. B. Wright. 1968. Generalized finite automata theory with an application to a decision problem of second order logic. Mathematical Systems Theory, 2.