{"id":"https://openalex.org/W7225329441","doi":"https://doi.org/10.21203/rs.3.rs-11613500/v1","title":"Disambiguating Context-Free Grammars by Selecting the Minimum-Cost Parse Tree","display_name":"Disambiguating Context-Free Grammars by Selecting the Minimum-Cost Parse Tree","publication_year":2026,"publication_date":"2026-11-05","ids":{"openalex":"https://openalex.org/W7225329441","doi":"https://doi.org/10.21203/rs.3.rs-11613500/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11613500/v1","doi":"https://doi.org/10.21203/rs.3.rs-11613500/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11613500/v1","pdf_url":"https://www.researchsquare.com/article/rs-11613500/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11613500/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5160854040","display_name":"Mina Hematikarimkhani","orcid":"https://orcid.org/0009-0003-6135-6457","observed_orcids":["https://orcid.org/0009-0003-6135-6457"]},"institutions":[{"id":"https://openalex.org/I110525433","display_name":"Islamic Azad University, Tehran","ror":"https://ror.org/01kzn7k21","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mina Hematikarimkhani","raw_affiliation_strings":["Islamic azad University"],"raw_orcid":"https://orcid.org/0009-0003-6135-6457","affiliations":[{"raw_affiliation_string":"Islamic azad University","institution_ids":["https://openalex.org/I110525433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5160854040"],"corresponding_institution_ids":["https://openalex.org/I110525433"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.9794999957084656,"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.9794999957084656,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.006800000090152025,"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/T10126","display_name":"Logic, programming, and type systems","score":0.006200000178068876,"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/context-free-grammars","display_name":"context-free grammars","score":0.9480000138282776},{"id":"https://openalex.org/keywords/ambiguous-grammars","display_name":"ambiguous grammars","score":0.8119999766349792},{"id":"https://openalex.org/keywords/tie-breaking","display_name":"tie-breaking","score":0.42800000309944153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7576000094413757},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.7286999821662903},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6764000058174133},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6446999907493591},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6284000277519226},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.6169000267982483},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6140000224113464},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5877000093460083},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5138000249862671},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5113999843597412},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4997999966144562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.49160000681877136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48910000920295715},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4108999967575073},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C164041254","wikidata":"https://www.wikidata.org/wiki/Q597455","display_name":"Attribute grammar","level":3,"score":0.35100001096725464},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.34540000557899475},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.335099995136261},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.32839998602867126},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.29739999771118164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.28380000591278076},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26930001378059387},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.26350000500679016},{"id":"https://openalex.org/C9432014","wikidata":"https://www.wikidata.org/wiki/Q954063","display_name":"Terminal and nonterminal symbols","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C58646249","wikidata":"https://www.wikidata.org/wiki/Q127380","display_name":"Abstract syntax tree","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11613500/v1","doi":"https://doi.org/10.21203/rs.3.rs-11613500/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11613500/v1","pdf_url":"https://www.researchsquare.com/article/rs-11613500/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11613500/v1","doi":"https://doi.org/10.21203/rs.3.rs-11613500/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11613500/v1","pdf_url":"https://www.researchsquare.com/article/rs-11613500/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225329441.pdf","grobid_xml":"https://content.openalex.org/works/W7225329441.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2144910575","https://openalex.org/W2166677757","https://openalex.org/W2795073756","https://openalex.org/W7101121742","https://openalex.org/W1959656604","https://openalex.org/W1971863293","https://openalex.org/W7096344319","https://openalex.org/W2988158430","https://openalex.org/W7097102982","https://openalex.org/W2031404918"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"grammar":[2,40,219,272],"that":[3,95,154,241],"is":[4,70,100,126,236,260,273],"ambiguous":[5,274],"gives":[6],"some":[7],"strings":[8],"more":[9],"than":[10],"one":[11,102,200],"parse":[12,68],"tree,":[13,121,159],"but":[14],"a":[15,23,57,72,89,120,133,145,173,250,271],"compiler":[16],"or":[17],"interpreter":[18],"has":[19,42,254],"to":[20,43],"work":[21,36],"with":[22,144,165,193,244],"single":[24],"one.":[25],"The":[26,97,184,234,257],"usual":[27],"remedies":[28],"each":[29,169],"depend":[30,130],"on":[31,132,217],"something":[32],"specific:":[33],"precedence":[34],"declarations":[35],"inside":[37],"LR":[38,229],"generators,":[39],"rewriting":[41],"be":[44,142],"done":[45],"by":[46],"hand,":[47],"and":[48,60,88,109,122,135,195,197,220,247,268],"tree":[49,69,99,201,259],"filters":[50],"act":[51],"only":[52,131,216,261],"after":[53],"parsing.":[54],"We":[55,223],"take":[56],"different":[58],"route":[59],"treat":[61],"disambiguation":[62,81],"as":[63,161,262,264],"an":[64,166],"optimisation":[65],"problem.":[66],"Each":[67],"given":[71],"cost,":[73],"made":[74],"up":[75],"of":[76,79,85,176,204],"the":[77,83,101,116,123,139,158,162,205,218,221,265],"number":[78,84],"violated":[80],"patterns,":[82],"non-terminal":[86],"nodes,":[87],"canonical":[90],"tie-breaking":[91],"key,":[92],"compared":[93],"in":[94,115,210,231],"order.":[96],"cheapest":[98],"we":[103],"keep.":[104],"Since":[105],"violations":[106],"are":[107],"penalised":[108],"never":[110],"forbidden":[111],"outright,":[112],"every":[113],"string":[114,203],"language":[117,124],"still":[118,248],"receives":[119],"itself":[125],"untouched.":[127],"When":[128],"penalties":[129],"node":[134],"its":[136,178],"immediate":[137],"surroundings,":[138],"optimum":[140],"can":[141],"found":[143],"CYK-style":[146],"dynamic":[147],"program":[148],"over":[149],"input":[150],"spans.":[151],"For":[152],"patterns":[153,266],"look":[155],"further":[156],"down":[157],"such":[160],"dangling":[163],"else":[164],"optional":[167],"else-branch,":[168],"subtree":[170],"also":[171],"reports":[172],"small":[174],"profile":[175],"whatever":[177],"parent":[179],"may":[180],"ask":[181],"about":[182],"it.":[183],"method":[185,235],"works":[186],"for":[187,238],"any":[188],"context-free":[189],"grammar,":[190],"including":[191],"grammars":[192,246],"\u03b5-rules":[194],"cycles,":[196],"returns":[198],"exactly":[199],"per":[202],"language.":[206],"Our":[207],"implementation":[208],"runs":[209],"O(n\u2074\u00b7C)":[211],"time,":[212],"where":[213],"C":[214],"depends":[215],"patterns.":[222],"do":[224],"not":[225],"suggest":[226],"replacing":[227],"linear-time":[228],"parsing":[230],"production":[232],"compilers.":[233],"meant":[237],"general-purpose":[239],"tools":[240],"must":[242],"cope":[243],"arbitrary":[245],"give":[249],"reproducible":[251],"answer.":[252],"It":[253],"clear":[255],"limits.":[256],"chosen":[258],"meaningful":[263],"supplied,":[267],"deciding":[269],"whether":[270],"remains":[275],"undecidable.":[276]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-06T00:00:00"}