{"id":"https://openalex.org/W2022378968","doi":"https://doi.org/10.1142/s0129054105003169","title":"APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES","display_name":"APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2022378968","doi":"https://doi.org/10.1142/s0129054105003169","mag":"2022378968"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003169","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003169","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5054819772","display_name":"Anssi Yli-Jyr\u00e4","orcid":"https://orcid.org/0000-0003-0731-2114"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"ANSSI YLI-JYR\u00c4","raw_affiliation_strings":["Department of General Linguistics, University of Helsinki, P.O. Box 9, FIN-00014 University of Helsinki, Finland"],"affiliations":[{"raw_affiliation_string":"Department of General Linguistics, University of Helsinki, P.O. Box 9, FIN-00014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054819772"],"corresponding_institution_ids":["https://openalex.org/I133731052"],"apc_list":null,"apc_paid":null,"fwci":1.3163,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83926148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"03","first_page":"565","last_page":"579"},"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/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"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/regular-tree-grammar","display_name":"Regular tree grammar","score":0.7004179358482361},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.6210786700248718},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5895340442657471},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.5355187654495239},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5284726023674011},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5238956212997437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195265412330627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48904308676719666},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.48686662316322327},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.4722394645214081},{"id":"https://openalex.org/keywords/alternation","display_name":"Alternation (linguistics)","score":0.450616717338562},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.43245378136634827},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4197562038898468},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40871667861938477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3466110825538635},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.34520766139030457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2093167006969452},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.18468952178955078},{"id":"https://openalex.org/keywords/phrase-structure-rules","display_name":"Phrase structure rules","score":0.1441076695919037},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.11102011799812317},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.0954681932926178}],"concepts":[{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.7004179358482361},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.6210786700248718},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5895340442657471},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.5355187654495239},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5284726023674011},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5238956212997437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195265412330627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48904308676719666},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.48686662316322327},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4722394645214081},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.450616717338562},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.43245378136634827},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4197562038898468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40871667861938477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3466110825538635},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.34520766139030457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2093167006969452},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.18468952178955078},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.1441076695919037},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.11102011799812317},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.0954681932926178},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003169","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003169","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W24718583","https://openalex.org/W1561758320","https://openalex.org/W1890888469","https://openalex.org/W2028908189","https://openalex.org/W2068602529","https://openalex.org/W2076542142","https://openalex.org/W2089505529","https://openalex.org/W2142708806","https://openalex.org/W2185494286","https://openalex.org/W2276792833","https://openalex.org/W4236835455","https://openalex.org/W4252090733","https://openalex.org/W6605838982"],"related_works":["https://openalex.org/W2153803459","https://openalex.org/W1608157979","https://openalex.org/W2067980891","https://openalex.org/W2403874525","https://openalex.org/W2572467330","https://openalex.org/W2132669525","https://openalex.org/W2734718483","https://openalex.org/W4297836258","https://openalex.org/W2336577598","https://openalex.org/W2056703833"],"abstract_inverted_index":{"The":[0],"paper":[1],"formulates":[2],"the":[3,68,93,102,112],"Hays":[4],"and":[5,22,121],"Gaifman":[6],"dependency":[7,20,37,96,119],"grammar":[8,97],"(HGDG)":[9],"in":[10,41],"terms":[11],"of":[12,19,36,46,52,57,104,127,135],"constraints":[13],"on":[14],"a":[15,28,42],"string":[16],"based":[17],"encoding":[18,35,113],"trees":[21,38,120],"develops":[23],"an":[24],"approach":[25],"to":[26,61,117],"obtain":[27],"regular":[29,75,90],"approximation":[30,91],"for":[31,82,92],"these":[32],"grammars.":[33],"Our":[34],"uses":[39],"brackets":[40,47],"novel":[43],"fashion:":[44],"pairs":[45,51],"indicate":[48],"dependencies":[49],"between":[50],"positions":[53],"rather":[54],"than":[55],"boundaries":[56],"phrases.":[58],"This":[59],"leads":[60],"several":[62],"advantages:":[63],"(i)":[64],"HGDG":[65],"rules":[66],"over":[67],"balanced":[69],"bracketing":[70],"can":[71,114,129],"be":[72,115,131],"expressed":[73],"using":[74],"languages.":[76],"(ii)":[77],"A":[78,88],"new":[79],"homomorphic":[80],"representation":[81],"context-free":[83],"languages":[84],"is":[85,98],"obtained.":[86],"(iii)":[87],"star-free":[89],"original":[94],"projective":[95],"obtained":[99],"by":[100],"limiting":[101],"number":[103],"stacked":[105],"dependencies.":[106],"(iv)":[107],"By":[108],"relaxing":[109],"certain":[110],"constraints,":[111],"extended":[116],"non-projective":[118],"graphs,":[122],"(v)":[123],"strong":[124],"generative":[125],"power":[126],"HGDGs":[128],"now":[130],"characterized":[132],"through":[133],"sets":[134],"bracketed":[136],"strings.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}