Chinese Learning of Semantical Selectional Preferences Based on LSC Model and Expectation Maximization Algorithm

نویسندگان

  • Dongming Li
  • Lijuan Zhang
  • Mingquan Wang
  • Wei Su
چکیده

Aiming at the situation of current Chinese language resources shortage ,this paper proposes semantically selectional preferences of unsupervised learning method, and presents a strategy of obtaining verbnoun semantic collocation in Chinese. An approach of Chinese semantic preference learning, which is based on Latent Semantic Clustering model and Expectation Maximization Algorithm. First, the parameters are initialized randomly. Second, a certain number of training iterations is performed until convergence. Each iteration consists of expectation step and maximization step. Finally, the semantic association between verbs and nouns are calculated as a measure of its matching probability. This method can be used on Chinese without syntax-annotated corpora. Lots of experiment results show that LSC provides proper patterns of verb-noun collocation semantically. The algorithm converges quickly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining EM Training and the MDL Principle for an Automatic Verb Classification Incorporating Selectional Preferences

This paper presents an innovative, complex approach to semantic verb classification that relies on selectional preferences as verb properties. The probabilistic verb class model underlying the semantic classes is trained by a combination of the EM algorithm and the MDL principle, providing soft clusters with two dimensions (verb senses and subcategorisation frames with selectional preferences) ...

متن کامل

An Evaluation of Predicate Argument Clustering using Pseudo-Disambiguation

Schulte im Walde et al. (2008) presented a novel approach to semantic verb classication. The predicate argument model (PAC) presented in their paper models selectional preferences by using soft clustering that incorporates the Expectation Maximization (EM) algorithm and the MDL principle. In this paper, I will show how the model handles the task of differentiating between plausible and implausi...

متن کامل

The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways

The performance of many traffic control strategies depends on how much the traffic flow models have been accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive ...

متن کامل

Learning from Pairwise Preference Data using Gaussian Mixture Model

In this paper we propose a fast online preference learning algorithm capable of utilizing incomplete preference information. It is based on a Gaussian mixture model that learns soft pairwise label preferences via minimization of the proposed soft rank loss measure. Standard supervised learning techniques, such as gradient descent or Expectation Maximization can be used to find the unknown model...

متن کامل

Integrating selectional preferences in WordNet

Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This paper extends previous statistical models to class-to-class preferences, and presents a model that learns selectional preferences for classes of verbs, together with an algorithm to integrate the learned preferences in WordNet. The theoretical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012