Page: 1 2 3 4 5 6 7 8 9 10... 1.020
101 |
How Well Do LSTM Language Models Learn Filler-gap Dependencies?
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
102 |
A split-gesture, competitive, coupled oscillator model of syllable structure predicts the emergence of edge gemination and degemination
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
103 |
Linguistic Complexity and Planning Effects on Word Duration in Hindi Read Aloud Speech
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
104 |
Learning Argument Structures with Recurrent Neural Network Grammars
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
105 |
MaxEnt Learners are Biased Against Giving Probability to Harmonically Bounded Candidates
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
106 |
Evaluating Structural Economy Claims in Relative Clause Attachment
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
107 |
A Model Theoretic Perspective on Phonological Feature Systems
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
108 |
Representing Multiple Dependencies in Prosodic Structures
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
109 |
Incremental Acquisition of a Minimalist Grammar using an SMT-Solver
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
110 |
Concurrent hidden structure & grammar learning
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
111 |
Can language models capture syntactic associations without surface cues? A case study of reflexive anaphor licensing in English control constructions
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
112 |
Universal Dependencies and Semantics for English and Hebrew Child-directed Speech
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
113 |
Learning Input Strictly Local Functions: Comparing Approaches with Catalan Adjectives
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
114 |
Learning Constraints on Wh-Dependencies by Learning How to Efficiently Represent Wh-Dependencies: A Developmental Modeling Investigation With Fragment Grammars
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
115 |
Typological Implications of Tier-Based Strictly Local Movement
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
116 |
Parsing Early Modern English for Linguistic Search
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
Abstract:
This work addresses the question of whether the output of a state-of-the-art parser is accurate enough to support research in theoretical linguistics. In order to build reliable models of syntactic change, we aim to eventually parse the 1.5-billion-word Early English Books Online (EEBO) corpus. But since EEBO is not yet parsed, we begin by constructing and testing a parser on the 1.7-million-word Penn-Helsinki Parsed Corpus of Early Modern English (PPCEME). In order to obtain robust results, we define an 8-fold split on PPCEME. We then evaluate the parser with evalb and, more relevantly for us, with a task-specific metric - namely, its accuracy in parsing 6 sentence types necessary to track the rise of auxiliary do (as in They did not come vs. its historical precursor They came not). Retrieving the relevant sentences from the gold and test versions with CorpusSearch queries, we find that the parser's accuracy promises to be sufficient for our purposes. A remaining concern is the variability of the output, which we plan to address with three pieces of future work sketched in the conclusion.
|
|
Keyword:
Computational Linguistics; historical linguistics; parsing; syntax
|
|
URL: https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1246&context=scil https://scholarworks.umass.edu/scil/vol5/iss1/13
|
|
BASE
|
|
Hide details
|
|
117 |
When Classifying Arguments, BERT Doesn't Care About Word Order. Except When It Matters
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
118 |
Remodelling complement coercion interpretation
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
119 |
Inferring Inferences: Relational Propositions for Argument Mining
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
120 |
ANLIzing the Adversarial Natural Language Inference Dataset
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2022)
|
|
BASE
|
|
Show details
|
|
Page: 1 2 3 4 5 6 7 8 9 10... 1.020
|
|