Surprisal-based comparison between a symbolic and a connectionist model of sentence processing

نویسنده

  • Stefan L. Frank
چکیده

The ‘unlexicalized surprisal’ of a word in sentence context is defined as the negative logarithm of the probability of the word’s part-of-speech given the sequence of previous partsof-speech of the sentence. Unlexicalized surprisal is known to correlate with word reading time. Here, it is shown that this correlation grows stronger when surprisal values are estimated by a more accurate language model, indicating that readers make use of an objectively accurate probabilistic language model. Also, surprisals as estimated by a Simple Recurrent Network (SRN) were found to correlate more strongly with reading-time data than surprisals estimated by a Probabilistic Context-Free Grammar (PCFG). This suggests that the SRN forms a more accurate psycholinguistic model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic encoding of structural uncertainty in gradient symbols

An important achievement in modeling online language comprehension is the discovery of the relationship between processing difficulty and surprisal (Hale, 2001; Levy, 2008). However, it is not clear how structural uncertainty can be represented and updated in a continuoustime continuous-state dynamical system model, a reasonable abstraction of neural computation. In this study, we investigate t...

متن کامل

A Thematic Connectionist Approach to Portuguese Language Processing

In the symbolic approach to Natural Language Processing (NLP), a system can only parse grammatically well constructed sentences. Within such a context, several linguistic phenomena, e.g. the thematic pattern relationships between the sentence constituents, can be accounted for (these pattern relationships are explained by a rule-based linguistic theory called thematic theory [1]). An alternativ...

متن کامل

Symbolic models of human sentence processing

We take “symbolic models of sentence processing” to mean approaches in which processing is characterized in terms of relatively discrete, combinatorial representations. We survey the distinct approaches: Grammar-based, automataand informationtheoretic, those involving complexity metrics and principles, cognitive architecturebased, and probabilistic models. An example is provided of each approac...

متن کامل

An incremental information-theoretic buffer supports sentence processing

People have the capability to process text three times faster than they would naturally read it, yet many current theories of sentence processing rely on natural reading times as a proxy for processing difficulty. How can people read material so quickly in spite of information processing limitations suggested by sentence processing theories? One possibility is that surprisal effects on reading ...

متن کامل

Compound effect of probabilistic disambiguation and memory retrievals on sentence processing: Evidence from an eye-tracking corpus

We evaluate the predictions of surprisal and cue-based theory of sentence processing using an eye-tracking corpus, the Potsdam Sentence Corpus. Surprisal is a measure of processing complexity based on a probabilistic grammar and is computed in terms of the total probability of structural options that have been disconfirmed at each input word. The cue-based theory characterizes processing diffic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009