{"id":"https://openalex.org/W2517139211","doi":"https://doi.org/10.18653/v1/p16-1192","title":"Efficient techniques for parsing with tree automata","display_name":"Efficient techniques for parsing with tree automata","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2517139211","doi":"https://doi.org/10.18653/v1/p16-1192","mag":"2517139211"},"language":"en","primary_location":{"id":"doi:10.18653/v1/p16-1192","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/p16-1192","pdf_url":"https://www.aclweb.org/anthology/P16-1192.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.aclweb.org/anthology/P16-1192.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065101966","display_name":"Jonas Groschwitz","orcid":"https://orcid.org/0000-0002-0903-9716"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jonas Groschwitz","raw_affiliation_strings":["Department of Linguistics University of Potsdam Germany"],"affiliations":[{"raw_affiliation_string":"Department of Linguistics University of Potsdam Germany","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088112892","display_name":"Alexander Koller","orcid":"https://orcid.org/0000-0002-5317-6689"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Koller","raw_affiliation_strings":["Department of Linguistics University of Potsdam Germany"],"affiliations":[{"raw_affiliation_string":"Department of Linguistics University of Potsdam Germany","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034461489","display_name":"Mark Johnson","orcid":"https://orcid.org/0000-0003-4809-8441"},"institutions":[{"id":"https://openalex.org/I99043593","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89","country_code":"AU","type":"education","lineage":["https://openalex.org/I99043593"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mark Johnson","raw_affiliation_strings":["Department of Computing Macquarie University Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computing Macquarie University Australia","institution_ids":["https://openalex.org/I99043593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034461489"],"corresponding_institution_ids":["https://openalex.org/I99043593"],"apc_list":null,"apc_paid":null,"fwci":3.092,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.93085986,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2042","last_page":"2051"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10260","display_name":"Software Engineering Research","score":0.9929999709129333,"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"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9912999868392944,"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/computer-science","display_name":"Computer science","score":0.8514961004257202},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.8047888278961182},{"id":"https://openalex.org/keywords/bottom-up-parsing","display_name":"Bottom-up parsing","score":0.6878194212913513},{"id":"https://openalex.org/keywords/top-down-parsing-language","display_name":"Top-down parsing language","score":0.602292537689209},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.6002666354179382},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5945981740951538},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5742788910865784},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.5635400414466858},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5349558591842651},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5064889192581177},{"id":"https://openalex.org/keywords/parser-combinator","display_name":"Parser combinator","score":0.5061809420585632},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.49645930528640747},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.47619855403900146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4689561724662781},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.44660574197769165},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.43275225162506104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4215922951698303},{"id":"https://openalex.org/keywords/memoization","display_name":"Memoization","score":0.4119637906551361},{"id":"https://openalex.org/keywords/lr-parser","display_name":"LR parser","score":0.410093754529953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08258730173110962}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8514961004257202},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.8047888278961182},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.6878194212913513},{"id":"https://openalex.org/C166651950","wikidata":"https://www.wikidata.org/wiki/Q7824365","display_name":"Top-down parsing language","level":5,"score":0.602292537689209},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.6002666354179382},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5945981740951538},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5742788910865784},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5635400414466858},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5349558591842651},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5064889192581177},{"id":"https://openalex.org/C118364021","wikidata":"https://www.wikidata.org/wiki/Q7139956","display_name":"Parser combinator","level":3,"score":0.5061809420585632},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.49645930528640747},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.47619855403900146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4689561724662781},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.44660574197769165},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.43275225162506104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4215922951698303},{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.4119637906551361},{"id":"https://openalex.org/C35164859","wikidata":"https://www.wikidata.org/wiki/Q1756442","display_name":"LR parser","level":4,"score":0.410093754529953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08258730173110962},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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":1,"locations":[{"id":"doi:10.18653/v1/p16-1192","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/p16-1192","pdf_url":"https://www.aclweb.org/anthology/P16-1192.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.18653/v1/p16-1192","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/p16-1192","pdf_url":"https://www.aclweb.org/anthology/P16-1192.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G2270684572","display_name":null,"funder_award_id":"2916/2-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5398132153","display_name":null,"funder_award_id":"DFG grant","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2517139211.pdf","grobid_xml":"https://content.openalex.org/works/W2517139211.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W342816535","https://openalex.org/W1479758177","https://openalex.org/W1547619015","https://openalex.org/W1551202288","https://openalex.org/W1567277581","https://openalex.org/W1593799327","https://openalex.org/W1709189958","https://openalex.org/W1969245183","https://openalex.org/W2004967523","https://openalex.org/W2102258316","https://openalex.org/W2133956246","https://openalex.org/W2148109221","https://openalex.org/W2152096446","https://openalex.org/W2166210475","https://openalex.org/W2185441650","https://openalex.org/W2250390514","https://openalex.org/W2250748818","https://openalex.org/W2251240975","https://openalex.org/W2252123671","https://openalex.org/W2437005631","https://openalex.org/W3037557769","https://openalex.org/W4244608386"],"related_works":["https://openalex.org/W2164260211","https://openalex.org/W3099802765","https://openalex.org/W2246820938","https://openalex.org/W4283315215","https://openalex.org/W4237774781","https://openalex.org/W2098396599","https://openalex.org/W4231702121","https://openalex.org/W1929722976","https://openalex.org/W4320024782","https://openalex.org/W1908013816"],"abstract_inverted_index":{"Parsing":[0],"for":[1],"a":[2],"wide":[3],"variety":[4],"of":[5,19],"grammar":[6],"formalisms":[7],"can":[8],"be":[9],"performed":[10],"by":[11,21],"intersecting":[12],"finite":[13],"tree":[14],"automata.":[15],"However,":[16],"naive":[17],"implementations":[18],"parsing":[20],"intersection":[22],"are":[23],"very":[24],"inefficient.":[25],"We":[26],"present":[27],"techniques":[28],"that":[29,37],"speed":[30],"up":[31],"tree-automata-based":[32],"parsing,":[33,55],"to":[34,47],"the":[35,58,62],"point":[36],"it":[38],"becomes":[39],"practically":[40],"feasible":[41],"on":[42],"realistic":[43],"data":[44],"when":[45],"applied":[46],"context-free,":[48],"TAG,":[49],"and":[50],"graph":[51,54],"parsing.":[52],"For":[53],"we":[56],"obtain":[57],"best":[59],"runtimes":[60],"in":[61],"literature.":[63]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}