{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:09Z","timestamp":1725558909192},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245230"},{"type":"electronic","value":"9783540305866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30586-6_1","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T21:30:40Z","timestamp":1278365440000},"page":"1-24","source":"Crossref","is-referenced-by-count":31,"title":["An Overview of Probabilistic Tree Transducers for Natural Language Processing"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Knight","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Graehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Knight, K., Graehl, J.: Machine transliteration. Computational Linguistics\u00a024 (1998)","DOI":"10.3115\/979617.979634"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theor. Comput. Sci.\u00a0231 (2000)","DOI":"10.1016\/S0304-3975(99)00014-6"},{"key":"1_CR3","unstructured":"Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020 (1994)"},{"key":"1_CR4","unstructured":"Karttunen, L., Gaal, T., Kempe, A.: Xerox finite-state tool. Technical report, Xerox Research Centre Europe (1997)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45526-4_12","volume-title":"Automata Implementation","author":"G. Noord van","year":"2001","unstructured":"van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, p. 122. Springer, Heidelberg (2001)"},{"key":"1_CR6","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: Proc. ACL (2004)","DOI":"10.3115\/1218955.1219020"},{"key":"1_CR7","unstructured":"Graehl, J.: Carmel finite-state toolkit (1997), http:\/\/www.isi.edu\/licensed-sw\/carmel\/"},{"key":"1_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-49478-2_38","volume-title":"Machine Translation and the Information Soup","author":"K. Knight","year":"1998","unstructured":"Knight, K., Al-Onaizan, Y.: Translation with finite-state devices. In: Farwell, D., Gerber, L., Hovy, E. (eds.) AMTA 1998. LNCS (LNAI), vol.\u00a01529, pp. 421\u2013437. Springer, Heidelberg (1998)"},{"key":"1_CR9","first-page":"263","volume":"19","author":"P. Brown","year":"1993","unstructured":"Brown, P., Della Pietra, S., Della Pietra, V., Mercer, R.: The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics\u00a019, 263\u2013311 (1993)","journal-title":"Computational Linguistics"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kumar, S., Byrne, W.: A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In: Proc. NAACL (2003)","DOI":"10.3115\/1073445.1073464"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Och, F., Tillmann, C., Ney, H.: Improved alignment models for statistical machine translation. In: Proc. ACL (1999)","DOI":"10.3115\/992730.992810"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. ACL, pp. 523\u2013530 (2001)","DOI":"10.3115\/1073012.1073079"},{"key":"1_CR13","first-page":"377","volume":"23","author":"D. Wu","year":"1997","unstructured":"Wu, D.: Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics\u00a023, 377\u2013404 (1997)","journal-title":"Computational Linguistics"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/089120100561629","volume":"26","author":"H. Alshawi","year":"2000","unstructured":"Alshawi, H., Bangalore, S., Douglas, S.: Learning dependency translation models as collections of finite state head transducers. Computational Linguistics\u00a026, 45\u201360 (2000)","journal-title":"Computational Linguistics"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gildea, D.: Loosely tree-based alignment for machine translation. In: Proc. ACL, Sapporo, Japan (2003)","DOI":"10.3115\/1075096.1075107"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Eisner, J.: Learning non-isomorphic tree mappings for machine translation. In: Proc. ACL, companion volume (2003)","DOI":"10.3115\/1075178.1075217"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Melamed, I.D.: Multitext grammars and synchronous parsers. In: Proc. NAACL (2003)","DOI":"10.3115\/1073445.1073466"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Pang, B., Knight, K., Marcu, D.: Syntax-based alignment of multiple translations extracting paraphrases and generating new sentences. In: Proc. NAACL (2003)","DOI":"10.3115\/1073445.1073469"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Langkilde, I., Knight, K.: Generation that exploits corpus-based statistical knowledge. In: Proc. ACL (1998)","DOI":"10.3115\/980451.980963"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Bangalore, S., Rambow, O.: Exploiting a probabilistic hierarchical model for generation. In: International Conference on Computational Linguistics (COLING 2000), Saarbrucken, Germany (2000)","DOI":"10.3115\/990820.990827"},{"key":"1_CR22","unstructured":"Corston-Oliver, S., Gamon, M., Ringger, E.K., Moore, R.: An overview of Amalgam: A machine-learned generation module. In: Proceedings of the International Natural Language Generation Conference, New York, USA, pp. 33\u201340 (2002)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Echihabi, A., Marcu, D.: A noisy-channel approach to question answering. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, Sapporo, Japan (2003)","DOI":"10.3115\/1075096.1075099"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Charniak, E.: Immediate-head parsing for language models. In: Proc. ACL (2001)","DOI":"10.3115\/1073012.1073029"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Mathematical Systems Theory\u00a04, 257\u2013287 (1970)","journal-title":"Mathematical Systems Theory"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"J.W. Thatcher","year":"1970","unstructured":"Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. System Sci.\u00a04, 339\u2013367 (1970)","journal-title":"J. Comput. System Sci."},{"key":"1_CR27","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: Proc. NAACL (2004)"},{"key":"1_CR28","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":"1_CR29","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on www.grappa.univ-lille3.fr\/tata (release October 1, 2002)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Galley, M., Hopkins, M., Knight, K., Marcu, D.: What\u2019s in a translation rule? In: NAACL, Boston, MA (2004)","DOI":"10.21236\/ADA460212"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR32","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, London (1979)"},{"key":"1_CR33","first-page":"613","volume":"24","author":"M. Johnson","year":"1998","unstructured":"Johnson, M.: PCFG models of linguistic tree representations. Computational Linguistics\u00a024, 613\u2013632 (1998)","journal-title":"Computational Linguistics"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Collins, M.: Three generative, lexicalised models for statistical parsing. In: Proc. ACL (1997)","DOI":"10.3115\/979617.979620"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. Thatcher","year":"1967","unstructured":"Thatcher, J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci.\u00a01, 317\u2013322 (1967)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR36","unstructured":"Yamasaki, K., Sodeshima, Y.: Fundamental properties of pushdown tree transducers (PDTT) \u2014 a top-down case. IEICE Trans. Inf. and Syst.\u00a0E76-D (1993)"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory\u00a010, 289\u2013303 (1977)","journal-title":"Math. Systems Theory"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-up and top-down tree transformations \u2014 a comparison. Math. Systems Theory\u00a09, 198\u2013231 (1975)","journal-title":"Math. Systems Theory"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","volume":"73","author":"L.E. Baum","year":"1967","unstructured":"Baum, L.E., Eagon, J.A.: An inequality with application to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematical Society\u00a073, 360\u2013363 (1967)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A.V. Aho","year":"1971","unstructured":"Aho, A.V., Ullman, J.D.: Translations of a context-free grammar. Information and Control\u00a019, 439\u2013475 (1971)","journal-title":"Information and Control"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"van Noord, G.: The intersection of finite state automata and definite clause grammars. In: Proc. ACL (1995)","DOI":"10.3115\/981658.981680"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a028, 652\u2013673 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Mohri, M., Riley, M.: An efficient algorithm for the n-best-strings problem. In: Proc. ICSLP (2002)","DOI":"10.21437\/ICSLP.2002-401"},{"key":"1_CR45","unstructured":"Langkilde, I.: Forest-based statistical sentence generation. In: Proc. NAACL (2000)"},{"key":"1_CR46","unstructured":"Nederhof, M.J., Satta, G.: Parsing non-recursive CFGs. In: Proc. ACL (2002)"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Knuth, D.: A generalization of Dijkstra\u2019s algorithm. Info. Proc. Letters\u00a06 (1977)","DOI":"10.1016\/0020-0190(77)90002-3"},{"key":"1_CR48","unstructured":"Klein, D., Manning, C.: Parsing and hypergraphs. In: International Workshop on Parsing Technologies (2001)"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Nederhof, M.J.: Weighted deductive parsing and Knuth\u2019s algorithm. Computational Linguistics\u00a029 (2003)","DOI":"10.1162\/089120103321337467"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proceedings of the 13th International Conference on Computational Linguistics, Helsinki, Finland, vol.\u00a03, pp. 253\u2013258 (1990)","DOI":"10.3115\/991146.991191"}],"container-title":["Lecture Notes in Computer Science","Computational Linguistics and Intelligent Text Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30586-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:47:49Z","timestamp":1685659669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30586-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245230","9783540305866"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30586-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}