Name
Abstract | ||
|---|---|---|
It has previously been assumed in the psycholinguistic literature that finite-state models of language are crucially limited in their explanatory power by the locality of the probability distribution and the narrow scope of information used by the model. We show that a simple computational model (a bigram part-of-speech tagger based on the design used by Corley and Crocker (2000)) makes correct predictions on processing difficulty observed in a wide range of empirical sentence processing data. We use two modes of evaluation: one that relies on comparison with a control sentence, paralleling practice in human studies; another that measures probability drop in the disambiguating region of the sentence. Both are surprisingly good indicators of the processing difficulty of garden-path sentences. The sentences tested are drawn from published sources and systematically explore five different types of ambiguity: previous studies have been narrower in scope and smaller in scale, We do not deny the limitations of finite-state models, but argue that our results show that their usefulness has been underestimated. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.3115/1220175.1220182 | ACL |
Keywords | DocType | Volume |
simple computational model,bigram part-of-speech tagger,human sentence processing,probability drop,garden-path sentence,control sentence,narrow scope,finite-state model,empirical sentence processing data,processing difficulty,probability distribution | Conference | P06-1 |
Citations | PageRank | References |
1 | 0.47 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jihyun Park | 1 | 1 | 0.47 |
| Chris Brew | 2 | 321 | 44.44 |