基于WordNet的无导词义消歧方法

有导词义消歧机器学习方法由于需要大量人力进行词义标注,难以适用于大规模词义消歧任务.提出一种避免人工词义标注的无导消歧方法.该方法综合利用WordNet知识库中的多种知识源（包括：词义定义描述、使用实例、结构化语义关系、领域属性等）描述歧义词的词义信息,生成词义的“代表词汇集”和“领域代表词汇集”,结合词汇的词频分布信息和所处的上下文环境进行词义判定.利用通用测试集Senseval 3对6个典型的无导词义消歧方法进行开放实验,该方法取得平均正确率为49.93％的消歧结果.     

民航领域突发事件的实体链接方法

实体链接的相关研究主要集中于医疗、生物和新闻领域,但在民航领域的研究较少。因此针对民航领域实体链接任务进行了研究,发现在实体链接中存在实体变体多、歧义少等问题。为解决上述问题,提出了一种基于语义推断的实体链接框架以及一种用于增强框架鲁棒性的负采样策略。在民航领域数据集上进行了对比实验,结果表明所提框架链接效果优于现有基准框架,并通过消融实验,验证了负采样策略的有效性。在负采样策略的作用下,该实体链接框架的Acc@top1高达0.875。     

基于特征选择和最大熵模型的汉语词义消歧

词义消歧是自然语言处理中一类典型的分类问题.在分类中,特征的选择至关重要.通常情况下,特征是由人工选择的,这就要求特征选取者对于待分类的问题本身和分类模型的特点有深刻的认识.分析了汉语词义消岐中特征模板对消歧结果的影响,在此基础上提出一套基于最大熵分类模型的自动特征选择方法,包括针对所有歧义词的统一特征模板选择和针对单个歧义词的独立特征模板优化算法.实验结果表明,使用自动选择的特征,不仅简化了特征模板,而且提高了汉语词义消歧的性能.与SemEval 2007:task #5的最好成绩相比,该方法分别在微平均值MicroAve(micro-average accuracy）)和宏平均值MacroAve(macro-average accuracy）)上提升了3.10%和2.96%.     

基于词分布式表征的汉语框架排歧模型

框架排歧是根据句子中目标词的上下文语境,从框架库中为该目标词自动选择一个合适的框架。该任务在一定程度上解决了动词中一词多义的现象。该文基于词语及句子的分布式表征,提出了基于距离和基于词语相似度矩阵的框架排歧模型。与传统方法相比,该模型有效避免了人工选择特征,克服了特征空间维度过高、特征之间没有关联性等缺点,使框架排歧的准确率达到65.71%。并与当前最好的模型,进行显著性和一致性检验,进一步验证了词分布式表征对框架排歧任务的有效性。     

ROMANSEVAL: Results for Italian by SENSE

The paper describes SENSE, a word sense disambiguation system thatmakes use of different types of cues to infer the most likelysense of a word given its context. Architecture and functioning ofthe system are briefly illustrated. Results are given for theROMANSEVAL Italian test corpus of verbs.     

Using Semantic Classification Trees for WSD

This paper describes the evaluation of a WSD method withinSENSEVAL. This method is based on Semantic Classification Trees (SCTs)and short context dependencies between nouns and verbs. The trainingprocedure creates a binary tree for each word to be disambiguated. SCTsare easy to implement and yield some promising results. The integrationof linguistic knowledge could lead to substantial improvement.     

Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking

A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with parser generators provide different approaches for defining operator precedence. Some generators (e.g. YACC) support precedence declarations, others require the grammar to be unambiguous, thus encoding the precedence rules. Even if the grammar formalism provides precedence rules, a particular grammar might not use it. The result is grammar variants implementing the same language. For the C language, the GNU Compiler uses YACC with precedence rules, the C-Transformers uses SDF without priorities, while the SDF library does use priorities. For PHP, Zend uses YACC with precedence rules, whereas PHP-front uses SDF with priority and associativity declarations.The variance between grammars raises the question if the precedence rules of one grammar are compatible with those of another. This is usually not obvious, since some languages have complex precedence rules. Also, for some parser generators the semantics of precedence rules is defined operationally, which makes it hard to reason about their effect on the defined language. We present a method and tool for comparing the precedence rules of different grammars and parser generators. Although it is undecidable whether two grammars define the same language, this tool provides support for comparing and recovering precedence rules, which is especially useful for reliable migration of a grammar from one grammar formalism to another. We evaluate our method by the application to non-trivial mainstream programming languages, such as PHP and C.     

Disambiguation of partial cognates

Partial cognates are pairs of words in two languages that have the same meaning in some, but not all contexts. Detecting the actual meaning of a partial cognate in context can be useful for Machine Translation tools and for Computer-Assisted Language Learning tools. We propose a supervised and a semi-supervised method to disambiguate partial cognates between two languages: French and English. The methods use only automatically-labeled data; therefore they can be applied to other pairs of languages as well. The aim of our work is to automatically detect the meaning of a French partial cognate word in a specific context.

中文问句分类特征的研究

针对"不同的问句分类特征对问句分类的影响不相同,提取和处理这些特征的时间复杂度也不相同"的问题,提取问题疑问词、核心关键词(疑问词的一二级依存词和问句中心语)的主要义原、核心关键词的首义原、问句主谓宾的主要义原、命名实体、名词单(复)数等六种分类特征,采用支持向量机分类算法,对事实疑问句进行不同特征组合的分类对比实验,发现采用词义消岐技术提取的主要义原不仅对分类的准确率影响明显,而且大幅降低特征向量的维数,减少了处理时间。     

语义网络结构下的词义消歧

提出了一种基于语义网络结构的词义消歧方法。将文本片段中出现词的所有词义都看作节点，将两个词的任意两个词义之间的语义关系看作弧，将语义关系的紧密程度看作弧的权重，从而构成一个无向赋权网络；将Google的网页分级（PageRank）算法应用到无向赋权图中，评价网络中节点的重要性，并结合共指词义和词义的常用程度，对文本中出现的名词进行消歧。实验证明了该方法对文本进行词义消歧是有效的。