[PDF] Top 20 El panorama del acceso abierto en Cuba: Estrategias y modelo para su desarrollo

... UNIFYING DISJUNCTIVE FEATURE STRUCTURES U N I F Y I N G DISJUNCTIVE FEATURE S T R U C T U R E S L E N A S ' F R O M B A C K Deparlment of Coinputer ,and htforntatiol~ Science Link0ping University S 58[.] ... See full document

... Further, first-order logic can be used to axiomatize other types of feature structures in addition to attribute-value structures such as "set-valued" elements and express a wider variety[r] ... See full document

... The framework we have described also serves to highlight a number of important links to the liter- ature on structure learning of directed acyclic graphical (DAG) models (Korb, 2011). The problem of DAG learning from ... See full document

... Suppose k best index paths have already been cal- culated. Given an index path π , let σ be the type of the node reached by following π in the query. An element of D that is unifiable with the query must have a node that ... See full document

... this grammar contains a large number several hundred of disjunctions, it has been necessary to extend the unification procedure so that it handles disjunctive values containing non-local[r] ... See full document

... DISJUNCTIVE FEATURE STRUCTURES AS HYPERGRAPHS D I S J U N C T I V E F E A T U R E S T R U C T U R E S A S H Y P E R G R A P H S JEAN V~RONIS Groupe Reprdsentation et Traitement des Connaissances, Cent[.] ... See full document

... Abstract This paper proposes a method for packing feature structures, which automatically collapses equivalent parts of lexical/phrasal feature structures of HPSG into a single packed fe[r] ... See full document

... JAUNT A Constraint Solver for Disjunctive Feature Structures J A U N T A C o n s t r a i n t S o l v e r for D i s j u n c t i v e F e a t u r e S t r u c t u r e s H i r o s h i M a r u y a m a I B M[.] ... See full document

... (2) Four basic strands--foundations: inquiry and understanding; creative expression; historical and cultural relevance; and critical evaluation and response--provide broad, unifying structures for ... See full document

... The disjunctive constraint can be generalized to handle constraints of types (1) and (3) when the number of possible states for the resource is ...redundant disjunctive constraint in these cases, as the ... See full document

... Type inference is applied off-line, before the grammar is used for parsing. As is the case with other off-line applications, efficiency is not a critical issue. It is worth noting, however, that for the grammar we ... See full document

... The appropriateness measure of label expression is a basal concept in uncertainty modelling based on label semantics theory for dealing with vague concepts. In the paper, the concept of dis- junctive normal forms is ... See full document

... 1986 "A logical semantics for feature structures." In Proceedings, 24th Annual Meeting of the Association for Computational Linguistics.. Dowty, Lauri Karttunen, and Arnold M.[r] ... See full document

... 2.2 (DisA) as parallel to the disjunctive conception of appearances. The point so far, of (DisA), has been to show that, unless it is to be ruled out that people act for (F)-type reasons, it has to be allowed that ... See full document

... Feature Structures Based Tree Adjoining Grammars Feature Structures Based Tree Adjoining Grammars 1 K Vijay Shanker Department of Computer and Information Sciences University of Delaware Newark, DE 19[.] ... See full document

... A TREATMENT OF NEGATIVE DESCRIPTIONS OF TYPED FEATURE STRUCTURES A T R E A T M E N T O F N E G A T I V E D E S C R I P T I O N S O F T Y P E D F E A T U R E S T R U C T U R E S K I Y O S H I K O G U R[.] ... See full document

... closure feature not as a binary-valued feature—that is either ‘on’ or ‘o ff ’—but rather as a continuous-valued feature—with values, say, between 0 and ... See full document

... probabilistic disjunctive description logic program (or sim- ply probabilistic dl-program) KB = (L, P, C, µ) consists of a disjunctive dl-program (L, P ), a choice space C such that no atomic choice in C ... See full document

... The goal of semantic parsing is to generate all se- mantic relationships in a text. Its output is of- ten represented by whole-sentence semantic struc- tures. Evaluating such structures is necessary for semantic ... See full document

... (2) Four basic strands--foundations: inquiry and understanding; creative expression; historical and cultural relevance; and critical evaluation and response--provide broad, unifying structures for ... See full document