{"id":"https://openalex.org/W2150752478","doi":"https://doi.org/10.1093/logcom/exs050","title":"Tree parsing for tree-adjoining machine translation","display_name":"Tree parsing for tree-adjoining machine translation","publication_year":2012,"publication_date":"2012-12-06","ids":{"openalex":"https://openalex.org/W2150752478","doi":"https://doi.org/10.1093/logcom/exs050","mag":"2150752478"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exs050","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs050","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089195037","display_name":"Matthias B\u00fcchse","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Buchse","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: matthias.buechse@tu-dresden.de; heiko.vogler@tu-dresden.de","Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: ;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: matthias.buechse@tu-dresden.de; heiko.vogler@tu-dresden.de","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: ;","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013068281","display_name":"Heiko Vogler","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"H. Vogler","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: matthias.buechse@tu-dresden.de; heiko.vogler@tu-dresden.de","Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: ;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: matthias.buechse@tu-dresden.de; heiko.vogler@tu-dresden.de","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dresden, D-01062 Dresden, Germany. E-mail: ;","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088112856","display_name":"Mark-Jan Nederhof","orcid":"https://orcid.org/0000-0002-1845-6829"},"institutions":[{"id":"https://openalex.org/I16835326","display_name":"University of St Andrews","ror":"https://ror.org/02wn5qz54","country_code":"GB","type":"education","lineage":["https://openalex.org/I16835326"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M.-J. Nederhof","raw_affiliation_strings":["School of Computer Science, University of St Andrews, North Haugh, St Andrews, KY16 9SX, UK. E-mail: markjan.nederhof@googlemail.com","School of Computer Science, University of St Andrews, North Haugh, St Andrews, KY16 9SX, UK. E-mail:"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of St Andrews, North Haugh, St Andrews, KY16 9SX, UK. E-mail: markjan.nederhof@googlemail.com","institution_ids":["https://openalex.org/I16835326"]},{"raw_affiliation_string":"School of Computer Science, University of St Andrews, North Haugh, St Andrews, KY16 9SX, UK. E-mail:","institution_ids":["https://openalex.org/I16835326"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089195037"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.8563,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80107233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"2","first_page":"351","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7437589764595032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7370134592056274},{"id":"https://openalex.org/keywords/synchronous-context-free-grammar","display_name":"Synchronous context-free grammar","score":0.7336674928665161},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6939489245414734},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6540710926055908},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6301122903823853},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.5963601469993591},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.5069356560707092},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.4959641396999359},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4727638363838196},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.46861323714256287},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.4676399230957031},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.44620436429977417},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.4445878565311432},{"id":"https://openalex.org/keywords/machine-translation","display_name":"Machine translation","score":0.4405289590358734},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.43623805046081543},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4321368932723999},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.42418229579925537},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.42181068658828735},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41464120149612427},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3437809348106384},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.3191761076450348},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3163028657436371},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3123317360877991},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.3064267337322235},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2931886315345764},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.28599804639816284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2542649507522583},{"id":"https://openalex.org/keywords/example-based-machine-translation","display_name":"Example-based machine translation","score":0.24344423413276672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14006680250167847},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.10730519890785217},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.10599488019943237},{"id":"https://openalex.org/keywords/phrase-structure-rules","display_name":"Phrase structure rules","score":0.08891448378562927}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7437589764595032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7370134592056274},{"id":"https://openalex.org/C51802942","wikidata":"https://www.wikidata.org/wiki/Q7662211","display_name":"Synchronous context-free grammar","level":4,"score":0.7336674928665161},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6939489245414734},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6540710926055908},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6301122903823853},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.5963601469993591},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.5069356560707092},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.4959641396999359},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4727638363838196},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.46861323714256287},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4676399230957031},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.44620436429977417},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.4445878565311432},{"id":"https://openalex.org/C203005215","wikidata":"https://www.wikidata.org/wiki/Q79798","display_name":"Machine translation","level":2,"score":0.4405289590358734},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.43623805046081543},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4321368932723999},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.42418229579925537},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.42181068658828735},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41464120149612427},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3437809348106384},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.3191761076450348},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3163028657436371},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3123317360877991},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.3064267337322235},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2931886315345764},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.28599804639816284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2542649507522583},{"id":"https://openalex.org/C24687705","wikidata":"https://www.wikidata.org/wiki/Q3753284","display_name":"Example-based machine translation","level":3,"score":0.24344423413276672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14006680250167847},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.10730519890785217},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.10599488019943237},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.08891448378562927},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exs050","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs050","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6000000238418579}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W112693011","https://openalex.org/W1479758177","https://openalex.org/W1484394245","https://openalex.org/W1510052640","https://openalex.org/W1512419429","https://openalex.org/W1564942370","https://openalex.org/W1584587517","https://openalex.org/W1588498058","https://openalex.org/W1629199664","https://openalex.org/W1678007706","https://openalex.org/W1678112959","https://openalex.org/W1787603634","https://openalex.org/W1914208668","https://openalex.org/W1933717390","https://openalex.org/W1963587568","https://openalex.org/W1964071625","https://openalex.org/W1981992674","https://openalex.org/W1994920572","https://openalex.org/W2002597220","https://openalex.org/W2013686726","https://openalex.org/W2030307112","https://openalex.org/W2032175749","https://openalex.org/W2037894654","https://openalex.org/W2047092246","https://openalex.org/W2049167443","https://openalex.org/W2049633694","https://openalex.org/W2096175520","https://openalex.org/W2096894677","https://openalex.org/W2099851297","https://openalex.org/W2101061757","https://openalex.org/W2115289978","https://openalex.org/W2115753373","https://openalex.org/W2118439278","https://openalex.org/W2121170863","https://openalex.org/W2121380975","https://openalex.org/W2122472280","https://openalex.org/W2124177451","https://openalex.org/W2125474347","https://openalex.org/W2128517960","https://openalex.org/W2131236363","https://openalex.org/W2134495021","https://openalex.org/W2143008661","https://openalex.org/W2146050252","https://openalex.org/W2146574666","https://openalex.org/W2149831156","https://openalex.org/W2154124206","https://openalex.org/W2164104198","https://openalex.org/W2166210475","https://openalex.org/W2176903511","https://openalex.org/W2339956247","https://openalex.org/W2437005631","https://openalex.org/W2911246871","https://openalex.org/W3003374142","https://openalex.org/W4210277633"],"related_works":["https://openalex.org/W2151076275","https://openalex.org/W1556207603","https://openalex.org/W2404292018","https://openalex.org/W142785929","https://openalex.org/W2150752478","https://openalex.org/W2134595964","https://openalex.org/W2623496437","https://openalex.org/W2391124116","https://openalex.org/W1991375144","https://openalex.org/W2064420074"],"abstract_inverted_index":{"Tree":[0],"parsing":[1,93],"is":[2,14,38,77,119],"an":[3,154],"important":[4],"problem":[5,94],"in":[6,142],"statistical":[7],"machine":[8,73],"translation.":[9],"In":[10,71],"this":[11,85,146],"context,":[12],"one":[13,25],"given":[15,55],"(a)":[16],"a":[17,31,41,78,112],"synchronous":[18,81,115],"grammar":[19,76],"that":[20,50,156],"describes":[21],"the":[22,36,45,54,59,66,75,91,102,107,133,143],"translation":[23,74],"from":[24,53],"language":[26],"into":[27],"another":[28],"and":[29,124,162],"(b)":[30],"recognizable":[32],"set":[33,46],"of":[34,44,47,80,114],"trees;":[35],"aim":[37],"to":[39,90,101,106,127],"construct":[40],"finite":[42],"representation":[43],"those":[48],"derivations":[49],"derive":[51],"elements":[52],"set,":[56],"either":[57],"on":[58,65],"source":[60],"side":[61,68],"(input":[62],"restriction)":[63],"or":[64],"target":[67],"(output":[69],"restriction).":[70],"tree-adjoining":[72,82,116],"kind":[79],"grammar.":[83],"For":[84],"case,":[86,104],"only":[87],"partial":[88],"solutions":[89],"tree":[92,130],"have":[95],"been":[96],"described,":[97],"some":[98,105],"being":[99],"restricted":[100,134],"unweighted":[103],"monolingual":[108],"case.":[109],"We":[110],"introduce":[111],"class":[113],"grammars":[117,141,159],"which":[118],"effectively":[120],"closed":[121],"under":[122],"input":[123,161],"output":[125,163],"restrictions":[126],"weighted":[128],"regular":[129],"languages,":[131],"i.e.":[132],"translations":[135],"can":[136],"again":[137],"be":[138],"represented":[139],"by":[140],"same":[144],"class;":[145],"enables,":[147],"e.g.":[148],"cascading":[149],"restrictions.":[150],"Moreover,":[151],"we":[152],"present":[153],"algorithm":[155],"constructs":[157],"these":[158],"for":[160],"restriction.":[164]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}