{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T17:50:47Z","timestamp":1693158647751},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Machine Translation"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10590-008-9039-0","type":"journal-article","created":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T08:13:56Z","timestamp":1217924036000},"page":"121-133","source":"Crossref","is-referenced-by-count":8,"title":["Capturing practical natural language transformations"],"prefix":"10.1007","volume":"21","author":[{"given":"Kevin","family":"Knight","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,6]]},"reference":[{"key":"9039_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","volume":"20","author":"A Arnold","year":"1982","unstructured":"Arnold A, Dauchet M (1982) Morphismes et Bimorphismes d\u2019Arbres. Theor Comput Sci 20: 33\u201393","journal-title":"Theor Comput Sci"},{"key":"9039_CR2","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","volume":"73","author":"LE Baum","year":"1967","unstructured":"Baum LE, Eagon JA (1967) An inequality with application to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull Am Math Soc 73:360\u2013363","journal-title":"Bull Am Math Soc"},{"issue":"2","key":"9039_CR3","first-page":"263","volume":"19","author":"P Brown","year":"1993","unstructured":"Brown P, Della Pietra S, Della Pietra V, Mercer R (1993) The mathematics of statistical machine translation: parameter estimation. Comput Linguist 19(2): 263\u2013311","journal-title":"Comput Linguist"},{"key":"9039_CR4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J Doner","year":"1970","unstructured":"Doner J (1970) Tree acceptors and some of their applications. J Comput Syst Sci 4: 406\u2013451","journal-title":"J Comput Syst Sci"},{"key":"9039_CR5","doi-asserted-by":"crossref","unstructured":"Eisner J (2003) Learning non-isomorphic tree mappings for machine translation. In: 41st annual meeting of the Association for Computational Linguistics. Sapporo, Japan, pp 205\u2013208","DOI":"10.3115\/1075178.1075217"},{"key":"9039_CR6","unstructured":"Galley M, Hopkins M, Knight K, Marcu D (2004) What\u2019s in a translation rule? In: Proceedings of the human language technology conference of the North American chapter of the association for computational linguistics: HLT-NAACL 2004. Boston, MA, pp 273\u2013280"},{"key":"9039_CR7","volume-title":"Tree Automata","author":"F G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg F, Steinby M (1984) Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest"},{"key":"9039_CR8","unstructured":"Graehl J (1997) Carmel finite-state toolkit. http:\/\/www.isi.edu\/licensed-sw\/carmel"},{"key":"9039_CR9","unstructured":"Graehl J, Knight K (2004) Training tree transducers. In: Proceedings of the human language technology conference of the North American chapter of the association for computational linguistics: HLT-NAACL 2004. Boston, MA, pp 105\u2013112"},{"key":"9039_CR10","doi-asserted-by":"crossref","unstructured":"Knight K, Al-Onaizan Y (1998) Translation with finite-state devices. In: Machine translation and the information soup: third conference of the association for machine translation in the Americas, AMTA\u201998. Springer, Berlin, pp 421\u2013437","DOI":"10.1007\/3-540-49478-2_38"},{"issue":"4","key":"9039_CR11","first-page":"599","volume":"24","author":"K Knight","year":"1998","unstructured":"Knight K, Graehl J (1998) Machine transliteration. Comput Linguist 24(4): 599\u2013612","journal-title":"Comput Linguist"},{"key":"9039_CR12","doi-asserted-by":"crossref","unstructured":"Knight K, Graehl J (2005) An overview of probabilistic tree transducers for natural language processing. In: Computational linguistics and intelligent text processing, 6th international conference, CICLing 2005, proceedings. Lecture notes in computer science, vol 3406. Springer, Berlin, pp 1\u201324","DOI":"10.1007\/978-3-540-30586-6_1"},{"key":"9039_CR13","doi-asserted-by":"crossref","unstructured":"Kumar S, Byrne W (2003). A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In: HLT-NAACL: human language technology conference of the North American chapter of the association for computational linguistics. Edmonton, AL, Canada, pp 63\u201370","DOI":"10.3115\/1073445.1073464"},{"key":"9039_CR14","unstructured":"Maletti A (2007) Compositions of extended top-down tree transducers. In: Proceedings of the 1st international conference on language and automata theory and applications. Springer, Berlin, pp 379\u2013390"},{"key":"9039_CR15","doi-asserted-by":"crossref","unstructured":"Maletti A, Graehl J, Hopkins M, Knight K (2008) The power of extended top-down tree transducers. SIAM J Comput (to appear)","DOI":"10.1137\/070699160"},{"key":"9039_CR16","doi-asserted-by":"crossref","unstructured":"May J, Knight K (2006) Tiburon: a weighted tree automata toolkit. In: Proceedings of the international conference on implementation and application of automata (CIAA). Lecture notes in computer science, vol 4094. Springer, Berlin, pp 102\u2013113","DOI":"10.1007\/11812128_11"},{"issue":"1","key":"9039_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M Mohri","year":"2000","unstructured":"Mohri M, Pereira F, Riley M (2000) The design principles of a weighted finite-state transducer library. Theor Comput Sci 231(1): 17\u201332","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9039_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"WC Rounds","year":"1970","unstructured":"Rounds WC (1970) Mappings and grammars on trees. Math Syst Theory 4(3): 257\u2013287","journal-title":"Math Syst Theory"},{"key":"9039_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"MP Schutzenberger","year":"1961","unstructured":"Schutzenberger MP (1961) A remark on finite transducers. Inf Control 4: 185\u2013196","journal-title":"Inf Control"},{"key":"9039_CR20","unstructured":"Shen L, Xu J, Weischedel R (2008) A new string-to-dependency machine translation algorithm with a target dependency language model. In: 46th annual meeting of the association for computational linguistics: human language technologies, proceedings of the conference. Columbus, OH, pp 577\u2013585"},{"key":"9039_CR21","unstructured":"Shieber S (2004) Synchronous grammars as tree transducers. In: 7th international workshop of TAG and related formalisms (TAG+7). Vancouver, BC, Canada, pp 88\u201395"},{"key":"9039_CR22","doi-asserted-by":"crossref","unstructured":"Shieber SM, Schabes Y (1990) Synchronous tree-adjoining grammars. In: COLING-90. Papers presented to the 13th international conference on computational linguistics, vol 3. Helsinki, Finland, pp 253\u2013258","DOI":"10.3115\/991146.991191"},{"key":"9039_CR23","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"JW Thatcher","year":"1970","unstructured":"Thatcher JW (1970) Generalized sequential machine maps. J Comput System Sci 4: 339\u2013367","journal-title":"J Comput System Sci"}],"container-title":["Machine Translation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10590-008-9039-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10590-008-9039-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10590-008-9039-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:44Z","timestamp":1559227064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10590-008-9039-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9039"],"URL":"https:\/\/doi.org\/10.1007\/s10590-008-9039-0","relation":{},"ISSN":["0922-6567","1573-0573"],"issn-type":[{"value":"0922-6567","type":"print"},{"value":"1573-0573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}