{"id":"https://openalex.org/W2185794695","doi":"https://doi.org/10.1162/tacl_a_00216","title":"Efficient Stacked Dependency Parsing by Forest Reranking","display_name":"Efficient Stacked Dependency Parsing by Forest Reranking","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2185794695","doi":"https://doi.org/10.1162/tacl_a_00216","mag":"2185794695"},"language":"en","primary_location":{"id":"doi:10.1162/tacl_a_00216","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00216","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/tacl_a_00216","source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/tacl_a_00216","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071048141","display_name":"Katsuhiko Hayashi","orcid":"https://orcid.org/0000-0001-7359-5939"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Katsuhiko Hayashi","raw_affiliation_strings":["Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]},{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074140925","display_name":"Shuhei Kondo","orcid":null},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shuhei Kondo","raw_affiliation_strings":["Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]},{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072032804","display_name":"Y\u016bji Matsumoto","orcid":"https://orcid.org/0000-0003-4946-9574"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuji Matsumoto","raw_affiliation_strings":["Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]},{"raw_affiliation_string":"Graduate School of Information Science Nara Institute of Science and\n Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071048141","https://openalex.org/A5072032804","https://openalex.org/A5074140925"],"corresponding_institution_ids":["https://openalex.org/I75917431"],"apc_list":null,"apc_paid":null,"fwci":6.8148,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.96667722,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"1","issue":null,"first_page":"139","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9993000030517578,"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":0.9993000030517578,"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/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9682000279426575,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.8835015296936035},{"id":"https://openalex.org/keywords/discriminative-model","display_name":"Discriminative model","score":0.7988304495811462},{"id":"https://openalex.org/keywords/treebank","display_name":"Treebank","score":0.7935038805007935},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7454164624214172},{"id":"https://openalex.org/keywords/dependency-grammar","display_name":"Dependency grammar","score":0.6699797511100769},{"id":"https://openalex.org/keywords/spurious-relationship","display_name":"Spurious relationship","score":0.6660679578781128},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6403209567070007},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.5625545978546143},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5025827884674072},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4859084188938141},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42508915066719055},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.4190690517425537},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.29916077852249146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13092613220214844},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12236487865447998}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8835015296936035},{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.7988304495811462},{"id":"https://openalex.org/C206134035","wikidata":"https://www.wikidata.org/wiki/Q811525","display_name":"Treebank","level":3,"score":0.7935038805007935},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7454164624214172},{"id":"https://openalex.org/C164883195","wikidata":"https://www.wikidata.org/wiki/Q674834","display_name":"Dependency grammar","level":3,"score":0.6699797511100769},{"id":"https://openalex.org/C97256817","wikidata":"https://www.wikidata.org/wiki/Q1462316","display_name":"Spurious relationship","level":2,"score":0.6660679578781128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6403209567070007},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.5625545978546143},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5025827884674072},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4859084188938141},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42508915066719055},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.4190690517425537},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29916077852249146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13092613220214844},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12236487865447998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1162/tacl_a_00216","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00216","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/tacl_a_00216","source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.2907","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.2907","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wing.comp.nus.edu.sg/~antho/Q/Q13/Q13-1012.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:54c6e8e5e5984c70ba5329876d849ae0","is_oa":false,"landing_page_url":"https://doaj.org/article/54c6e8e5e5984c70ba5329876d849ae0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Transactions of the Association for Computational Linguistics, Vol 1 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1162/tacl_a_00216","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00216","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/tacl_a_00216","source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7799999713897705,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2185794695.pdf","grobid_xml":"https://content.openalex.org/works/W2185794695.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W18489250","https://openalex.org/W50394141","https://openalex.org/W162171320","https://openalex.org/W174472240","https://openalex.org/W181643614","https://openalex.org/W595069947","https://openalex.org/W1639395665","https://openalex.org/W1942952754","https://openalex.org/W2092477611","https://openalex.org/W2096466920","https://openalex.org/W2102294561","https://openalex.org/W2104917081","https://openalex.org/W2105847779","https://openalex.org/W2108999232","https://openalex.org/W2114887620","https://openalex.org/W2116410915","https://openalex.org/W2119052294","https://openalex.org/W2124861326","https://openalex.org/W2125712079","https://openalex.org/W2128092251","https://openalex.org/W2134729743","https://openalex.org/W2136485846","https://openalex.org/W2136646623","https://openalex.org/W2138721411","https://openalex.org/W2146574666","https://openalex.org/W2150694619","https://openalex.org/W2152096446","https://openalex.org/W2159191667","https://openalex.org/W2161047600","https://openalex.org/W2161227214","https://openalex.org/W2988806182"],"related_works":["https://openalex.org/W1043255351","https://openalex.org/W2135057643","https://openalex.org/W2109902858","https://openalex.org/W1533278948","https://openalex.org/W1781980207","https://openalex.org/W2951759144","https://openalex.org/W28706907","https://openalex.org/W2949524199","https://openalex.org/W2017946383","https://openalex.org/W2104399512"],"abstract_inverted_index":{"This":[0],"paper":[1,64],"proposes":[2,66],"a":[3,16,28,37,67,90],"discriminative":[4,38],"forest":[5,31,87],"reranking":[6,88],"algorithm":[7],"for":[8],"dependency":[9,93],"parsing":[10],"that":[11,71],"can":[12],"be":[13],"seen":[14],"as":[15,49],"form":[17],"of":[18,76,95],"efficient":[19],"stacked":[20],"parsing.":[21],"A":[22],"dynamic":[23],"programming":[24],"shift-reduce":[25,47,69],"parser":[26,48,70],"produces":[27],"packed":[29],"derivation":[30],"which":[32],"is":[33],"then":[34],"scored":[35],"by":[36,45],"reranker,":[39],"using":[40],"the":[41,46,73,82],"1-best":[42],"tree":[43],"output":[44],"guide":[50],"features":[51],"in":[52],"addition":[53],"to":[54],"third-order":[55],"graph-based":[56],"features.":[57],"To":[58],"improve":[59],"efficiency":[60],"and":[61],"accuracy,":[62],"this":[63],"also":[65],"novel":[68],"eliminates":[72],"spurious":[74],"ambiguity":[75],"arc-standard":[77],"transition":[78],"systems.":[79],"Testing":[80],"on":[81],"English":[83],"Penn":[84],"Treebank":[85],"data,":[86],"gave":[89],"state-of-the-art":[91],"unlabeled":[92],"accuracy":[94],"93.12.":[96]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}