Information‐theoretical Complexity Metrics
Language and Linguistics Compass · 2016-09 · 10 (9) · 397-412
DOI: 10.1111/lnc3.12196 ↗Kurz gefasst
Fachartikel in der Zeitschrift Language and Linguistics Compass, online erschienen am 09.08.2016. Verfasst von John Hale. Die Arbeit wurde bisher 141-mal zitiert (Crossref) und nennt 81 Literaturangaben. Gefördert von: NSF CAREER.
Abstract (Originalsprache)
Information‐theoretical complexity metrics are auxiliary hypotheses that link theories of parsing and grammar to potentially observable measurements such as reading times and neural signals. This review article considers two such metrics, Surprisal and Entropy Reduction, which are respectively built upon the two most natural notions of ‘information value’ for an observed event (Blachman ). This review sketches their conceptual background and touches on their relationship to other theories in cognitive science. It characterizes them as ‘lenses’ through which theorists ‘see’ the information‐processing consequences of linguistic grammars. While these metrics are not themselves parsing algorithms, the review identifies candidate mechanisms that have been proposed for both of them.
Förderung
- NSF CAREER
Zitieren
APA
Hale, J. (2016). Information‐theoretical Complexity Metrics. Language and Linguistics Compass, 10(9), 397-412. https://doi.org/10.1111/lnc3.12196
Vancouver
Hale J. Information‐theoretical Complexity Metrics. Language and Linguistics Compass. 2016;10(9):397-412. doi:10.1111/lnc3.12196
BibTeX
@article{Hale2016,
author = {Hale, John},
title = {Information‐theoretical Complexity Metrics},
journal = {Language and Linguistics Compass},
year = {2016},
volume = {10},
number = {9},
pages = {397--412},
doi = {10.1111/lnc3.12196}
}
EUVIMED