Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures最新文献

筛选
英文 中文
ImageTTR: Grounding Type Theory with Records in Image Classification for Visual Question Answering ImageTTR:基于记录的图像分类视觉问答的基础类型理论
Arild Matsson, Simon Dobnik, Staffan Larsson
{"title":"ImageTTR: Grounding Type Theory with Records in Image Classification for Visual Question Answering","authors":"Arild Matsson, Simon Dobnik, Staffan Larsson","doi":"10.18653/v1/W19-1007","DOIUrl":"https://doi.org/10.18653/v1/W19-1007","url":null,"abstract":"We present ImageTTR, an extension to the Python implementation of Type Theory with Records (pyTTR) which connects formal record type representation with image classifiers implemented as deep neural networks. The Type Theory with Records framework serves as a knowledge representation system for natural language the representations of which are grounded in perceptual information of neural networks. We demonstrate the benefits of this symbolic and data-driven hybrid approach on the task of visual question answering.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131004881","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}
引用次数: 1
Translating a Fragment of Natural Deduction System for Natural Language into Modern Type Theory 自然语言的自然演绎系统片段到现代类型理论的翻译
Ivo Pezlar
{"title":"Translating a Fragment of Natural Deduction System for Natural Language into Modern Type Theory","authors":"Ivo Pezlar","doi":"10.18653/v1/W19-1002","DOIUrl":"https://doi.org/10.18653/v1/W19-1002","url":null,"abstract":"In this paper, we investigate the possibility of translating a fragment of natural deduction system (NDS) for natural language semantics into modern type theory (MTT), originally suggested by Luo (2014). Our main goal will be to examine and translate the basic rules of NDS (namely, meta-rules, structural rules, identity rules, noun rules and rules for intersective and subsective adjectives) to MTT. Additionally, we will also consider some of their general features.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131656620","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
Modeling language constructs with compatibility intervals 对具有兼容性间隔的语言构造进行建模
Pavlo Kapustin, Michael Kapustin
{"title":"Modeling language constructs with compatibility intervals","authors":"Pavlo Kapustin, Michael Kapustin","doi":"10.18653/v1/W19-1006","DOIUrl":"https://doi.org/10.18653/v1/W19-1006","url":null,"abstract":"We describe a representation for modeling meaning of natural language constructs that is closely related to fuzzy sets. Same as fuzzy sets, it allows to express quantitative relationships between different concepts, and is designed to support vagueness and imprecision common to natural language. We compare the representations using several examples, and argue that in some cases the proposed representation may be a good alternative to the fuzzy set based representation, and that it may also be easier to learn from data.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132350217","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}
引用次数: 1
Enthymemetic Conditionals: Topoi as a guide for acceptability 热力学条件:作为可接受性指南的拓扑
Eimear Maguire
{"title":"Enthymemetic Conditionals: Topoi as a guide for acceptability","authors":"Eimear Maguire","doi":"10.18653/v1/W19-1008","DOIUrl":"https://doi.org/10.18653/v1/W19-1008","url":null,"abstract":"To model conditionals in a way that reflects their acceptability, we must include some means of making judgements about whether antecedent and consequent are meaningfully related or not. Enthymemes are non-logical arguments which do not hold up by themselves, but are acceptable through their relation to a topos, an already-known general principle or pattern for reasoning. This paper uses enthymemes and topoi as a way to model the world-knowledge behind these judgements. In doing so, it provides a reformalisation (in TTR) of enthymemes and topoi as networks rather than functions, and information state update rules for conditionals.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114175447","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}
引用次数: 1
Computational Syntax-Semantics Interface with Type-Theory of Acyclic Recursion for Underspecified Semantics 欠指定语义的计算语法语义接口与无循环递归类型论
Roussanka Loukanova
{"title":"Computational Syntax-Semantics Interface with Type-Theory of Acyclic Recursion for Underspecified Semantics","authors":"Roussanka Loukanova","doi":"10.18653/v1/W19-1005","DOIUrl":"https://doi.org/10.18653/v1/W19-1005","url":null,"abstract":"The paper provides a technique for algorithmic syntax-semantics interface in computational grammar with underspecified semantic representations of human language. The technique is introduced for expressions that contain NP quantifiers, by using computational, generalised ConstraintBased Lexicalised Grammar (GCBLG) that represents major, common syntactic characteristics of a variety of approaches to formal grammar and natural language processing (NLP). Our solution can be realised by any of the grammar formalisms in the CBLG class, e.g., Head-Driven Phrase Structure Grammar (HPSG), Lexical Functional Grammar (LFG), Categorial Grammar (CG). The type-theory of acyclic recursion L ar , provides facility for representing major semantic ambiguities, as underspecification, at the object level of the formal language of L ar , without recourse of meta-language variables. Specific semantic representations can be obtained by instantiations of underspecified L ar terms, in context. These are subject to constraints provided by a newly introduced feature-structure description of syntax-semantics interface in GCBLG.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129945204","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
Underspecification and interpretive parallelism in Dependent Type Semantics 依赖类型语义中的不规范和解释并行
Yusuke Kubota, K. Mineshima, R. Levine, D. Bekki
{"title":"Underspecification and interpretive parallelism in Dependent Type Semantics","authors":"Yusuke Kubota, K. Mineshima, R. Levine, D. Bekki","doi":"10.18653/v1/W19-1001","DOIUrl":"https://doi.org/10.18653/v1/W19-1001","url":null,"abstract":"The scope parallelism in the Geach sentence (Every boy loves, and every girl detests, some saxophonist) and the related parallel interpretation requirement in pronominal binding is a pervasive phenomenon found across different types of coordination and ellipsis phenomena. Previous accounts all resort to additional constraints of some sort that restrict the otherwise flexible syntax-semantics interface to avoid overgeneration. In this paper, we propose a novel approach to this long-standing problem. We show that, by taking a proof-theoretic perspective on natural language semantics and by viewing the ambiguity resolution for pronouns and indefinites as underspecification resolution that invokes extra proof search, a conceptually natural solution emerges for the problem of interpretive parallelism. The analysis is cast in Dependent Type Semantics, with Hybrid Type-Logical Categorial Grammar as the syntax-semantics interface backbone. For empirical illustration, we show how the proposed approach correctly accounts for the classical Geach paradigm and its pronominal variant.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130226077","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}
引用次数: 1
Modeling the Induced Action Alternation and the Caused-Motion Construction with Tree Adjoining Grammar (TAG) and Semantic Frames 用树相邻语法和语义框架建模诱导动作交替和导致动作构造
Esther Seyffarth
{"title":"Modeling the Induced Action Alternation and the Caused-Motion Construction with Tree Adjoining Grammar (TAG) and Semantic Frames","authors":"Esther Seyffarth","doi":"10.18653/v1/W19-1003","DOIUrl":"https://doi.org/10.18653/v1/W19-1003","url":null,"abstract":"The induced action alternation and the caused-motion construction are two phenomena that allow English verbs to be interpreted as motion-causing events. This is possible when a verb is used with a direct object and a directional phrase, even when the verb does not lexically signify causativity or motion, as in “Sylvia laughed Mary off the stage”. While participation in the induced action alternation is a lexical property of certain verbs, the caused-motion construction is not anchored in the lexicon. We model both phenomena with XMG-2 and use the TuLiPA parser to create compositional semantic frames for example sentences. We show how such frames represent the key differences between these two phenomena at the syntax-semantics interface, and how TAG can be used to derive distinct analyses for them.","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126939870","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
Complex event representation in a typed feature structure implementation of Role and Reference Grammar 角色和引用语法的类型化特征结构实现中的复杂事件表示
Erika Bellingham
{"title":"Complex event representation in a typed feature structure implementation of Role and Reference Grammar","authors":"Erika Bellingham","doi":"10.18653/v1/W19-1004","DOIUrl":"https://doi.org/10.18653/v1/W19-1004","url":null,"abstract":"Role and Reference Grammar (RRG) (Foley and Van Valin, 1984; Van Valin and LaPolla, 1997; Van Valin, 2005) is typologically general, semantically-driven syntactic framework. A major focus of RRG is a fine-grained typology of form-to-meaning mapping, emphasizing the syntactic and semantic structure of complex event descriptions. I introduce a constraint-based typed feature structure variant of RRG which exploits RRG’s semantically-motivated syntactic backbone: the Layered Structure of the Clause (LSC). Each layer in the LSC is represented as a subtype of sign, and the unique combination of syntactic and semantic properties possessed by each layer is captured by a set of constraints on the appropriate sign subtype. Sentences are incrementally built up from predicates (represented semantically as event frames) to propositions using constructions to pass and combine information through the different layers (and juncture types) in the LSC. An English fragment of this constraint-based RRG is implemented using the Attribute Logic Engine (Carpenter, 1992).","PeriodicalId":360646,"journal":{"name":"Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129263662","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
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学术文献互助群
群 号:481959085
Book学术官方微信