Coding efficiency in nominal inflection: expectedness and type frequency effects

被引:2
作者
Guzman Naranjo, Matias [1 ]
Becker, Laura [2 ]
机构
[1] Univ Paris, CNRS, LLF, Paris, France
[2] Univ Freiburg, Erlangen, Germany
来源
LINGUISTICS VANGUARD | 2021年 / 7卷
关键词
coding efficiency; entropy; form-expectedness correspondence hypothesis; inflection morphology; quantitative typology; R PACKAGE; TYPOLOGY; LANGUAGE; ENTROPY; WORD;
D O I
10.1515/lingvan-2019-0075
中图分类号
H0 [语言学];
学科分类号
030303 ; 0501 ; 050102 ;
摘要
Since (Zipf, George Kingsley. 1935. The psychobiology of language: An introduction to dynamic philology. Cambridge, MA: MIT Press; Zipf, George Kingsley. 1949. Human behavior and the principle of least effort. Journal of Consulting Psychology 13(3)), it has been known that more frequent lexical items tend to be shorter than less frequent ones, and this association between the length of an expression and its frequency has been applied to various grammatical patterns (syntactic, morphological, and phonological) and related to predictability or expectedness in the typological literature. However, the exact interactions of frequency and expectedness, their effect on shortening, and the mechanisms involved, are still not well understood. This paper proposes the Form-Expectedness Correspondence Hypothesis (fech), taking into account not only the frequency of expressions but their overall structure and distribution, and explores the fech in the domain of nominal inflection from a quantitative perspective.
引用
收藏
页数:16
相关论文
共 55 条
  • [1] Ackerman F., 2009, ANALOGY GRAMMAR FORM, P54, DOI DOI 10.1093/ACPROF:OSO/9780199547548.003.0003
  • [2] Word and pattern morphology: An information-theoretic approach
    Ackerman, Farrell
    Malouf, Robert
    [J]. WORD STRUCTURE, 2016, 9 (02) : 125 - 131
  • [3] MORPHOLOGICAL ORGANIZATION: THE LOW CONDITIONAL ENTROPY CONJECTURE
    Ackerman, Farrell
    Malouf, Robert
    [J]. LANGUAGE, 2013, 89 (03) : 429 - 464
  • [4] [Anonymous], 2001, Phonology and language use
  • [5] [Anonymous], 2007, FREQUENCY USE ORG LA, DOI DOI 10.1093/ACPROF:OSO/9780195301571.001.0001
  • [6] Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
    Arnold, Michael
    Ohlebusch, Enno
    [J]. ALGORITHMICA, 2011, 60 (04) : 806 - 818
  • [7] Aronoff Mark, 1994, Morphology by Itself: Stems and Inflectional Classes
  • [8] Baerman Matthew, 2015, MORPHEME ITS NATURE
  • [9] Beniamine Sacha., 2018, CLASSIFICATIONS FLEX
  • [10] Berdicevskis Aleksandrs., 2018, P 2 WORKSHOP UNIVERS, P8, DOI 10.18653/v1/W18-6002