{"id":"https://openalex.org/W2156210085","doi":"https://doi.org/10.1093/logcom/exs064","title":"Using synchronous tree adjoining grammar to model the typology of bound variable pronouns","display_name":"Using synchronous tree adjoining grammar to model the typology of bound variable pronouns","publication_year":2013,"publication_date":"2013-01-08","ids":{"openalex":"https://openalex.org/W2156210085","doi":"https://doi.org/10.1093/logcom/exs064","mag":"2156210085"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exs064","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs064","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5018746084","display_name":"Dennis Ryan Storoshenko","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. R. Storoshenko","raw_affiliation_strings":["Department of Linguistics, Yale University, 370 Temple St, Room 204, New Haven, CT 06520-8366, USA"],"affiliations":[{"raw_affiliation_string":"Department of Linguistics, Yale University, 370 Temple St, Room 204, New Haven, CT 06520-8366, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031824708","display_name":"Chao Han","orcid":"https://orcid.org/0000-0002-6712-0555"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"C.-H. Han","raw_affiliation_strings":["Department of Linguistics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia V5A1S6, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Linguistics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia V5A1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018746084"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.11784573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"2","first_page":"371","last_page":"403"},"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/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12090","display_name":"Language and cultural evolution","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/3316","display_name":"Cultural Studies"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6552153825759888},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5463517308235168},{"id":"https://openalex.org/keywords/anaphora","display_name":"Anaphora (linguistics)","score":0.5427356958389282},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.524467945098877},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.4816538393497467},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.4614281952381134},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4577866792678833},{"id":"https://openalex.org/keywords/object-pronoun","display_name":"Object pronoun","score":0.4365732669830322},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4317212998867035},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.4286009669303894},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.42667078971862793},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40790748596191406},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.36005979776382446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3330315351486206},{"id":"https://openalex.org/keywords/pronoun","display_name":"Pronoun","score":0.3178771138191223},{"id":"https://openalex.org/keywords/emergent-grammar","display_name":"Emergent grammar","score":0.216461181640625},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.15785524249076843},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.11590871214866638},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09612932801246643},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.09513849020004272}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6552153825759888},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5463517308235168},{"id":"https://openalex.org/C2781449363","wikidata":"https://www.wikidata.org/wiki/Q156751","display_name":"Anaphora (linguistics)","level":3,"score":0.5427356958389282},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.524467945098877},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.4816538393497467},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.4614281952381134},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4577866792678833},{"id":"https://openalex.org/C99361443","wikidata":"https://www.wikidata.org/wiki/Q7075064","display_name":"Object pronoun","level":3,"score":0.4365732669830322},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4317212998867035},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.4286009669303894},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.42667078971862793},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40790748596191406},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.36005979776382446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3330315351486206},{"id":"https://openalex.org/C2778551981","wikidata":"https://www.wikidata.org/wiki/Q36224","display_name":"Pronoun","level":2,"score":0.3178771138191223},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.216461181640625},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.15785524249076843},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.11590871214866638},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09612932801246643},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.09513849020004272},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exs064","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs064","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6800000071525574,"display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308380","display_name":"Yale University","ror":"https://ror.org/03v76x132"},{"id":"https://openalex.org/F4320310160","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334617","display_name":"Social Sciences and Humanities Research Council of Canada","ror":"https://ror.org/04j5jqy92"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W52379604","https://openalex.org/W92986787","https://openalex.org/W362576948","https://openalex.org/W1479758177","https://openalex.org/W1489734685","https://openalex.org/W1551467849","https://openalex.org/W1575161691","https://openalex.org/W1584587517","https://openalex.org/W1593821722","https://openalex.org/W1596795082","https://openalex.org/W1602570470","https://openalex.org/W1711163617","https://openalex.org/W1994423526","https://openalex.org/W1996672843","https://openalex.org/W2007260766","https://openalex.org/W2026347841","https://openalex.org/W2048953720","https://openalex.org/W2051403041","https://openalex.org/W2069820269","https://openalex.org/W2087099129","https://openalex.org/W2096894677","https://openalex.org/W2130035786","https://openalex.org/W2130630493","https://openalex.org/W2140453300","https://openalex.org/W2149406861","https://openalex.org/W2152055978","https://openalex.org/W2155149900","https://openalex.org/W2167110167","https://openalex.org/W2279170554","https://openalex.org/W2606362122","https://openalex.org/W2616709338","https://openalex.org/W2757109549","https://openalex.org/W2759212132","https://openalex.org/W2798434063","https://openalex.org/W4236828747","https://openalex.org/W4252449565"],"related_works":["https://openalex.org/W2134638545","https://openalex.org/W3107053153","https://openalex.org/W4236201954","https://openalex.org/W2519450945","https://openalex.org/W2271555924","https://openalex.org/W4235174191","https://openalex.org/W2016517491","https://openalex.org/W2517998038","https://openalex.org/W2197887420","https://openalex.org/W2156210085"],"abstract_inverted_index":{"This":[0,126],"article":[1],"presents":[2],"a":[3,16,19,27,32,39,57,69,85,137,146],"novel":[4],"analysis":[5],"of":[6,18,154,169],"bound":[7,33,70,92,108,155,173],"variable":[8,34,71,93,109,134,156,174],"anaphora":[9,94],"using":[10],"Synchronous":[11],"Tree":[12,20],"Adjoining":[13,21],"Grammar":[14,22],"(STAG),":[15],"pairing":[17],"(TAG)":[23],"for":[24,29,103,133,172],"syntax":[25,96,118],"and":[26,97,119],"TAG":[28],"semantics.":[30],"While":[31],"pronoun":[35],"can":[36,158],"occur":[37],"at":[38,136],"distance":[40],"from":[41,66],"its":[42,67],"binder,":[43],"as":[44,60,113],"in":[45,56,89,95,116,122],"\u2018Every":[46],"girli":[47],"believes":[48],"that":[49],"shei":[50],"is":[51],"intelligent\u2019,":[52],"languages":[53],"vary,":[54],"though":[55],"limited":[58],"way,":[59],"to":[61,84,129,144],"how":[62],"near":[63],"or":[64],"far":[65],"binder":[68],"should":[72],"be.":[73],"As":[74],"any":[75],"dependency":[76],"between":[77],"two":[78],"syntactic":[79],"objects":[80],"must":[81],"be":[82,159],"localized":[83],"single":[86,147],"predicate":[87],"domain":[88],"TAG,":[90],"modelling":[91],"semantics":[98],"poses":[99],"an":[100],"interesting":[101],"challenge":[102],"STAG.":[104],"In":[105],"our":[106],"analysis,":[107],"pronouns":[110,175],"are":[111],"represented":[112],"Multi-Component":[114],"sets":[115],"both":[117],"semantics,":[120],"composing":[121],"delayed":[123],"tree-local":[124],"derivations.":[125],"allows":[127,142],"us":[128,143],"not":[130],"only":[131],"account":[132],"binding":[135],"distance,":[138],"but":[139],"it":[140],"also":[141],"define":[145],"derivational":[148],"parameter":[149],"with":[150],"which":[151],"observed":[152],"patterns":[153],"locality":[157],"modelled,":[160],"ruling":[161],"out":[162],"unobserved":[163],"patterns,":[164],"while":[165],"capturing":[166],"the":[167],"range":[168],"interpretive":[170],"possibilities":[171],"across":[176],"languages.":[177]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
