arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.07709cs.CLcs.LGstat.ML
收藏

词表示、树模型与句法功能

Word Representations, Tree Models and Syntactic Functions

University of Groningen(格罗宁根大学);University of Amsterdam(阿姆斯特丹大学)

Simon Šuster, Gertjan van Noord, Ivan Titov

摘要:

从具有离散潜变量的模型(例如,阻碍)已被证明在许多NLP应用中是有益的。在这项工作中,我们利用标记的句法依赖树和形式化的归纳问题的树结构的隐马尔可夫模型的无监督学习。句法功能被用作模型中的额外观察变量,影响过渡和发射组件。这样的句法信息可能会导致捕获单词之间更细粒度和功能的区别,这反过来可能是许多NLP应用程序所期望的。我们评估了两个任务的词表示--命名实体识别和语义框架识别。在这两种情况下,我们观察到利用句法功能信息的改进,以及与最先进的表示学习方法相媲美的结果。此外,我们重新审视了顺序和未标记树模型之间的关系,发现后者的优势并不是不言而喻的。

英文摘要:

Word representations induced from models with discrete latent variables (e.g.\ HMMs) have been shown to be beneficial in many NLP applications. In this work, we exploit labeled syntactic dependency trees and formalize the induction problem as unsupervised learning of tree-structured hidden Markov models. Syntactic functions are used as additional observed variables in the model, influencing both transition and emission components. Such syntactic information can potentially lead to capturing more fine-grain and functional distinctions between words, which, in turn, may be desirable in many NLP applications. We evaluate the word representations on two tasks -- named entity recognition and semantic frame identification. We observe improvements from exploiting syntactic function information in both cases, and the results rivaling those of state-of-the-art representation learning methods. Additionally, we revisit the relationship between sequential and unlabeled-tree models and find that the advantage of the latter is not self-evident.

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

↑