J. Lang. Model.最新文献

筛选
英文 中文
Aspects of linguistic ageing in literary authors across time 文学作家语言老化的各个方面
J. Lang. Model. Pub Date : 2021-12-02 DOI: 10.15398/jlm.v9i2.270
Carmen Klaussner, Carl Vogel, A. Bhattacharya
{"title":"Aspects of linguistic ageing in literary authors across time","authors":"Carmen Klaussner, Carl Vogel, A. Bhattacharya","doi":"10.15398/jlm.v9i2.270","DOIUrl":"https://doi.org/10.15398/jlm.v9i2.270","url":null,"abstract":"This work offers an investigation into linguistic changes in a corpus of literary authors hypothesised to be possibly attributable to the effects of ageing. In part, the analysis replicates an earlier study into these effects, but adds to it by explicitly analysing and modelling competing factors, specifically the influence of background language change. Our results suggest that it is likely that this underlying change in language usage is the primary force for the change observed in the linguistic variables that was previously attributed to linguistic ageing.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123797439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investigating the effects of i-complexity and e-complexity on the learnability of morphological systems 研究i-复杂性和e-复杂性对形态系统可学习性的影响
J. Lang. Model. Pub Date : 2021-10-21 DOI: 10.15398/jlm.v9i1.259
Tamar Johnson, Kexin Gao, Kenny Smith, H. Rabagliati, J. Culbertson
{"title":"Investigating the effects of i-complexity and e-complexity on the learnability of morphological systems","authors":"Tamar Johnson, Kexin Gao, Kenny Smith, H. Rabagliati, J. Culbertson","doi":"10.15398/jlm.v9i1.259","DOIUrl":"https://doi.org/10.15398/jlm.v9i1.259","url":null,"abstract":"Research on cross-linguistic differences in morphological paradigms reveals a wide range of variation on many dimensions, including the number of categories expressed, the number of unique forms, and the number of inflectional classes. However, in an influential paper, Ackerman & Malouf (2013) argue that there is one dimension on which languages do not differ widely: in predictive structure. Predictive structure in a paradigm describes the extent to which forms predict each other, called i-complexity. Ackerman & Malouf (2013) show that although languages differ according to measure of surface paradigm complexity, called e-complexity, they tend to have low i-complexity. They conclude that morphological paradigms have evolved under a pressure for low i-complexity, such that even paradigms with very high e-complexity are relatively easy to learn so long as they have low i-complexity. While this would potentially explain why languages are able to maintain large paradigms, recent work by Johnson et al. (submitted) suggests that both neural networks and human learners may actually be more sensitive to e-complexity than i-complexity. Here we will build on this work, reporting a series of experiments under more realistic learning conditions which confirm that indeed, across a range of paradigms that vary in either e- or i-complexity, neural networks (LSTMs) are sensitive to both, but show a larger effect of e-complexity (and other measures associated with size and diversity of forms). In human learners, we fail to find any effect of i-complexity at all. Further, analysis of a large number of randomly generated paradigms show that e- and i-complexity are negatively correlated: paradigms with high e-complexity necessarily show low i-complexity.These findings suggest that the observations made by Ackerman & Malouf (2013) for natural language paradigms may stem from the nature of these measures rather than learning pressures specially attuned to i-complexity.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121080366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Approaching explanatory adequacy in phonology using Minimum Description Length 用最小描述长度接近音系的解释充分性
J. Lang. Model. Pub Date : 2021-10-07 DOI: 10.15398/jlm.v9i1.266
E. Rasin, Iddo Berger, N. Lan, Itamar Shefi, Roni Katzir
{"title":"Approaching explanatory adequacy in phonology using Minimum Description Length","authors":"E. Rasin, Iddo Berger, N. Lan, Itamar Shefi, Roni Katzir","doi":"10.15398/jlm.v9i1.266","DOIUrl":"https://doi.org/10.15398/jlm.v9i1.266","url":null,"abstract":"A linguistic theory reaches explanatory adequacy if it arrives at a linguistically-appropriate grammar based on the kind of input available to children. In phonology, we assume that children can succeed even when the input consists of surface evidence alone, with no corrections or explicit paradigmatic information – that is, in learning from distributional evidence. We take the grammar to include both a lexicon of underlying representations and a mapping from the lexicon to surface forms. Moreover, this mapping should be able to express optionality and opacity, among other textbook patterns. This learning challenge has not yet been addressed in the literature. We argue that the principle of Minimum Description Length (MDL) offers the right kind of guidance to the learner – favoring generalizations that are neither overly general nor overly specific – and can help the learner overcome the learning challenge. We illustrate with an implemented MDL learner that succeeds in learning various linguistically-relevant patterns from small corpora.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Typology emerges from simplicity in representations and learning 类型学源于表征和学习的简单性
J. Lang. Model. Pub Date : 2021-08-17 DOI: 10.15398/jlm.v9i1.262
D. Lambert, Jonathan Rawski, Jeffrey Heinz
{"title":"Typology emerges from simplicity in representations and learning","authors":"D. Lambert, Jonathan Rawski, Jeffrey Heinz","doi":"10.15398/jlm.v9i1.262","DOIUrl":"https://doi.org/10.15398/jlm.v9i1.262","url":null,"abstract":"\u0000\u0000\u0000We derive well-understood and well-studied subregular classes of formal languages purely from the computational perspective of algorithmic learning problems. We parameterise the learning problem along dimensions of representation and inference strategy. Of special interest are those classes of languages whose learning algorithms are necessarily not prohibitively expensive in space and time, since learners are often exposed to adverse conditions and sparse data. Learned natural language patterns are expected to be most like the patterns in these classes, an expectation supported by previous typological and linguistic research in phonology. A second result is that the learning algorithms presented here are completely agnostic to choice of linguistic representation. In the case of the subregular classes, the results fall out from traditional model-theoretic treatments of words and strings. The same learning algorithms, however, can be applied to model-theoretic treatments of other linguistic representations such as syntactic trees or autosegmental graphs, which opens a useful direction for future research.\u0000\u0000\u0000","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Serial verb constructions and covert coordinations in Edo - an analysis in Type Logical Grammar 江户语的串联动词结构与隐蔽配位——类型逻辑语法分析
J. Lang. Model. Pub Date : 2021-03-22 DOI: 10.15398/JLM.V8I2.221
Ralf Naumann, Thomas Gamerschlag
{"title":"Serial verb constructions and covert coordinations in Edo - an analysis in Type Logical Grammar","authors":"Ralf Naumann, Thomas Gamerschlag","doi":"10.15398/JLM.V8I2.221","DOIUrl":"https://doi.org/10.15398/JLM.V8I2.221","url":null,"abstract":"Based on both syntactic and semantic criteria, Stewart (2001) and, following him, Baker and Stewart (1999), distinguish two types of serial verb constructions (SVC) and one type of covert coordination (CC) in Edo. In this article, we present an analysis of these constructions, using Type Logical Grammar (TLG) with an event-based semantic component. We choose as base logic the non-associative Lambek calculus augmented with two unary multiplicative connectives (NL(◊, □)). SVCs and CCs are interpreted as complex event structures. The complex predicates underlying these structures are derived from simple verbs by means of a constructor. SVCs and CCs differ in terms of which part of the complex event structure is denoted. For SVCs, this is the sum of all events in the structure whereas for a CC this is only the first event in the sequence. The two verbs in an SVC and a CC are treated asymmetrically by assuming that the first verb has an extended subcategorization frame. The additional argument is of type vp (possibly modally decorated). Constraints on word order and the realization of arguments are accounted for using structural rules like permutation and contraction. The application of these rules is enforced by making use of the unary connectives.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131473882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A French corpus annotated for multiword expressions and named entities 为多词表达式和命名实体注释的法语语料库
J. Lang. Model. Pub Date : 2021-02-25 DOI: 10.15398/JLM.V8I2.265
Marie Candito, M. Constant, Carlos Ramisch, Agata Savary, Bruno Guillaume, Y. Parmentier, S. Cordeiro
{"title":"A French corpus annotated for multiword expressions and named entities","authors":"Marie Candito, M. Constant, Carlos Ramisch, Agata Savary, Bruno Guillaume, Y. Parmentier, S. Cordeiro","doi":"10.15398/JLM.V8I2.265","DOIUrl":"https://doi.org/10.15398/JLM.V8I2.265","url":null,"abstract":"\u0000\u0000\u0000We present the enrichment of a French treebank of various genres with a new annotation layer for multiword expressions (MWEs) and named entities (NEs).1 Our contribution with respect to previous work on NE and MWE annotation is the particular care taken to use formal criteria, organized into decision flowcharts, shedding some light on the interactions between NEs and MWEs. Moreover, in order to cope with the well-known difficulty to draw a clear-cut frontier between compositional expressions and MWEs, we chose to use sufficient criteria only. As a result, annotated MWEs satisfy a varying number of sufficient criteria, accounting for the scalar nature of the MWE status. In addition to the span of the elements, annotation includes the subcategory of NEs (e.g., person, location) and one matching sufficient criterion for non-verbal MWEs (e.g., lexical substitution). The 3,099 sentences of the treebank were double-annotated and adjudicated, and we paid attention to cross-type consistency and compatibility with thesyntactic layer. Overall inter-annotator agreement on non-verbal MWEs and NEs reached 71.1%. The released corpus contains 3,112 annotated NEs and 3,440 MWEs, and is distributed under an open license.\u0000\u0000\u0000","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Word prediction in computational historical linguistics 计算历史语言学中的词预测
J. Lang. Model. Pub Date : 2021-02-04 DOI: 10.15398/JLM.V8I2.268
P. Dekker, W. Zuidema
{"title":"Word prediction in computational historical linguistics","authors":"P. Dekker, W. Zuidema","doi":"10.15398/JLM.V8I2.268","DOIUrl":"https://doi.org/10.15398/JLM.V8I2.268","url":null,"abstract":"In this paper, we investigate how the prediction paradigm from machine learning and Natural Language Processing (NLP) can be put to use in computational historical linguistics. We propose word prediction as an intermediate task, where the forms of unseen words in some target language are predicted from the forms of the corresponding words in a source language. Word prediction allows us to develop algorithms for phylogenetic tree reconstruction, sound correspondence identification and cognate detection, in ways close to attested methods for linguistic reconstruction. We will discuss different factors, such as data representation and the choice of machine learning model, that have to be taken into account when applying prediction methods in historical linguistics. We present our own implementations and evaluate them on different tasks in historical linguistics.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122961322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Neural network models for phonology and phonetics 音韵学和语音学的神经网络模型
J. Lang. Model. Pub Date : 2020-10-14 DOI: 10.15398/jlm.v8i1.224
P. Boersma, Titia Benders, K. Seinhorst
{"title":"Neural network models for phonology and phonetics","authors":"P. Boersma, Titia Benders, K. Seinhorst","doi":"10.15398/jlm.v8i1.224","DOIUrl":"https://doi.org/10.15398/jlm.v8i1.224","url":null,"abstract":"This paper argues that if phonological and phonetic phenomena found in language data and in experimental data all have to be accounted for within a single framework, then that framework will have to be based on neural networks. We introduce an artificial neural network model that can handle stochastic processing in production and comprehension. With the “inoutstar” learning algorithm, the model is able to handle two seemingly disparate phenomena at the same time: gradual category creation and auditory dispersion. As a result, two aspects of the transmission of language from one generation to the next are integrated in a single model. The model therefore addresses the hitherto unsolved problem of how symbolic-looking discrete language behaviour can emerge in the child from gradient input data from her language environment. We conclude that neural network models, besides being more biologically plausible than other frameworks, hold a promise for fruitful theorizing in an area of linguistics that traditionally assumes both continuous and discrete levels of representation.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114334156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Computing and classifying reduplication with 2-way finite-state transducers 用双向有限状态传感器计算和分类重复
J. Lang. Model. Pub Date : 2020-09-28 DOI: 10.15398/jlm.v8i1.245
Hossep Dolatian, Jeffrey Heinz
{"title":"Computing and classifying reduplication with 2-way finite-state transducers","authors":"Hossep Dolatian, Jeffrey Heinz","doi":"10.15398/jlm.v8i1.245","DOIUrl":"https://doi.org/10.15398/jlm.v8i1.245","url":null,"abstract":"This article describes a novel approach to the computational modeling of reduplication. Reduplication is often treated as a stumbling block within finite-state treatments of morphology because they cannot adequately capture the productivity of unbounded copying (total reduplication) and because they cannot describe bounded copying (partial reduplication) without a large increase in the number of states. We provide a comprehensive typology of reduplicative processes and show that an understudied type of finite-state machine, 2-way deterministic finite-state transducers (2-way D-FSTs), captures virtually all of them. Furthermore, the 2-way D-FSTs have few states, are in practice easy to design and debug, and are linguistically motivated in terms of the transducer’s origin semantics or segment alignment. Most of these processes, and their corresponding 2-way D-FSTs, are available in an online database of reduplication (RedTyp). We classify these 2- way D-FSTs according to the concatenation of known subclasses of regular relations and show that the majority fall into the Concatenated Output Strictly Local (C-OSL) class. Other cases require higher subclasses but are still definable by 2-way D-FSTs.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123341881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Distinguishing between paradigmatic semantic relations across word classes: human ratings and distributional similarity 区分跨词类的聚合语义关系:人类评级和分布相似性
J. Lang. Model. Pub Date : 2020-06-30 DOI: 10.15398/jlm.v8i1.199
Sabine Schulte im Walde
{"title":"Distinguishing between paradigmatic semantic relations across word classes: human ratings and distributional similarity","authors":"Sabine Schulte im Walde","doi":"10.15398/jlm.v8i1.199","DOIUrl":"https://doi.org/10.15398/jlm.v8i1.199","url":null,"abstract":"This article explores the distinction between paradigmatic semantic relations, both from a cognitive and a computational linguistic perspective. Focusing on an existing dataset of German synonyms, antonyms and hypernyms across the word classes of nouns, verbs and adjectives, we assess human ratings and a supervised classification model using window-based and pattern-based distributional vector spaces. Both perspectives suggest differences in relation distinction across word classes, but easy vs. difficult class–relation combinations differ, exhibiting stronger ties between ease and naturalness of classdependent relations for humans than for computational models. In addition, we demonstrate that distributional information is indeed a difficult starting point for distinguishing between paradigmatic relations but that even a simple classification model is able to manage this task. The fact that the most salient vector spaces and their success vary across word classes and paradigmatic relations suggests that combining feature types for relation distinction is better than applying them in isolation.","PeriodicalId":403597,"journal":{"name":"J. Lang. Model.","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信