Amanda Payne
Biographic Data
| ID | 3842579 |
|---|---|
| NAME | Amanda Payne |
| GIVEN NAMES | Amanda |
| FAMILY NAME | Payne |
| SIGNATURE | PAYNE A |
| AFFILIATIONS | Haverford College 370 Lancaster Avenue Haverford PA 19041 USA |
| VERIFIED | No |
| TOTAL WORKS | 5 |
| TOTAL CITATIONS | 7 |
| WORKS AS AUTHOR | 5 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2017 |
| LATEST PUBLICATION YEAR | 2020 |
| H-INDEX | 2 |
PP-Extraposition and the Order of Adverbials in English
In English, adverbials may intervene between the verb and a selected PP. We consider three analyses of this fact: the traditional account, that the PP shifts rightward across a right-adjoined adverbial ( Stowell 1981 ); an alternative account, that the verb moves leftward across a left-adjoined adverbial ( Pesetsky 1989 , Johnson 1991 ); and a hybrid account that assumes both extraposition and verb raising. We argue that the order of postverbal a…
On Matrix-Clause Intervention in Accusative-and-Infinitive Constructions
One of the strongest arguments for a raising-to-object analysis of English accusative-and-infinitive constructions comes from the fact that adverbials and particles belonging to the matrix clause can intervene between the embedded subject and the embedded predicate. We reevaluate this argument in the light of a neglected alternative analysis, namely that matrix-clause intervention is the result of extraposition of the embedded predicate. We show …
A formal analysis of Correspondence Theory
This paper provides a computational analysis of the complexity of GEN and Correspondence Theory in terms of the nature of the logic involved in their formulation. The first result of this analysis shows that the GEN function is not definable in Monadic Second Order (MSO) logic. Second, we show that the set of input-output Correspondence-theoretic candidates from a given underlying representation is definable in First Order (FO) logic, which is le…
All dissimilation is computationally subsequential
All dissimilation is computationally subsequential
This article presents a computational analysis of the 185 dissimilation patterns in the typological surveys by Suzuki (1998) and Bennett (2013), and shows that dissimilation is computationally less complex than has been previously shown. Dissimilation patterns are grouped into three general types (basic, blocking, and polarity), each of which can be modeled with a subsequential finite-state transducer. This lends support to the claim that phonolo…
On Matrix-Clause Intervention in Accusative-and-Infinitive Constructions
One of the strongest arguments for a raising-to-object analysis of English accusative-and-infinitive constructions comes from the fact that adverbials and particles belonging to the matrix clause can intervene between the embedded subject and the embedded predicate. We reevaluate this argument in the light of a neglected alternative analysis, namely that matrix-clause intervention is the result of extraposition of the embedded predicate. We show …
PP-Extraposition and the Order of Adverbials in English
In English, adverbials may intervene between the verb and a selected PP. We consider three analyses of this fact: the traditional account, that the PP shifts rightward across a right-adjoined adverbial ( Stowell 1981 ); an alternative account, that the verb moves leftward across a left-adjoined adverbial ( Pesetsky 1989 , Johnson 1991 ); and a hybrid account that assumes both extraposition and verb raising. We argue that the order of postverbal a…
All dissimilation is computationally subsequential
This article presents a computational analysis of the 185 dissimilation patterns in the typological surveys by Suzuki (1998) and Bennett (2013), and shows that dissimilation is computationally less complex than has been previously shown. Dissimilation patterns are grouped into three general types (basic, blocking, and polarity), each of which can be modeled with a subsequential finite-state transducer. This lends support to the claim that phonolo…
A formal analysis of Correspondence Theory
This paper provides a computational analysis of the complexity of GEN and Correspondence Theory in terms of the nature of the logic involved in their formulation. The first result of this analysis shows that the GEN function is not definable in Monadic Second Order (MSO) logic. Second, we show that the set of input-output Correspondence-theoretic candidates from a given underlying representation is definable in First Order (FO) logic, which is le…
All dissimilation is computationally subsequential
All dissimilation is computationally subsequential
This article presents a computational analysis of the 185 dissimilation patterns in the typological surveys by Suzuki (1998) and Bennett (2013), and shows that dissimilation is computationally less complex than has been previously shown. Dissimilation patterns are grouped into three general types (basic, blocking, and polarity), each of which can be modeled with a subsequential finite-state transducer. This lends support to the claim that phonolo…
PP-Extraposition and the Order of Adverbials in English
In English, adverbials may intervene between the verb and a selected PP. We consider three analyses of this fact: the traditional account, that the PP shifts rightward across a right-adjoined adverbial ( Stowell 1981 ); an alternative account, that the verb moves leftward across a left-adjoined adverbial ( Pesetsky 1989 , Johnson 1991 ); and a hybrid account that assumes both extraposition and verb raising. We argue that the order of postverbal a…
On Matrix-Clause Intervention in Accusative-and-Infinitive Constructions
One of the strongest arguments for a raising-to-object analysis of English accusative-and-infinitive constructions comes from the fact that adverbials and particles belonging to the matrix clause can intervene between the embedded subject and the embedded predicate. We reevaluate this argument in the light of a neglected alternative analysis, namely that matrix-clause intervention is the result of extraposition of the embedded predicate. We show …
Computer Science (4 works) · Linguistics (3 works) · Mathematics (3 works) · Natural Language Processing Techniques (3 works) · Philosophy (3 works) · Dissimilation (2 works) · Linguistic Variation and Morphology (2 works) · Programming language (2 works) · Syntax, Semantics, Linguistic Variation (2 works) · Verb (2 works)