منابع مشابه
On maximum spanning DAG algorithms for semantic DAG parsing
Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for the decoding task in semantic parsing, not to mention an explicit proof of its complexity (and its approximability). In this paper, we conside...
متن کاملDAG Automata for Meaning Representation
Languages of directed acyclic graphs (DAGs) are of interest in Natural Language Processing because they can be used to capture the structure of semantic graphs like those of Abstract Meaning Representation. This paper gives an overview of recent results on a family of automata recognizing such DAG languages.
متن کاملUsing Entropy Estimates for DAG-Based Ontologies
Motivation: Entropy measurements on hierarchical structures have been used in methods for information retrieval and natural language modeling. Here we explore its application to semantic similarity. By finding shared ontology terms, semantic similarity can be established between annotated genes. A common procedure for establishing semantic similarity is to calculate the descriptiveness (informa...
متن کاملOn Parameter Priors for Discrete DAG Models
We investigate parameter priors for discrete DAG models. It was shown in previous works that a Dirichlet prior on the parameters of a discrete DAG model is inevitable assuming global and local parameter independence for all possible complete DAG structures. A similar result for Gaussian DAG models hinted that the assumption of local independence may be redundant. Herein, we prove that the local...
متن کاملA Runtime System for Dynamic DAG Programming
A runtime system is described here for dynamic DAG execution. A large DAG which represents an application program can be executed on a parallel system without consuming large amount of memory space. A DAG scheduling algorithm has been parallelized to scale to large systems. Inaccurate estimation of task execution time and communication time can be tolerated. Implementation of this parallel incr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: rus & avhengighet
سال: 2004
ISSN: 0809-2834
DOI: 10.18261/issn0809-2834-2004-02-13