arXiv: Computation and Language最新文献

筛选
英文 中文
Verbs Taking Clausal and Non-Finite Arguments as Signals of Modality – Revisiting the Issue of Meaning Grounded in Syntax 动词以小句和非有限实参作为情态的信号——重新审视基于句法的意义问题
arXiv: Computation and Language Pub Date : 2015-09-11 DOI: 10.18653/v1/P16-1077
Judith Eckle-Kohler
{"title":"Verbs Taking Clausal and Non-Finite Arguments as Signals of Modality – Revisiting the Issue of Meaning Grounded in Syntax","authors":"Judith Eckle-Kohler","doi":"10.18653/v1/P16-1077","DOIUrl":"https://doi.org/10.18653/v1/P16-1077","url":null,"abstract":"We revisit Levin's theory about the correspondence of verb meaning and syntax and infer semantic classes from a large syntactic classification of more than 600 German verbs taking clausal and non-finite arguments. Grasping the meaning components of Levin-classes is known to be hard. We address this challenge by setting up a multi-perspective semantic characterization of the inferred classes. To this end, we link the inferred classes and their English translation to independently constructed semantic classes in three different lexicons - the German wordnet GermaNet, VerbNet and FrameNet - and perform a detailed analysis and evaluation of the resulting German-English classification (available at www.ukp.tu-darmstadt.de/modality-verbclasses/).","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727985","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
Connotation Frames: A Data-Driven Investigation 内涵框架:数据驱动的调查
arXiv: Computation and Language Pub Date : 2015-06-09 DOI: 10.18653/v1/P16-1030
Hannah Rashkin, Sameer Singh, Yejin Choi
{"title":"Connotation Frames: A Data-Driven Investigation","authors":"Hannah Rashkin, Sameer Singh, Yejin Choi","doi":"10.18653/v1/P16-1030","DOIUrl":"https://doi.org/10.18653/v1/P16-1030","url":null,"abstract":"Through a particular choice of a predicate (e.g., \"x violated y\"), a writer can subtly connote a range of implied sentiments and presupposed facts about the entities x and y: (1) writer's perspective: projecting x as an \"antagonist\"and y as a \"victim\", (2) entities' perspective: y probably dislikes x, (3) effect: something bad happened to y, (4) value: y is something valuable, and (5) mental state: y is distressed by the event. We introduce connotation frames as a representation formalism to organize these rich dimensions of connotation using typed relations. First, we investigate the feasibility of obtaining connotative labels through crowdsourcing experiments. We then present models for predicting the connotation frames of verb predicates based on their distributional word representations and the interplay between different types of connotative relations. Empirical results confirm that connotation frames can be induced from various data sources that reflect how people use language and give rise to the connotative meanings. We conclude with analytical results that show the potential use of connotation frames for analyzing subtle biases in online news media.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122870199","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}
引用次数: 65
Introduction of the weight edition errors in the Levenshtein distance 介绍了列文施泰因距离的权重版误差
arXiv: Computation and Language Pub Date : 2012-08-22 DOI: 10.14569/IJARAI.2012.010506
Gueddah Hicham
{"title":"Introduction of the weight edition errors in the Levenshtein distance","authors":"Gueddah Hicham","doi":"10.14569/IJARAI.2012.010506","DOIUrl":"https://doi.org/10.14569/IJARAI.2012.010506","url":null,"abstract":"In this paper, we present a new approach dedicated to correcting the spelling errors of the Arabic language. This approach corrects typographical errors like inserting, deleting, and permutation. Our method is inspired from the Levenshtein algorithm, and allows a finer and better scheduling than Levenshtein. The results obtained are very satisfactory and encouraging, which shows the interest of our new approach.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127718159","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}
引用次数: 30
Plutonium‐Based Superconductivity: The Audacity of the 5f Electrons? 钚基超导性:5f电子的大胆性?
arXiv: Computation and Language Pub Date : 2003-07-22 DOI: 10.1063/1.1594535
J. Sarrao, L. Morales, J. Thompson, B. Scott, G. Stewart, F. Wastin, J. Rebizant, P. Boulet, E. Colineau, G. Lander
{"title":"Plutonium‐Based Superconductivity: The Audacity of the 5f Electrons?","authors":"J. Sarrao, L. Morales, J. Thompson, B. Scott, G. Stewart, F. Wastin, J. Rebizant, P. Boulet, E. Colineau, G. Lander","doi":"10.1063/1.1594535","DOIUrl":"https://doi.org/10.1063/1.1594535","url":null,"abstract":"This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is defined in which parse tables are created by need while parsing. We then describe an incremental parser generator for TALs which responds to modification of the input grammar by updating parse tables built so far.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124626194","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
Noun-phrase co-occurrence statistics for semi-automatic semantic lexicon construction 半自动语义词典构建的名短语共现统计
arXiv: Computation and Language Pub Date : 2000-08-24 DOI: 10.3115/980432.980751
Brian Roark, Eugene Charniak
{"title":"Noun-phrase co-occurrence statistics for semi-automatic semantic lexicon construction","authors":"Brian Roark, Eugene Charniak","doi":"10.3115/980432.980751","DOIUrl":"https://doi.org/10.3115/980432.980751","url":null,"abstract":"Generating semantic lexicons semi-automatically could be a great time saver, relative to creating them by hand. In this paper, we present an algorithm for extracting potential entries for a category from an on-line corpus, based upon a small set of exemplars. Our algorithm finds more correct terms and fewer incorrect ones than previous work in this area. Additionally, the entries that are generated potentially provide broader coverage of the category than would occur to an individual coding them by hand. Our algorithm finds many terms not included within Wordnet (many more than previous algorithms), and could be viewed as an ``enhancer'' of existing broad-coverage resources.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116284884","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}
引用次数: 112
Statistical Models for Unsupervised Prepositional Phrase Attachment 无监督介词短语连接的统计模型
arXiv: Computation and Language Pub Date : 1998-07-22 DOI: 10.3115/980432.980746
A. Ratnaparkhi
{"title":"Statistical Models for Unsupervised Prepositional Phrase Attachment","authors":"A. Ratnaparkhi","doi":"10.3115/980432.980746","DOIUrl":"https://doi.org/10.3115/980432.980746","url":null,"abstract":"We present several unsupervised statistical models for the prepositional phrase attachment task that approach the accuracy of the best supervised methods for this task. Our unsupervised approach uses a heuristic based on attachment proximity and trains from raw text that is annotated with only part-of-speech tags and morphological base forms, as opposed to attachment information. It is therefore less resource-intensive and more portable than previous corpus-based algorithms proposed for this task. We present results for prepositional phrase attachment in both English and Spanish.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121954330","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}
引用次数: 38
Learning Correlations between Linguistic Indicators and Semantic Constraints: Reuse of Context-Dependent Descriptions of Entities 语言指示和语义约束之间的学习关联:实体上下文相关描述的重用
arXiv: Computation and Language Pub Date : 1998-05-31 DOI: 10.3115/980432.980745
Dragomir R. Radev
{"title":"Learning Correlations between Linguistic Indicators and Semantic Constraints: Reuse of Context-Dependent Descriptions of Entities","authors":"Dragomir R. Radev","doi":"10.3115/980432.980745","DOIUrl":"https://doi.org/10.3115/980432.980745","url":null,"abstract":"This paper presents the results of a study on the semantic constraints imposed on lexical choice by certain contextual indicators. We show how such indicators are computed and how correlations between them and the choice of a noun phrase description of a named entity can be automatically established using supervised learning. Based on this correlation, we have developed a technique for automatic lexical choice of descriptions of entities in text generation. We discuss the underlying relationship between the pragmatics of choosing an appropriate description that serves a specific purpose in the automatically generated text and the semantics of the description itself. We present our work in the framework of the more general concept of reuse of linguistic structures that are automatically extracted from large corpora. We present a formal evaluation of our approach and we conclude with some thoughts on potential applications of our method.","PeriodicalId":422005,"journal":{"name":"arXiv: Computation and Language","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129712193","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
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学术官方微信
小红书