{"id":"https://openalex.org/W2553840416","doi":"https://doi.org/10.3233/fi-2016-1393","title":"Designing and Learning Substitutable Plane Graph Grammars","display_name":"Designing and Learning Substitutable Plane Graph Grammars","publication_year":2016,"publication_date":"2016-09-30","ids":{"openalex":"https://openalex.org/W2553840416","doi":"https://doi.org/10.3233/fi-2016-1393","mag":"2553840416"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1393","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1393","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01399415/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056300285","display_name":"R\u00e9mi Eyraud","orcid":"https://orcid.org/0000-0002-5728-4759"},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"R\u00e9mi Eyraud","raw_affiliation_strings":["Qarma Team, LIF Marseille, France. remi.eyraud@lif.univ-mrs.fr","LIF - Laboratoire d'informatique Fondamentale de Marseille (Parc Scientifique et Technologique de Luminy 163, avenue de Luminy F-13288 Marseille Cedex 9 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Qarma Team, LIF Marseille, France. remi.eyraud@lif.univ-mrs.fr","institution_ids":["https://openalex.org/I4210115196"]},{"raw_affiliation_string":"LIF - Laboratoire d'informatique Fondamentale de Marseille (Parc Scientifique et Technologique de Luminy 163, avenue de Luminy F-13288 Marseille Cedex 9 - France)","institution_ids":["https://openalex.org/I4210115196"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112890540","display_name":"Jean-Christophe Janodet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Christophe Janodet","raw_affiliation_strings":["IBISC lab, University of Evry, 23 Bd de France, F-91037 Evry, France. janodet@ibisc.univ-evry.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBISC lab, University of Evry, 23 Bd de France, F-91037 Evry, France. janodet@ibisc.univ-evry.fr","institution_ids":["https://openalex.org/I4210107733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114778025","display_name":"Tim Oates","orcid":"https://orcid.org/0000-0002-8655-747X"},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tim Oates","raw_affiliation_strings":["CoRaL lab, CSEE department, University of Maryland, Baltimore County, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CoRaL lab, CSEE department, University of Maryland, Baltimore County, USA","institution_ids":["https://openalex.org/I79272384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004142474","display_name":"Fr\u00e9d\u00e9ric Papadopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Papadopoulos","raw_affiliation_strings":["IBISC lab, University of Evry, 23 Bd de France, F-91037 Evry, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBISC lab, University of Evry, 23 Bd de France, F-91037 Evry, France","institution_ids":["https://openalex.org/I4210107733"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056300285"],"corresponding_institution_ids":["https://openalex.org/I4210115196"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08176711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"146","issue":"4","first_page":"403","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9975000023841858,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5811106562614441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5309433937072754},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4709929823875427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4295235574245453},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.42582976818084717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35107511281967163},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.32830333709716797},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.32059940695762634}],"concepts":[{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5811106562614441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5309433937072754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4709929823875427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4295235574245453},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.42582976818084717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35107511281967163},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.32830333709716797},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.32059940695762634}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2016-1393","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1393","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01399415v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01399415","pdf_url":"https://hal.science/hal-01399415/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae, 2016, Grammatical Inference, 146 (4), pp.403 - 430. ⟨10.3233/FI-2016-1393⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01399415v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01399415","pdf_url":"https://hal.science/hal-01399415/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae, 2016, Grammatical Inference, 146 (4), pp.403 - 430. ⟨10.3233/FI-2016-1393⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2553840416.pdf","grobid_xml":"https://content.openalex.org/works/W2553840416.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W127565347","https://openalex.org/W130248688","https://openalex.org/W141323664","https://openalex.org/W182124038","https://openalex.org/W204004087","https://openalex.org/W1487802415","https://openalex.org/W1490540810","https://openalex.org/W1567405414","https://openalex.org/W1577544661","https://openalex.org/W1602778142","https://openalex.org/W1701438870","https://openalex.org/W1969005071","https://openalex.org/W2011039300","https://openalex.org/W2043659127","https://openalex.org/W2063187654","https://openalex.org/W2071744657","https://openalex.org/W2081456352","https://openalex.org/W2088602194","https://openalex.org/W2092018982","https://openalex.org/W2098398499","https://openalex.org/W2115467367","https://openalex.org/W2118349699","https://openalex.org/W2147152274","https://openalex.org/W2151304358","https://openalex.org/W2166768733","https://openalex.org/W2202299834","https://openalex.org/W2314240464","https://openalex.org/W2501156850","https://openalex.org/W2585741244","https://openalex.org/W4254149069"],"related_works":["https://openalex.org/W1557335907","https://openalex.org/W59084530","https://openalex.org/W1969069928","https://openalex.org/W4286266684","https://openalex.org/W1770609059","https://openalex.org/W152266133","https://openalex.org/W1991706120","https://openalex.org/W1586408085","https://openalex.org/W281298494","https://openalex.org/W2100463420"],"abstract_inverted_index":{"Though":[0],"graph":[1,31,99,136,180],"grammars":[2,159],"have":[3],"been":[4,57],"widely":[5],"investigated":[6],"for":[7,14,72,150,193,202],"40":[8],"years,":[9],"few":[10],"learning":[11,168],"results":[12,156],"exist":[13],"them.":[15],"The":[16,35],"main":[17],"reasons":[18],"come":[19],"from":[20],"complexity":[21],"issues":[22],"that":[23,59,75,130,146,170],"are":[24,33,148],"inherent":[25],"when":[26],"graphs,":[27,45,74],"and":[28,62,92,196],"a":[29,135,138,167],"fortiori":[30],"grammars,":[32],"considered.":[34],"picture":[36],"is":[37,204],"however":[38],"different":[39],"if":[40],"one":[41,208],"considers":[42],"drawings":[43],"of":[44,79,134,177,199,213],"rat":[46],"her":[47],"than":[48],"the":[49,60,87,104,120,132,173,175,189,197,207,211],"graphs":[50],"themselves.":[51],"For":[52],"instance,":[53],"it":[54],"has":[55],"recently":[56],"proved":[58],"isomorphism":[61],"pattern":[63],"searching":[64],"problems":[65],"could":[66],"be":[67,161],"solved":[68],"in":[69,119,141,172,185,210],"polynomial":[70,142,186,194],"time":[71,106,187],"plane":[73,179],"is,":[76],"planar":[77,80],"embeddings":[78],"graphs.":[81],"In":[82,115],"this":[83],"paper,":[84],"we":[85,123,152],"introduce":[86],"Plane":[88],"Graph":[89],"Grammars":[90],"(PGG)":[91],"detail":[93],"how":[94,154],"they":[95,107],"differ":[96],"to":[97,163,206],"usual":[98],"grammar":[100],"formalism\u2019s":[101],"while":[102],"at":[103],"same":[105,190],"share":[108],"important":[109],"properties":[110],"with":[111,137],"string":[112,158],"context-free":[113],"grammars.":[114],"particular,":[116],"though":[117],"exponential":[118],"general":[121],"case,":[122],"provide":[124],"an":[125],"appropriate":[126],"restriction":[127,191],"on":[128,157],"languages":[129],"allows":[131],"parsing":[133],"given":[139],"PGG":[140,147,164],"time.":[143],"We":[144],"demonstrate":[145],"well-shaped":[149],"learning:":[151],"show":[153],"recent":[155],"can":[160],"extended":[162],"by":[165],"providing":[166],"algorithm":[169,183],"identifies":[171],"limit":[174],"class":[176],"substitutable":[178],"languages.":[181],"Our":[182],"runs":[184],"assuming":[188],"used":[192],"parsing,":[195],"amount":[198],"data":[200],"needed":[201],"convergence":[203],"comparable":[205],"required":[209],"case":[212],"strings.":[214]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-02T06:04:40.494371","created_date":"2025-10-10T00:00:00"}