发布求助
文献互助 智能选刊 最新文献

Mathematics of Language最新文献

筛选
英文 中文
Count-Invariance Including Exponentials 包括指数的计数不变性
Mathematics of Language Pub Date : 2017-07-01 DOI: 10.18653/v1/W17-3413
S. Kuznetsov, G. Morrill, Oriol Valentín
{"title":"Count-Invariance Including Exponentials","authors":"S. Kuznetsov, G. Morrill, Oriol Valentín","doi":"10.18653/v1/W17-3413","DOIUrl":"https://doi.org/10.18653/v1/W17-3413","url":null,"abstract":"We define infinitary count-invariance for categorial logic, extending countinvariance for multiplicatives (van Benthem, 1991) and additives and bracket modalities (Valentin et al., 2013) to include exponentials. This provides an effective tool for pruning proof search in categorial parsing/theorem-proving.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208008","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
Introducing Structure into Neural Network-Based Semantic Models 在基于神经网络的语义模型中引入结构
Mathematics of Language Pub Date : 2017-07-01 DOI: 10.18653/v1/W17-3412
S. Clark
{"title":"Introducing Structure into Neural Network-Based Semantic Models","authors":"S. Clark","doi":"10.18653/v1/W17-3412","DOIUrl":"https://doi.org/10.18653/v1/W17-3412","url":null,"abstract":"In this talk I will describe two attempts at introducing syntactic structure into semantic models using neural network architectures. The first study focuses on a particular grammatical construction, namely relative clauses, and centers around the design of a new dataset for testing compositional distributional models. The dataset is called RELPRON, and consists of pairs of terms and properties, such as","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128919759","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
Syntactic Polygraphs. A Formalism Extending Both Constituency and Dependency 语法测谎仪。一种扩展选区和依赖关系的形式主义
Mathematics of Language Pub Date : 2015-07-27 DOI: 10.3115/v1/W15-2313
Sylvain Kahane, N. Mazziotta
{"title":"Syntactic Polygraphs. A Formalism Extending Both Constituency and Dependency","authors":"Sylvain Kahane, N. Mazziotta","doi":"10.3115/v1/W15-2313","DOIUrl":"https://doi.org/10.3115/v1/W15-2313","url":null,"abstract":"Syntactic analyses describe grouping operations that explain how words are combined to form utterances. The nature of these operations depends on the approach. In a constituency-based approach, grouping operations are ordered, or stratified, part-whole relations. In a dependency-based approach, grouping operations identify a governor (or head), i.e. they are directed hierarchical relations between words. It is possible to convert a constituency tree into a dependency tree by dereifying the nodes, by identifying the governor and by removing the stratification of the part-whole relations. Polygraphs combine the two types of information into a single structure and are therefore a more powerful formalism. By relaxing constraints, polygraphs also allow to underspecify both kinds of information.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884417","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}
引用次数: 20
A Refined Notion of Memory Usage for Minimalist Parsing 一种用于极简解析的内存使用的精炼概念
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2301
T. Graf, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, Chong Zhang
{"title":"A Refined Notion of Memory Usage for Minimalist Parsing","authors":"T. Graf, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, Chong Zhang","doi":"10.3115/v1/W15-2301","DOIUrl":"https://doi.org/10.3115/v1/W15-2301","url":null,"abstract":"Recently there has been a lot of interest in testing the processing predictions of a specific top-down parser for Minimalist grammars (Stabler, 2013). Most of this work relies on memory-based difficulty metrics that relate the shape of the parse tree to processing behavior. We show that none of the difficulty metrics proposed so far can explain why subject relative clauses are more easily processed than object relative clauses in Chinese, Korean, and Japanese. However, a minor tweak to how memory load is determined is sufficient to fully capture the data. This result thus lends further support to the hypothesis that very simple notions of resource usage are powerful enough to explain a variety of processing phenomena.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114704610","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}
引用次数: 12
Topology of Language Classes 语言类的拓扑结构
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2303
S. Fulop, D. Kephart
{"title":"Topology of Language Classes","authors":"S. Fulop, D. Kephart","doi":"10.3115/v1/W15-2303","DOIUrl":"https://doi.org/10.3115/v1/W15-2303","url":null,"abstract":"Theimplicationsofa specific pseudometricon the collection of languages over a finite alphabet are explored. In distinction from an approach in (Calude et al., 2009) that relates to collections of infinite or bi-infinite sequences, the present work is based on an adaptation of the “Besicovitch” pseudometric introduced by Besicovitch (1932) and elaborated in (Cattaneo et al., 1997) in the context of cellular automata. Using this pseudometric to form a metric quotient space, we study its propertiesanddrawconclusionsaboutthe locationof certain well-understood families of languages in the language space. We find that topologies, both on the space of formal languages itself and upon quotient spaces derived from pseudometrics on the language space, may offer insights into the relationships, and in particular the distance, between languages over a common alphabet.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127933066","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
Canonical Context-Free Grammars and Strong Learning: Two Approaches 规范上下文无关语法和强学习:两种方法
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2309
Alexander Clark
{"title":"Canonical Context-Free Grammars and Strong Learning: Two Approaches","authors":"Alexander Clark","doi":"10.3115/v1/W15-2309","DOIUrl":"https://doi.org/10.3115/v1/W15-2309","url":null,"abstract":"Strong learning of context-free grammars is the problem of learning a grammar which is not just weakly equivalent to a target grammar but isomorphic or structurally equivalent to it. This is closely related to the problem of defining a canonical grammar for the language. The current proposal for strong learning of a small class of CFGs uses grammars whose nonterminals correspond to congruence classes of the language, in particular to a subset of those that satisfy a primality condition. Here we extend this approach to larger classes of CFGs where the nonterminals correspond instead to closed sets of strings; to elements of the syntactic concept lattice. We present two different classes of canonical context-free grammars. One is based on all of the primes in the lattice: the other, more suitable for strong learning algorithms is based on a subset of primes that are irreducible in a certain sense.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114309718","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
A Synopsis of Morphoid Type Theory 形态类型理论综述
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2307
D. McAllester
{"title":"A Synopsis of Morphoid Type Theory","authors":"D. McAllester","doi":"10.3115/v1/W15-2307","DOIUrl":"https://doi.org/10.3115/v1/W15-2307","url":null,"abstract":"Morphoid type theory (MTT) is a typetheoretic foundation for mathematics supporting the concept of isomorphism and the substitution of isomorphics. Unlike homotopy type theory (HoTT), which also supports isomorphism, morphoid type theory is a direct extension of classical predicate calculus and avoids the intuitionistic constructs of propositionsas-types, path induction and squashing. Although HoTT is capable of supporting classical inference, MTT’s thoroughly classical treatment is expected to be more comfortable for those who take a Platonic or realist approach to the practice of mathematics.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133342790","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
General Perspective on Distributionally Learnable Classes 分布可学类的总体观点
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2308
Ryo Yoshinaka
{"title":"General Perspective on Distributionally Learnable Classes","authors":"Ryo Yoshinaka","doi":"10.3115/v1/W15-2308","DOIUrl":"https://doi.org/10.3115/v1/W15-2308","url":null,"abstract":"Several algorithms have been proposed to learn different subclasses of context-free grammars based on the idea generically called distributional learning. Those techniques have been applied to many formalisms richer than context-free grammars like multiple context-free grammars, simple contextfree tree grammars and others. The learning algorithms for those different formalisms are actually quite similar to each other. We in this paper give a uniform view on those algorithms.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131868893","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
How to Choose Successful Losers in Error-Driven Phonotactic Learning 在错误驱动的语音定向学习中，如何选择成功的输家
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2311
Giorgio Magri, R. Kager
{"title":"How to Choose Successful Losers in Error-Driven Phonotactic Learning","authors":"Giorgio Magri, R. Kager","doi":"10.3115/v1/W15-2311","DOIUrl":"https://doi.org/10.3115/v1/W15-2311","url":null,"abstract":"An error-driven phonotactic learner is trained on a stream of licit phonological forms. Each piece of training data counts as a winner in terms of Optimality Theory. In order to test its current grammar, the learner needs to compare the current winner with a properly chosen loser. This paper advocates a new subroutine for the choice of the loser, based on the idea of minimizing the “distance” from the given winner.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132418345","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 Concatenation Operation to Derive Autosegmental Graphs 导出自分段图的连接操作
Mathematics of Language Pub Date : 2015-07-01 DOI: 10.3115/v1/W15-2312
Adam Jardine, Jeffrey Heinz
{"title":"A Concatenation Operation to Derive Autosegmental Graphs","authors":"Adam Jardine, Jeffrey Heinz","doi":"10.3115/v1/W15-2312","DOIUrl":"https://doi.org/10.3115/v1/W15-2312","url":null,"abstract":"Autosegmental phonology represents words with graph structures. This paper introduces a way of reasoning about autosegmental graphs as strings of concatenated graph primitives. The main result shows that the sets of autosegmental graphs so generated obey two important, putatively universal, constraints in phonological theory provided that the graph primitives also obey these constraints. These constraints are the Obligatory Contour Principle and the No Crossing Constraint. Thus, these constraints can be understood as being derived from a finite basis under concatenation. This contrasts with (and complements) earlier analyses of autosegmental representations, where these constraints were presented as axioms of the grammatical system. Empirically motivated examples are provided.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133363967","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
首页 上一页 下一页 尾页
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学术官方微信