一种基于聚类图的多词短语字面和非字面无监督识别方法

Workshop on Graph-based Methods for Natural Language Processing Pub Date : 2009-08-07 DOI:10.3115/1708124.1708139

Linlin Li, C. Sporleder

{"title":"一种基于聚类图的多词短语字面和非字面无监督识别方法","authors":"Linlin Li, C. Sporleder","doi":"10.3115/1708124.1708139","DOIUrl":null,"url":null,"abstract":"We present a graph-based model for representing the lexical cohesion of a discourse. In the graph structure, vertices correspond to the content words of a text and edges connecting pairs of words encode how closely the words are related semantically. We show that such a structure can be used to distinguish literal and non-literal usages of multi-word expressions.","PeriodicalId":359354,"journal":{"name":"Workshop on Graph-based Methods for Natural Language Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A Cohesion Graph Based Approach for Unsupervised Recognition of Literal and Non-literal Use of Multiword Expressions\",\"authors\":\"Linlin Li, C. Sporleder\",\"doi\":\"10.3115/1708124.1708139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a graph-based model for representing the lexical cohesion of a discourse. In the graph structure, vertices correspond to the content words of a text and edges connecting pairs of words encode how closely the words are related semantically. We show that such a structure can be used to distinguish literal and non-literal usages of multi-word expressions.\",\"PeriodicalId\":359354,\"journal\":{\"name\":\"Workshop on Graph-based Methods for Natural Language Processing\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Graph-based Methods for Natural Language Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3115/1708124.1708139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Graph-based Methods for Natural Language Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3115/1708124.1708139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

我们提出了一个基于图的模型来表示语篇的词汇衔接。在图结构中，顶点对应于文本的内容词，连接单词对的边编码单词在语义上的紧密程度。我们证明了这种结构可以用来区分多词表达式的字面和非字面用法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Cohesion Graph Based Approach for Unsupervised Recognition of Literal and Non-literal Use of Multiword Expressions

We present a graph-based model for representing the lexical cohesion of a discourse. In the graph structure, vertices correspond to the content words of a text and edges connecting pairs of words encode how closely the words are related semantically. We show that such a structure can be used to distinguish literal and non-literal usages of multi-word expressions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Workshop on Graph-based Methods for Natural Language Processing

自引率

0.00%

发文量