DAGGER: A toolkit for automata on directed acyclic graphs

FSMNLP 2012 - Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing

Volumn , Issue , 2012, Pages 40-44

  Quernheim, Daniel ^a   Knight, Kevin ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; NATURAL LANGUAGE PROCESSING SYSTEMS;

BASIC OPERATION; BOTTOM UP; FINITE-STATE AUTOMATA; TREE TRANSDUCERS;

DIRECTED GRAPHS;

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

References (24)

1. John A. Bateman. 1990. Upper modeling: organizing knowledge for natural language processing. In Proc. Natural Language Generation Workshop, pages 54- 60.
2. L. E. Baum, T. Petrie, G. Soules, and N. Weiss. 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Statist., 41(1):164171.
3. Bernd Bohnet and Leo Wanner. 2010. Open source graph transducer interpreter and grammar development environment. In Proc. LREC.
4. Björn Borchardt and Heiko Vogler. 2003. Determinization of finite state weighted tree automata. J. Autom. Lang. Comb., 8(3):417-463.
5. Loek G. W. A. Cleophas. 2008. Tree Algorithms: Two Taxonomies and a Toolkit. Ph.D. thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology.
6. Jason Eisner. 2003. Learning non-isomorphic tree mappings for machine translation. In Proc. ACL, pages 205-208.
7. David Eppstein. 1998. Finding the k shortest paths. SIAM J. Comput., 28(2):652-673.
8. Jonathan Graehl, Kevin Knight, and Jonathan May. 2008. Training tree transducers. Comput. Linguist., 34(3):391-427.
9. Jonathan Graehl. 1997. Carmel finite-state toolkit. http://www.isi.edu/licensed-sw/ carmel.
10. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proc. IWPT.
11. Víctor M. Jiménez and Andrés Marzal. 2000. Computation of the n best parse trees for weighted and stochastic context-free grammars. In Proc. SSPR/SPR, pages 183-192.
12. Tsutomu Kamimura and Giora Slutzki. 1981. Parallel and two-way automata on directed ordered acyclic graphs. Inf. Control, 49(1):10-51.
13. Tsutomu Kamimura and Giora Slutzki. 1982. Transductions of dags and trees. Math. Syst. Theory, 15(3):225- 249.
14. Kevin Knight and Jonathan May. 2009. Applications of weighted automata in natural language processing. In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata. Springer.
15. Andreas Maletti, Jonathan Graehl, Mark Hopkins, and Kevin Knight. 2009. The power of extended top-down tree transducers. SIAM J. Comput., 39(2):410-430.
16. Jonathan May and Kevin Knight. 2006a. A better n-best list: Practical determinization of weighted finite tree automata. In Proc. HLT-NAACL.
17. Jonathan May and Kevin Knight. 2006b. Tiburon: A weighted tree automata toolkit. In Oscar H. Ibarra and Hsu-Chun Yen, editors, Proc. CIAA, volume 4094 of LNCS, pages 102-113. Springer.
18. Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. 2000. The design principles of a weighted finite-state transducer library. Theor. Comput. Sci., 231(1):17-32.
19. Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311.
20. Fernando Pereira and Michael Riley. 1997. Speech recognition by composition of weighted finite automata. In Finite-State Language Processing, pages 431-453. MIT Press.
21. Daniel Quernheim and Kevin Knight. 2012. Towards probabilistic acceptors and transducers for feature structures. In Proc. SSST. (to appear).
22. Michael Riley, Cyril Allauzen, and Martin Jansche. 2009. OpenFST: An open-source, weighted finitestate transducer library and its applications to speech and language. In Proc. HLT-NAACL (Tutorial Abstracts), pages 9-10.
23. Roger Strolenberg. 2007. ForestFIRE and FIREWood. a toolkit & GUI for tree algorithms. Master's thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology.
24. Andrew Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2):260-269.