arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0307055cs.LGcs.CLcs.IR
收藏

学习类比和语义关系

Learning Analogies and Semantic Relations

Peter D. Turney, Michael L. Littman

摘要:

本文提出了一种基于信息检索的向量空间模型(VSM)的无标记文本学习算法,该算法可以解决学术能力倾向测验(SAT)中的语言类比问题。动词类比的形式为A:B::C:D,意思是“A对B就像C对D一样”;例如,mason:stone::carpenter:wood。SAT类比题提供了一个单词对A:B,问题是从五个选项中选择最相似的单词对C:D。VSM算法正确回答了374个大学水平类比问题中的47%(随机猜测将产生20%的正确率)。我们将其与认知科学和语言学的工作联系起来,并将其应用于自然语言处理中的一个难题,确定名词修饰语对中的语义关系,从而激发了这项研究。问题是根据名词(printer)和修饰语(laser)之间的语义关系,对名词-修饰语对(如“激光打印机“)进行分类。我们使用一个有监督的最近邻算法,通过在训练数据中找到最相似的名词修饰语对来为给定的名词修饰语对分配一个类。对于30类语义关系,在600个标记的名词修饰语对的集合上,学习算法获得了26.5%的F值(随机猜测:3.3%)。在5类语义关系下,F值为43.2%(随机:20%)。对于这些具有挑战性的问题,性能是最先进的。

英文摘要:

We present an algorithm for learning from unlabeled text, based on the Vector Space Model (VSM) of information retrieval, that can solve verbal analogy questions of the kind found in the Scholastic Aptitude Test (SAT). A verbal analogy has the form A:B::C:D, meaning "A is to B as C is to D"; for example, mason:stone::carpenter:wood. SAT analogy questions provide a word pair, A:B, and the problem is to select the most analogous word pair, C:D, from a set of five choices. The VSM algorithm correctly answers 47% of a collection of 374 college-level analogy questions (random guessing would yield 20% correct). We motivate this research by relating it to work in cognitive science and linguistics, and by applying it to a difficult problem in natural language processing, determining semantic relations in noun-modifier pairs. The problem is to classify a noun-modifier pair, such as "laser printer", according to the semantic relation between the noun (printer) and the modifier (laser). We use a supervised nearest-neighbour algorithm that assigns a class to a given noun-modifier pair by finding the most analogous noun-modifier pair in the training data. With 30 classes of semantic relations, on a collection of 600 labeled noun-modifier pairs, the learning algorithm attains an F value of 26.5% (random guessing: 3.3%). With 5 classes of semantic relations, the F value is 43.2% (random: 20%). The performance is state-of-the-art for these challenging problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑