{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:25Z","timestamp":1725491425908},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_11","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"102-113","source":"Crossref","is-referenced-by-count":18,"title":["Tiburon: A Weighted Tree Automata Toolkit"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"May","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Knight","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Kaplan, R.M., Kay, M.: Phonological rules and finite-state transducers. In: Linguistic Society of America Meeting Handbook, Fifty-Sixth Annual Meeting (1981) (abstract)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki (1983)","DOI":"10.3115\/980431.980529"},{"key":"11_CR3","unstructured":"Karttunen, L., Beesley, K.R.: A short history of two-level morphology. In: ESSLLI 2001, Special Event titled Twenty Years of Finite-State Morphology, Helsinki, Finland (2001)"},{"key":"11_CR4","unstructured":"Karttunen, L., Beesley, K.R.: Two-level rule compiler. Technical Report ISTL-92-2, Xerox Palo Alto Research Center, Palo Alto, CA (1992)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Karttunen, L., Kaplan, R.M., Zaenen, A.: Two-level morphology with composition. In: COLING Proceedings (1992)","DOI":"10.3115\/992066.992091"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: The replace operator. In: ACL Proceedings (1995)","DOI":"10.3115\/981658.981661"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: Directed replacement. In: ACL Proceedings (1996)","DOI":"10.3115\/981863.981878"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Riccardi, G., Pieraccini, R., Bocchieri, E.: Stochastic automata for language modeling. Computer Speech & Language\u00a010(4) (1996)","DOI":"10.1006\/csla.1996.0014"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ljolje, A., Riley, M.D.: Optimal speech recognition using phone recognition and lexical access. In: ICSLP Proceedings (1992)","DOI":"10.21437\/ICSLP.1992-69"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science\u00a0231 (2000)","DOI":"10.1016\/S0304-3975(99)00014-6"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Proceedings of the 7th Annual AT&T Software Symposium (1997)","DOI":"10.1007\/BFb0031388"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In: 4th International Workshop on Implementing Automata (2000)","DOI":"10.1007\/3-540-45526-4_12"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kanthak, S., Ney, H.: Fsa: An efficient and flexible c++ toolkit for finite state automata using on-demand computation. In: ACL Proceedings (2004)","DOI":"10.3115\/1218955.1219020"},{"key":"11_CR14","unstructured":"Graehl, J.: Carmel finite-state toolkit (1997), http:\/\/www.isi.edu\/licensed-sw\/carmel"},{"key":"11_CR15","unstructured":"Kaiser, E., Schalkwyk, J.: Building a robust, skipping parser within the AT&T FSM toolkit. Technical report, Center for Human Computer Communication, Oregon Graduate Institute of Science and Technology (2001)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"van Noord, G.: Treatment of epsilon moves in subset construction. Comput. Linguist.\u00a026(1) (2000)","DOI":"10.1162\/089120100561638"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Koehn, P., Knight, K.: Feature-rich statistical translation of noun phrases. In: ACL Proceedings (2003)","DOI":"10.3115\/1075096.1075136"},{"key":"11_CR18","volume-title":"Finite-State Language Processing","author":"F. Pereira","year":"1997","unstructured":"Pereira, F., Riley, M.: Speech recognition by composition of weighted finite automata. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing. MIT Press, Cambridge (1997)"},{"key":"11_CR19","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2) (1997)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Mathematical Systems Theory\u00a04 (1970)","DOI":"10.1007\/BF01695769"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Och, F.J., Tillmann, C., Ney, H.: Improved alignment models for statistical machine translation. In: EMNLP\/VLC Proceedings (1999)","DOI":"10.3115\/992730.992810"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Yamada, K., Knight, K.: A syntax-based statistical translation model. In: ACL Proceedings (2001)","DOI":"10.3115\/1073012.1073079"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Eisner, J.: Learning non-isomorphic tree mappings for machine translation. In: ACL Proceedings (companion volume) (2003)","DOI":"10.3115\/1075178.1075217"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Knight, K., Marcu, D.: Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence\u00a0139 (2002)","DOI":"10.1016\/S0004-3702(02)00222-9"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Pang, B., Knight, K., Marcu, D.: Syntax-based alignment of multiple translations extracting paraphrases and generating new sentences. In: NAACL Proceedings (2003)","DOI":"10.3115\/1073445.1073469"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Charniak, E.: Immediate-head parsing for language models. In: ACL Proceedings (2001)","DOI":"10.3115\/1073012.1073029"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Yamada, K.: A Syntax-Based Translation Model. PhD thesis, University of Southern California (2002)","DOI":"10.3115\/1073012.1073079"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-30500-2_3","volume-title":"Implementation and Application of Automata","author":"C. Allauzen","year":"2005","unstructured":"Allauzen, C., Mohri, M., Roark, B.: A general weighted grammar library. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 23\u201334. Springer, Heidelberg (2005)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30586-6_1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Thatcher, J.W.: Generalized2 sequential machines. J. Comput. System Sci.\u00a04 (1970)","DOI":"10.1016\/S0022-0000(70)80017-4"},{"key":"11_CR31","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"11_CR32","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) (release October 1, 2002), Available on: http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability analysis of term rewriting systems with timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS, vol.\u00a02250, p. 695. Springer, Heidelberg (2001)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P., Vittek, M.: Elan: A logical framework based on computational systems. In: Proceedings of the first international workshop on rewriting logic (1996)","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Henriksen","year":"1995","unstructured":"Henriksen, J., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019. Springer, Heidelberg (1995)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Magidor, M., Moran, G.: Probabilistic tree automata. Israel Journal of Mathematics 8 (1969)","DOI":"10.1007\/BF02798680"},{"key":"11_CR37","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree transducers. J. Autom. Lang. Comb.\u00a09(1) (2004)"},{"key":"11_CR38","unstructured":"Kuich, W.: Tree transducers and formal tree series. Acta Cybernet\u00a014 (1999)"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Brainerd, W.S.: Tree generating regular systems. Inform. and Control\u00a014 (1969)","DOI":"10.1016\/S0019-9958(69)90065-5"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Knuth, D.: A generalization of Dijkstra\u2019s algorithm. Inform. Process. Lett.\u00a06(1) (1977)","DOI":"10.1016\/0020-0190(77)90002-3"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959)","DOI":"10.1007\/BF01386390"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Huang, L., Chiang, D.: Better k-best parsing. In: IWPT Proceedings (2005)","DOI":"10.3115\/1654494.1654500"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Galley, M., Hopkins, M., Knight, K., Marcu, D.: What\u2019s in a translation rule? In: HLT-NAACL Proceedings (2004)","DOI":"10.21236\/ADA460212"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Bod, R.: An efficient implementation of a new DOP model. In: EACL Proceedings (2003)","DOI":"10.3115\/1067807.1067812"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"May, J., Knight, K.: A better n-best list: Practical determinization of weighted finite tree automata. In: NAACL Proceedings (2006)","DOI":"10.3115\/1220835.1220880"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Siztus, A., Ortmanns, S.: High quality word graphs using forward-backward pruning. In: Proceedings of the IEEE Conference on Acoustic, Speech and Signal Processing (1999)","DOI":"10.1109\/ICASSP.1999.759736"},{"key":"11_CR47","unstructured":"Graehl, J.: Context-free algorithms (unpublished handout) (2005)"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Lari, K., Young, S.J.: The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language 4 (1990)","DOI":"10.1016\/0885-2308(90)90022-X"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D.: Translations of a context-free grammar. Inform. and Control 19 (1971)","DOI":"10.1016\/S0019-9958(71)90706-6"},{"key":"11_CR50","unstructured":"Shieber, S.M.: Synchronous grammars as tree transducers. In: TAG+7 Proceedings (2004)"},{"key":"11_CR51","unstructured":"Schabes, Y.: Mathematical and Computational Aspects of Lexicalized Grammars. PhD thesis, Univ. of Pennsylvania, Phila., PA (1990)"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Engelfriet, J.: Bottom-up and top-down tree transformations. a comparison. Mathematical Systems Theory 9 (1976)","DOI":"10.1007\/BF01704020"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B 39(1) (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"11_CR54","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: HLT-NAACL Proceedings (2004)"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Graehl, J., Knight, K., May, J.: Training tree transducers. Comput. Linguist. (submitted)","DOI":"10.1162\/coli.2008.07-051-R2-03-57"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Knight, K., Graehl, J.: Machine transliteration. Comput. Linguist. 24(4) (1998)","DOI":"10.3115\/979617.979634"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T08:59:09Z","timestamp":1683536349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/11812128_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}