GPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
نویسندگان
چکیده
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semantic Model (GPSM) is proposed for preference computation. An effective semantic tagging procedure is proposed for tagging semantic features. A semantic score function is derived based on a score function, which integrates lexical, syntactic and semantic preference under a uniform formulation. The semantic score measure shows substantial improvement in structural disambiguation over a syntax-based approach.
منابع مشابه
Semantic Priming Effect on Relative Clause Attachment Ambiguity Resolution in L2
This study examined whether processing ambiguous sentences containing relative clauses (RCs) following a complex determiner phrase (DP) by Persian-speaking learners of L2 English with different proficiency and working memory capacities (WMCs) is affected by semantic priming. The semantic relationship studied was one between the subject/verb of the main clause and one of the DPs in the complex D...
متن کاملDiscrimination of Power Quality Distorted Signals Based on Time-frequency Analysis and Probabilistic Neural Network
Recognition and classification of Power Quality Distorted Signals (PQDSs) in power systems is an essential duty. One of the noteworthy issues in Power Quality Analysis (PQA) is identification of distorted signals using an efficient scheme. This paper recommends a Time–Frequency Analysis (TFA), for extracting features, so-called "hybrid approach", using incorporation of Multi Resolution Analysis...
متن کاملGeneralized Problem-Solving Methods
Problem-Solving Methods (PSMs) describe the dynamic reasoning behaviour of a knowledge-based system independent from a certain domain and application. Evidently, the reuse of PSMs across different domains or applications is a challenging issue. The investigation presented in this paper was directed by the hypotheses that a library of PSMs should be essentially more than just a juxtaposition of ...
متن کاملGaussian Processes Semantic Map Representation
In this paper, we develop a high-dimensional map building technique that incorporates raw pixelated semantic measurements into the map representation. The proposed technique uses Gaussian Processes (GPs) multi-class classification for map inference and is the natural extension of GP occupancy maps from binary to multi-class form. The technique exploits the continuous property of GPs and, as a r...
متن کاملGraded Poisson-Sigma Models and Dilaton-Deformed 2D Supergravity Algebra
Fermionic extensions of generic 2d gravity theories obtained from the graded Poisson-Sigma model (gPSM) approach show a large degree of ambiguity. In addition, obstructions may reduce the allowed range of fields as given by the bosonic theory, or even prohibit any extension in certain cases. In our present work we relate the finite W-algebras inherent in the gPSM algebra of constraints to algeb...
متن کامل