{"id":"https://openalex.org/W201383726","doi":null,"title":"Expressivity and Complexity of the Grammatical Framework","display_name":"Expressivity and Complexity of the Grammatical Framework","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W201383726","mag":"201383726"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.1419","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.1419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ling.gu.se/~peb/pubs/Ljunglof-2004a.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5039177171","display_name":"Peter Ljungl\u00f6f","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Ljungl\u00f6f","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5039177171"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5244,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.91862745,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7559000253677368,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7559000253677368,"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/T10126","display_name":"Logic, programming, and type systems","score":0.10849999636411667,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.10249999910593033,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/grammatical-framework","display_name":"Grammatical Framework","score":1.0},{"id":"https://openalex.org/keywords/expressiveness","display_name":"expressiveness","score":0.5899999737739563},{"id":"https://openalex.org/keywords/parsing-complexity","display_name":"parsing complexity","score":0.9980000257492065},{"id":"https://openalex.org/keywords/polynomial-time-parsing","display_name":"polynomial-time parsing","score":0.652999997138977},{"id":"https://openalex.org/keywords/undecidability","display_name":"undecidability","score":0.8320000171661377},{"id":"https://openalex.org/keywords/higher-order-functions","display_name":"higher-order functions","score":0.9330000281333923},{"id":"https://openalex.org/keywords/dependent-types","display_name":"dependent types","score":0.9739999771118164}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.742058277130127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7245755791664124},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.6351538896560669},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5302916169166565},{"id":"https://openalex.org/C166651950","wikidata":"https://www.wikidata.org/wiki/Q7824365","display_name":"Top-down parsing language","level":5,"score":0.49005162715911865},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4850389361381531},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.48223671317100525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.47822970151901245},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4751807749271393},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.46828171610832214},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.459258496761322},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4581831991672516},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.45596522092819214},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.44514745473861694},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44244641065597534},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.43105319142341614},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4137556552886963},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.3988794684410095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39563119411468506},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.37308764457702637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.268676221370697},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.26671916246414185},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2173154652118683},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.1419","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.1419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ling.gu.se/~peb/pubs/Ljunglof-2004a.pdf","raw_type":"text"},{"id":"pmh:oai:gupea.ub.gu.se:2077/16377","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/2077/16377","pdf_url":null,"source":{"id":"https://openalex.org/S4306401168","display_name":"Gothenburg University Publications Electronic Archive (Gothenburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I881427289","host_organization_name":"University of Gothenburg","host_organization_lineage":["https://openalex.org/I881427289"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral thesis"},{"id":"pmh:oai:publications.lib.chalmers.se:10794","doi":null,"is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/10794-expressivity-and-complexity-of-the-grammatical-framework","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Thesis.Doctoral"},{"id":"pmh:oai:research.chalmers.se:10794","doi":null,"is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/10794","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:201383726","doi":null,"is_oa":false,"landing_page_url":"http://gupea.ub.gu.se/bitstream/2077/16377/3/gupea_2077_16377_3.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":85,"referenced_works":["https://openalex.org/W52246302","https://openalex.org/W92394816","https://openalex.org/W569543113","https://openalex.org/W635073927","https://openalex.org/W1479758177","https://openalex.org/W1480272510","https://openalex.org/W1481570261","https://openalex.org/W1487992270","https://openalex.org/W1491178396","https://openalex.org/W1507356070","https://openalex.org/W1511588645","https://openalex.org/W1514538741","https://openalex.org/W1526185611","https://openalex.org/W1546727036","https://openalex.org/W1560253649","https://openalex.org/W1564971179","https://openalex.org/W1565235297","https://openalex.org/W1570802506","https://openalex.org/W1577059114","https://openalex.org/W1577934069","https://openalex.org/W1589712742","https://openalex.org/W1590102271","https://openalex.org/W1597013636","https://openalex.org/W1599446167","https://openalex.org/W1627331591","https://openalex.org/W1687940340","https://openalex.org/W1968347265","https://openalex.org/W1971527621","https://openalex.org/W1972573551","https://openalex.org/W1974190112","https://openalex.org/W1979740015","https://openalex.org/W1981404622","https://openalex.org/W1981743645","https://openalex.org/W2002089154","https://openalex.org/W2007167366","https://openalex.org/W2013724579","https://openalex.org/W2025063099","https://openalex.org/W2036540855","https://openalex.org/W2038141781","https://openalex.org/W2038248725","https://openalex.org/W2040713190","https://openalex.org/W2047092246","https://openalex.org/W2047505657","https://openalex.org/W2059000558","https://openalex.org/W2064490449","https://openalex.org/W2066783840","https://openalex.org/W2076542142","https://openalex.org/W2084162167","https://openalex.org/W2089385274","https://openalex.org/W2089505529","https://openalex.org/W2100738443","https://openalex.org/W2107965301","https://openalex.org/W2108455276","https://openalex.org/W2111907245","https://openalex.org/W2115678002","https://openalex.org/W2120452513","https://openalex.org/W2121249923","https://openalex.org/W2121924470","https://openalex.org/W2122472280","https://openalex.org/W2124141583","https://openalex.org/W2124212956","https://openalex.org/W2125529971","https://openalex.org/W2125948010","https://openalex.org/W2130035786","https://openalex.org/W2130630493","https://openalex.org/W2131504185","https://openalex.org/W2134112335","https://openalex.org/W2142708806","https://openalex.org/W2146834222","https://openalex.org/W2150662408","https://openalex.org/W2152096446","https://openalex.org/W2152907450","https://openalex.org/W2154973422","https://openalex.org/W2156429182","https://openalex.org/W2157324495","https://openalex.org/W2164548001","https://openalex.org/W2169362686","https://openalex.org/W2170716495","https://openalex.org/W2185277039","https://openalex.org/W2318908254","https://openalex.org/W2328580899","https://openalex.org/W2442545619","https://openalex.org/W2610522837","https://openalex.org/W3037763987","https://openalex.org/W3087977598"],"related_works":["https://openalex.org/W7097263140","https://openalex.org/W2172296070","https://openalex.org/W7095419642","https://openalex.org/W48092690","https://openalex.org/W1541653499","https://openalex.org/W2023251624","https://openalex.org/W2766630400","https://openalex.org/W7098637493","https://openalex.org/W2273500171","https://openalex.org/W7051432405"],"abstract_inverted_index":{"This":[0,27],"thesis":[1],"investigates":[2],"the":[3,10,86,96,158],"expressive":[4,112],"power":[5,113,149],"and":[6,22,53,73,82,110,145,150,180],"parsing":[7,74,108,124,151,159,175],"complexity":[8,75,152],"of":[9,61,88,122,143],"Grammatical":[11],"Framework":[12],"(GF),":[13],"a":[14,46,65,120,172],"formalism":[15],"originally":[16],"designed":[17],"for":[18,48,126,135,161,174],"displaying":[19],"formal":[20],"propositions":[21],"proofs":[23],"in":[24,168],"natural":[25],"language.":[26],"is":[28,64,94,101,114,166],"done":[29],"by":[30,131],"relating":[31],"GF":[32,63,100,163],"with":[33,128],"two":[34],"more":[35],"well-known":[36],"grammar":[37,51],"formalisms;":[38,52],"Generalized":[39],"Context-Free":[40,56],"Grammar":[41,57],"(GCFG),":[42],"best":[43],"seen":[44],"as":[45],"framework":[47],"describing":[49],"various":[50],"Parallel":[54],"Multiple":[55],"(PMCFG),":[58],"an":[59],"instance":[60],"GCFG.Since":[62],"fairly":[66,115],"new":[67],"theory,":[68],"some":[69],"questions":[70,84],"about":[71],"expressivity":[72],"have":[76],"until":[77],"now":[78],"not":[79],"been":[80],"answered;":[81],"these":[83],"are":[85,153],"mainfocus":[87],"this":[89],"thesis.":[90],"The":[91],"main":[92],"result":[93],"that":[95],"important":[97],"subclass":[98],"context-free":[99,136],"equivalent":[102],"to":[103],"PMCFG,":[104],"which":[105,165],"has":[106],"polynomial":[107,129],"complexity,":[109,130],"whose":[111],"well":[116],"known.Furthermore,":[117],"we":[118,156],"give":[119],"number":[121],"tabular":[123],"algorithms":[125,134],"PMCFG":[127],"extending":[132],"existing":[133],"grammars.":[137],"We":[138],"suggest":[139],"three":[140],"possible":[141],"extensions":[142],"GF/PMCFG,":[144],"discuss":[146,157],"how":[147],"theexpressive":[148],"influenced.":[154],"Finally,":[155],"problem":[160],"unrestricted":[162],"grammars,":[164],"undecidable":[167],"general.We":[169],"nevertheless":[170],"describe":[171],"procedure":[173],"grammars":[176],"containing":[177],"higher-order":[178],"functions":[179],"dependent":[181],"types.":[182]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}