Number and Comitative-inclusory Constructions in Marori

被引：0
|
作者：
Arka, I. Wayan [1 ,2 ]
机构：
[1] Australian Natl Univ, Canberra, ACT, Australia
[2] Udayana Univ, Denpasar, Indonesia
来源：
PROCEEDINGS OF THE LFG'19 CONFERENCE | 2019年
关键词：
number; plural; comitative; inclusory; associative; morphosemantic; coordination appositive; LANGUAGES;
D O I：
暂无
中图分类号：
H [语言、文字];
学科分类号：
05 ;
摘要：
The number system in Marori is morphosemantic, showing underspecified distributive exponence in number marking, which allows for the rich expression of nonsingular comitative-inclusory- associative meaning. The proposed LFG analysis consists of two parts: the decomposition of the number values ([+/-SG] and [+/-CUM]), and c-structure annotations with two template calls to capture the intricacies of the conjunctive and appositive properties involved in comitative constructions in Marori. It is demonstrated that the LFG analysis can straightforwardly capture the interaction of nominal and verbal number in expressing comitative meaning.
引用
收藏
页码：48 / 68
页数：21
相关论文
共 50 条
  • [31] Pseudorandom Binary Sequences: Quality Measures and Number-Theoretic Constructions
    Winterhof, Arne
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (12) : 1452 - 1460
  • [32] Number-theoretic constructions of efficient pseudo-random functions
    Naor, M
    Reingold, O
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 458 - 467
  • [33] On constructions and properties of (n, m)-functions with maximal number of bent components
    Zheng, Lijing
    Peng, Jie
    Kan, Haibin
    Li, Yanjun
    Luo, Juan
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (10) : 2171 - 2186
  • [34] Constructions of resilient rotation symmetric Boolean functions on given number of variables
    Du, Jiao
    Wen, Qiaoyan
    Zhang, Jie
    Pang, Shanqi
    IET INFORMATION SECURITY, 2014, 8 (05) : 265 - 272
  • [35] On constructions and properties of (n, m)-functions with maximal number of bent components
    Lijing Zheng
    Jie Peng
    Haibin Kan
    Yanjun Li
    Juan Luo
    Designs, Codes and Cryptography, 2020, 88 : 2171 - 2186
  • [36] Number-theoretic constructions of efficient pseudo-random functions
    Naor, M
    Reingold, O
    JOURNAL OF THE ACM, 2004, 51 (02) : 231 - 262
  • [37] ON THE NUMBER OF BENT FUNCTIONS FROM ITERATIVE CONSTRUCTIONS: LOWER BOUNDS AND HYPOTHESES
    Tokareva, Natalia
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2011, 5 (04) : 609 - 621
  • [38] FORMATION OF NUMBER OF FIELD FACILITY CONSTRUCTIONS IN OIL-RECOVERY REGION
    AKHMETVALEEV, SA
    NEFTYANOE KHOZYAISTVO, 1989, (07): : 31 - 33
  • [39] Constructions of optical 2-to-1 FIFO multiplexers with a limited number of recirculations
    Cheng, Jay
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 4040 - 4052
  • [40] Complexities of finite families of polynomials, Weyl systems, and constructions in combinatorial number theory
    Bergelson, V.
    Leibman, A.
    Lesigne, E.
    JOURNAL D ANALYSE MATHEMATIQUE, 2007, 103 (1): : 47 - 92
12345