Memory-bounded Neural Incremental Parsing for Psycholinguistic Prediction
Syntactic surprisal has been shown to have an effect on human sentence processing, and can be predicted from prefix probabilities of generative incremental parsers. Recent state-of-the-art incremental generative neural parsers are able to produce accurate parses and surprisal values but have unbounded stack memory, which may be used by the neural parser to maintain explicit in-order representations of all previously parsed words, inconsistent with results of human memory experiments. In contrast, humans seem to have a bounded working memory, demonstrated by inhibited performance on word recall in multi-clause sentences (Bransford and Franks, 1971), and on center-embedded sentences (Miller and Isard,1964). Bounded statistical parsers exist, but are less accurate than neural parsers in predict-ing reading times. This paper describes a neural incremental generative parser that is able to provide accurate surprisal estimates and can be constrained to use a bounded stack. Results show that the accuracy gains of neural parsers can be reliably extended to psycholinguistic modeling without risk of distortion due to un-bounded working memory.
Code (0)
등록된 구현이 없습니다.
Tasks
PredictionSentenceSimilar Papers 제목 키워드 기반
Modeling the effects of memory on human online sentence processing with particle filters
Language comprehension in humans is significantly constrained by memory, yet rapid, highly incremental, and capable of utilizing a wide range of contextual information to resolve ambiguity and form expectations about fut…
SentenceIncremental, Predictive Parsing with Psycholinguistically Motivated Tree-Adjoining Grammar
Incremental Tree Substitution Grammar for Parsing and Sentence Prediction
In this paper, we present the first incremental parser for Tree Substitution Grammar (TSG). A TSG allows arbitrarily large syntactic fragments to be combined into complete trees; we show how constraints (including lexica…
Language ModelingLanguage ModellingMachine TranslationPrediction+3On the Challenges of Fully Incremental Neural Dependency Parsing
Since the popularization of BiLSTMs and Transformer-based bidirectional encoders, state-of-the-art syntactic parsers have lacked incrementality, requiring access to the whole sentence and deviating from human language pr…
Dependency ParsingSentenceGerman and English Treebanks and Lexica for Tree-Adjoining Grammars
We present a treebank and lexicon for German and English, which have been developed for PLTAG parsing. PLTAG is a psycholinguistically motivated, incremental version of tree-adjoining grammar (TAG). The resources are how…
Language ModellingTAG