{"id":"https://openalex.org/W2063432095","doi":"https://doi.org/10.3115/1073083.1073104","title":"Parsing non-recursive context-free grammars","display_name":"Parsing non-recursive context-free grammars","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2063432095","doi":"https://doi.org/10.3115/1073083.1073104","mag":"2063432095"},"language":"en","primary_location":{"id":"doi:10.3115/1073083.1073104","is_oa":true,"landing_page_url":"https://doi.org/10.3115/1073083.1073104","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=1073104&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=1073104&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088112856","display_name":"Mark-Jan Nederhof","orcid":"https://orcid.org/0000-0002-1845-6829"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark-Jan Nederhof","raw_affiliation_strings":["Faculty of Arts University of Groningen P.O. Box 716 NL-9700 AS Groningen, The Netherlands","University of Groningen (The Netherlands )"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Arts University of Groningen P.O. Box 716 NL-9700 AS Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]},{"raw_affiliation_string":"University of Groningen (The Netherlands )","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068504877","display_name":"Giorgio Satta","orcid":"https://orcid.org/0000-0001-7742-6438"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giorgio Satta","raw_affiliation_strings":["Dip. di Elettronica e Informatica Universit di Padova via Gradenigo, 6/A I-35131 Padova, Italy","Universit\u00e0\u2019 di Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Elettronica e Informatica Universit di Padova via Gradenigo, 6/A I-35131 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]},{"raw_affiliation_string":"Universit\u00e0\u2019 di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"112","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9995999932289124,"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.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.834751307964325},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.8110182285308838},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.8086202144622803},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.725272536277771},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7141754627227783},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6951909065246582},{"id":"https://openalex.org/keywords/extended-affix-grammar","display_name":"Extended Affix Grammar","score":0.6583881378173828},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.6117380857467651},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5936904549598694},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5904990434646606},{"id":"https://openalex.org/keywords/stochastic-context-free-grammar","display_name":"Stochastic context-free grammar","score":0.54133141040802},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.5379920601844788},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5177611708641052},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.5098444819450378},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.49448657035827637},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.4680459499359131},{"id":"https://openalex.org/keywords/synchronous-context-free-grammar","display_name":"Synchronous context-free grammar","score":0.46526315808296204},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45379674434661865},{"id":"https://openalex.org/keywords/machine-translation","display_name":"Machine translation","score":0.44568127393722534},{"id":"https://openalex.org/keywords/top-down-parsing-language","display_name":"Top-down parsing language","score":0.4423297047615051},{"id":"https://openalex.org/keywords/bottom-up-parsing","display_name":"Bottom-up parsing","score":0.3313210606575012},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.2720736563205719},{"id":"https://openalex.org/keywords/example-based-machine-translation","display_name":"Example-based machine translation","score":0.16678765416145325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.834751307964325},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.8110182285308838},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.8086202144622803},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.725272536277771},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7141754627227783},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6951909065246582},{"id":"https://openalex.org/C37734731","wikidata":"https://www.wikidata.org/wiki/Q5421802","display_name":"Extended Affix Grammar","level":4,"score":0.6583881378173828},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.6117380857467651},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5936904549598694},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5904990434646606},{"id":"https://openalex.org/C199624470","wikidata":"https://www.wikidata.org/wiki/Q2377216","display_name":"Stochastic context-free grammar","level":5,"score":0.54133141040802},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.5379920601844788},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5177611708641052},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.5098444819450378},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.49448657035827637},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.4680459499359131},{"id":"https://openalex.org/C51802942","wikidata":"https://www.wikidata.org/wiki/Q7662211","display_name":"Synchronous context-free grammar","level":4,"score":0.46526315808296204},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45379674434661865},{"id":"https://openalex.org/C203005215","wikidata":"https://www.wikidata.org/wiki/Q79798","display_name":"Machine translation","level":2,"score":0.44568127393722534},{"id":"https://openalex.org/C166651950","wikidata":"https://www.wikidata.org/wiki/Q7824365","display_name":"Top-down parsing language","level":5,"score":0.4423297047615051},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.3313210606575012},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.2720736563205719},{"id":"https://openalex.org/C24687705","wikidata":"https://www.wikidata.org/wiki/Q3753284","display_name":"Example-based machine translation","level":3,"score":0.16678765416145325},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3115/1073083.1073104","is_oa":true,"landing_page_url":"https://doi.org/10.3115/1073083.1073104","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=1073104&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.rug.nl:publications/a20ba366-ad4c-4c22-bf68-bc902b174446","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/a20ba366-ad4c-4c22-bf68-bc902b174446","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nederhof, MJ & Satta, G 2002, Parsing non-recursive context-free grammars. in 40TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE. Association for Computational Linguistics (ACL), SOMERSET, pp. 112-119, 40th Annual Meeting of the Association-for-Computational-Linguistics, Panama, 07/07/2002.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.7936","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://acl.ldc.upenn.edu/P/P02/P02-1015.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.8331","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.8331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.st-and.ac.uk/~mjn/publications/2002a.pdf","raw_type":"text"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/a20ba366-ad4c-4c22-bf68-bc902b174446","is_oa":false,"landing_page_url":"https://hdl.handle.net/11370/a20ba366-ad4c-4c22-bf68-bc902b174446","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederhof, MJ & Satta, G 2002, Parsing non-recursive context-free grammars. in 40TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE. Association for Computational Linguistics (ACL), SOMERSET, pp. 112-119, 40th Annual Meeting of the Association-for-Computational-Linguistics, Panama, 07/07/2002.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:www.research.unipd.it:11577/1370734","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/1370734","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.3115/1073083.1073104","is_oa":true,"landing_page_url":"https://doi.org/10.3115/1073083.1073104","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=1073104&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.75,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2063432095.pdf","grobid_xml":"https://content.openalex.org/works/W2063432095.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1535681052","https://openalex.org/W1658658360","https://openalex.org/W2122472280","https://openalex.org/W2134495021","https://openalex.org/W2139843807","https://openalex.org/W2152096446","https://openalex.org/W2188913344","https://openalex.org/W4376522561"],"related_works":["https://openalex.org/W2008892266","https://openalex.org/W2130532868","https://openalex.org/W2153311242","https://openalex.org/W1971863293","https://openalex.org/W2153803459","https://openalex.org/W2063432095","https://openalex.org/W1963896666","https://openalex.org/W1482538754","https://openalex.org/W2012632856","https://openalex.org/W1597349423"],"abstract_inverted_index":{"We":[0,37],"consider":[1],"the":[2,58],"problem":[3,21,62],"of":[4,26,44],"parsing":[5,43],"non-recursive":[6,45],"context-free":[7,10,46],"grammars,":[8,47],"i.e.,":[9],"grammars":[11],"that":[12,50,60],"generate":[13],"finite":[14],"languages.":[15],"In":[16],"natural":[17,29],"language":[18,30],"processing,":[19],"this":[20,61],"arises":[22],"in":[23,54],"several":[24],"areas":[25],"application,":[27],"including":[28],"generation,":[31],"speech":[32],"recognition":[33],"and":[34,48],"machine":[35],"translation.":[36],"present":[38],"two":[39],"tabular":[40],"algorithms":[41],"for":[42],"show":[49],"they":[51],"perform":[52],"well":[53],"practical":[55],"settings,":[56],"despite":[57],"fact":[59],"is":[63],"PSPACEcomplete.":[64]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}