Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
1992, Computers & Mathematics with Applications
The paper discusses the origins and structure of Preference Semantics, a procedural and computational system for extracting the meaning structure of natural language texts, based on notions of "maximal semantic density" and coherence. The basic representational structures and procedures of Preference Semantics are described, as well as the forms these notions have taken in the work of others.
Erkenntnis, 1989
A possible world semantics for preference is developed. The remainder operator (_1.) is used to give precision to the notion that two states of the world are as similar as possible, given a specified difference between them. A general structure is introduced for preference relations between states of affairs, and three types of such preference relations are defined. It is argued that one of them, "actual preference", corresponds closely to the concept of preference in informal discourse. Its logical properties are studied and shown to be plausible.
Scientific and Technical Information Processing, 2020
This paper discusses the basic aspects of the modern understanding of semantic computations, semantic technologies, and semantic applications in the field of artificial intelligence. The basic terminology accepted in the work is introduced and specific examples of semantic applications, including industrial-level ones, are given. The paper demonstrates that the basic components of semantic technologies of artificial intelligence are ontologies and semantic models of their use, semantic resources, and the semantic component of the technology. The semantic resources contain information about the semantics of words and other entities, as well as means of refinement of these semantics. The semantic component is used to create formal descriptions of the meanings of natural language entities and numerically evaluate their pairwise semantic similarity. The available semantic resources are discussed and a comparative analysis of them is given. Information on natural language entity types (primitives) is given and then used for the practical purposes of building models of formal description of the meaning of texts in various semantic applications. The latter components of description of text semantics constitute the contents of the second part of this paper.
Computer Languages, 1998
Preference logic grammars (PLGs) are introduced in this paper as a declarative means of resolving ambiguity in logic grammars. Preference logic grammars can be thought as extensions of de nite clause grammars (DCGs) and de nite-clause translation grammars (DCTGs). Just as DCGs and DCTGs can be directly translated into logic programs, PLGs can be translated into preference logic programs (PLPs), which we introduced in our earlier work. We discuss two applications of PLGs, optimal parsing and ambiguity resolution in programming-language and natural-language grammars. Optimal parsing is an extension of parsing wherein costs are associated with the di erent (ambiguous) parses of a string and the preferred parse is the one with least cost. Many problems can be viewed as optimal parsing problems, e.g., code generation, document layout, etc. In the area of natural language parsing, we illustrate the use of preference clauses for resolution of prepositional phrase attachment ambiguities.
2020
First things first: What kind of book is this? Well, this is a textbook, an introduction to linguistic semantics; but it is an advanced introduction to the field, and it requires a certain degree of application on the part of the reader. (However, as we shall see, it is structured in a way that makes it easier to navigate than it might seem at first.) Apart from this, the book has the following two main "distinctive features": • It adopts a view of semantics as a component, or module, of the linguistic system, whose functioning is simulated by a corresponding linguistic model. Language is considered to be a set of rules that establish correspondences between meanings and their possible expressions, and the lion's share of this correspondence is taken care of by the semantic module. This is the approach put forward by the Meaning-Text linguistic theory and its language models, called, predictably, Meaning-Text models. • It is organized around a system of rigorous notions, specified by about eighty mathematical-like definitions. (Some of the notions that will be introduced are semanteme, semantic actant, communicative dominance, lexical function.) This system is deductive, consistent and formal; therefore, our exposition is also deductive and (strives to be) logically consistent. Four salient characteristics of the Meaning-Text approach, reflected in the way the present textbook is organized, need to be mentioned.
2010
This paper examines the framework of preference structures for the general treatment of information. First some fuzzy preference structures are introduced and then, by means of ambiguity and coherence measures, certain attributes of information can be explicitly identified and studied. This investigation is also relevant for a general discussion on fuzzy preference semantics.
International Journal on Advanced Science, Engineering and Information Technology, 2017
Canonical form is a notion stating that related idea should have the same meaning representation. It is a notion that greatly simplifies the task by dealing with a single meaning representation for a wide range of expression. The issue in text representation is to generate a formal approach of capturing meaning or semantics in sentences. This issue includes heterogeneity and inconsistency in the text. Polysemous, synonymous, morphemes and homonymous word pose serious drawbacks when trying to capture senses in sentences. This calls for a need to capture and represent senses in order to resolve vagueness and improve understanding of senses in documents for knowledge creation purposes. We introduce a simple and straightforward method to capture the canonical form of sentences. The proposed method first identifies the canonical forms using the Word Sense Disambiguation (WSD) technique and later applies the First Order Predicate Logic (FOPL) scheme to represent the identified canonical forms. We adopted two algorithms in WSD, which are Lesk and Selectional Preference Restriction. These algorithms concentrate mainly on disambiguating senses in words, phrases, and sentences. In addition, we adopted the First Order Predicate Logic scheme to analyse argument predicate in sentences, employing the consequence logic theorem to test for satisfiability, validity, and completeness of information in sentences.
Lecture Notes in Computer Science, 2015
In [13] the authors developed a logical system based on the definition of a new non-classical connective ⊗ originally capturing the notion of reparative obligation. The operator ⊗ and the system were proved to be appropriate for rather handling well-known contrary-to-duty paradoxes. Later on, a suitable modeltheoretic possible-world semantics has been developed [4, 5]. In this paper we show how a version of this semantics can be used to develop a sound and complete logic of preference and offer a suitable possible-world semantics. The semantics is a sequence-based non-normal one extending and generalising semantics for classical modal logics.
2020
Today’s natural language processing system cause loss of information due to the approximation processes. The applied methods, based on Aristotle’ s binary logic usually cannot take the semantics into account in processing a language.In this paper, we tried to use an approach to analyze a set of terms given in a natural language and overcome some problems of processing. Keywords— Semantic meaning, human, linguistic, beauty, machine understanding, lexicalization, content determination.
This paper summarizes the architecture of Lexical Resource Semantics (LRS). It demonstrates how to encode the language of two-sorted theory (Ty2; in typed feature logic (TFL), and then presents a formal constraint language that can be used to extend conventional description logics for TFL to make direct reference to Ty2 terms. A reduction of this extension to Constraint Handling Rules (CHR; Frühwirth and Abdennadher, 1997) for the purposes of implementation is also presented.
Preference relations are intensively studied in Economics, but they are also approached in AI, Knowledge Representation, and Conceptual Modelling, as they provide a key concept in a variety of domains of application. In this paper, we propose an ontological foundation of preference relations to formalise their essential aspects across domains. Firstly, we shall discuss what is the ontological status of the relata of a preference relation. Secondly, we investigate the place of preference relations within a rich taxonomy of relations (e.g. we ask whether they are internal or external, essential or contingent, descriptive or non-descriptive relations). Finally, we provide an ontological modelling of preference relation as a module of a foundational (or upper) ontology (viz. OntoUML). The aim of this paper is to provide a sharable foundational theory of preference relation that foster interoperability across the heterogeneous domains of application of preference relations.
1973
5«Ttiriiv ' i.ii .S!H-ati.?n oi title, body ot *b*tf*'i tttifi indrKintf wtnofüfJon muaf be ant*r*d &h*n f/'^yvffr«'/ rrport '* r!m*sifi*di i "OWTGIN* rtNü AC TtVtTV fCorportt« »uthor) im. «E^on T SCCUHtTV CLAS "FtCATfON
Proceedings of the third conference on European chapter of the Association for Computational Linguistics -, 1987
In this paper we address the problem of choosing the best solution(s) from a set of interpretations of the same object (in our case a segment of text). A notion of preference is stated, based on pairwise comparisons of complete interpretations in order to obtain a partial order among the competing interpretations. An experimental implementation is described, which uses Prolog-like preference statements.
Commonsense, 2009
Representing preferences and reasoning about them are important issues for many real-life applications. Several monotonic and non-monotonic qualitative formalisms have been developed for this purpose. Most of them are based on comparative preferences, for ...
Research on Language and Computation, 2004
This article argues that definite NPs are interpreted depending on contextual salience, rather than on the uniqueness condition of their descriptive content. The salience structure is semantically reconstructed by a global choice function that assigns to each set one (most salient) element. It is dynamically modified by the context change potential of indefinite and definite NPs. The anaphoric potential of definite NPs can be accounted for by the interaction of the context change potential and contextual salience structure.
2004
ABSTRACT One of the most important topics in modern multimedia research is the treatment of documents and users at a semantic level. In this framework, the automated extraction of semantic preferences from multimedia content is an important problem.
Language Resources and Evaluation, 2004
This paper presents implemented algorithms for interpreting the meaning of certain context-dependent lexical items within the Ontological Semantic text processing environment. We discuss the form, function and rationale behind three meaning procedures, all of which are, in a certain sense, numerically oriented. We show that only a knowledge-rich processing system can fully interpret such entities, and that an integrated combination of static resources and processors provides sufficient foundation for high-quality text interpretation.
odur.let.rug.nl
This paper recommends an approach to the implementation of semantic representation languages (SRLs) which exploits a parallelism between SRLs and programming languages (PLs). The design requirements of SRLs for natural language are similar to those of PLs in their goals. First, in both cases we seek modules in which both the surface representation (print form) and the underlying data structures are important. This requirement highlights the need for general tools allowing the printing and reading of ...
Studies in Language, 2015
Artificial Intelligence, 2002
The addition of preferences to normal logic programs is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A 1 is preferred to that of an atom A 2 , a preference rule can be defined so that A 2 is derived only if A 1 is not. Although such situations can be modelled directly using default negation, it is often easier to define preference rules than it is to add negation to the bodies of rules. As first noted in [6], for certain grammars, it may be easier to disambiguate parses using preferences than by enforcing disambiguation in the grammar rules themselves. In this paper we define a general fixed-point semantics for preference logic programs based on an embedding into the well-founded semantics, and discuss its features and relation to previous preference logic semantics. We then study how preference logic grammars are used in data standardization, the commercially important process of extracting useful information from poorly structured textual data. This process includes correcting misspellings and truncations that occur in data, extraction of relevant information via parsing, and correcting inconsistencies in the extracted information. The declarativity of Prolog offers natural advantages for data standardization, and a commercial standardizer has been implemented using Prolog. However, we show that the use of preference logic grammars allow construction of a much more powerful and declarative commercial standardizer, and discuss in detail how the use of the non-monotonic construct of preferences leads to improved commercial software.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.