TY - JOUR
T1 - On the computational modeling of English relative clauses
AU - Fong, Sandiway
AU - Ginsburg, Jason
N1 - Publisher Copyright:
© 2023 the author(s), published by De Gruyter.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Even in this era of parameter-heavy statistical modeling requiring large training datasets, we believe explicit symbolic models of grammar have much to offer, especially when it comes to modeling complex syntactic phenomena using a minimal number of parameters. It is the goal of explanatory symbolic models to make explicit a minimal set of features that license phrase structure, and thus, they should be of interest to engineers seeking parameter-efficient language models. Relative clauses have been much studied and have a long history in linguistics. We contribute a feature-driven account of the formation of a variety of basic English relative clauses in the Minimalist Program framework that is precisely defined, descriptively adequate, and computationally feasible in the sense that we have not observed an exponential scaling with the number of heads in the Lexical Array. Following previous work, we assume an analysis involving a uT feature and uRel feature, possibly simultaneously valued. In this article, we show a detailed mechanical implementation of this analysis and describe the structures computed for that, which, and who/whom relatives for standard English.
AB - Even in this era of parameter-heavy statistical modeling requiring large training datasets, we believe explicit symbolic models of grammar have much to offer, especially when it comes to modeling complex syntactic phenomena using a minimal number of parameters. It is the goal of explanatory symbolic models to make explicit a minimal set of features that license phrase structure, and thus, they should be of interest to engineers seeking parameter-efficient language models. Relative clauses have been much studied and have a long history in linguistics. We contribute a feature-driven account of the formation of a variety of basic English relative clauses in the Minimalist Program framework that is precisely defined, descriptively adequate, and computationally feasible in the sense that we have not observed an exponential scaling with the number of heads in the Lexical Array. Following previous work, we assume an analysis involving a uT feature and uRel feature, possibly simultaneously valued. In this article, we show a detailed mechanical implementation of this analysis and describe the structures computed for that, which, and who/whom relatives for standard English.
KW - English relative clauses
KW - Minimalist Program
KW - computational modeling
UR - http://www.scopus.com/inward/record.url?scp=85176911228&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85176911228&partnerID=8YFLogxK
U2 - 10.1515/opli-2022-0246
DO - 10.1515/opli-2022-0246
M3 - Article
AN - SCOPUS:85176911228
SN - 2300-9969
VL - 9
JO - Open Linguistics
JF - Open Linguistics
IS - 1
M1 - 20220246
ER -