Results 1 
6 of
6
Parsing and hypergraphs
 In IWPT
, 2001
"... While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension o ..."
Abstract

Cited by 56 (3 self)
 Add to MetaCart
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç Ò time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as allowed by the inherent ordering of probabilistic dependencies. 1
Linear Connectivity Problems in Directed Hypergraphs
"... We introduce a notion of hyperconnection (formally denoted Lhyperpath) between nodes in a directed hypergraph and relate this notion to existing notions of hyperpaths in directed hypergraphs. We show that some interesting questions in problem domains such as secret transfer protocols and routing in ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We introduce a notion of hyperconnection (formally denoted Lhyperpath) between nodes in a directed hypergraph and relate this notion to existing notions of hyperpaths in directed hypergraphs. We show that some interesting questions in problem domains such as secret transfer protocols and routing in packet filtered networks are basically questions about the existence of Lhyperpaths in directed hypergraphs. We study the computational complexity of problems related to Lhyperpaths and the Lcyclomatic number of directed hypergraphs (the minimum number of hyperedges that need to be deleted to make a directed hypergraph free of Lhypercycles). We prove that the Lhyperpath existence problem, the Lcyclomatic number problem, the minimum Lcyclomatic set problem, and the minimal Lcyclomatic, Πp, and DP, respectively. set problem are each complete for the complexity class NP, Σ p 2 1
A remark on the definition of a Bhyperpath
, 2001
"... In this note we show that a commonly used definition of a hyperpath in a directed hypergraph is not correct. This is done by presenting a counterexample which fulfils the definition but is not a hyperpath. Keywords: Directed hypergraphs, hyperpaths, Bpaths. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note we show that a commonly used definition of a hyperpath in a directed hypergraph is not correct. This is done by presenting a counterexample which fulfils the definition but is not a hyperpath. Keywords: Directed hypergraphs, hyperpaths, Bpaths. 1
Isomorphism on Intuitionistic Fuzzy Directed Hypergraphs
, 2013
"... Directed hypergraphs are much like standard directed graphs. In intuitionistic fuzzy directed hypergraphs, like directed graphs, standard arcs connect a single tail node to a single head node, hyperarcs connect a set of tail nodes to a set of head nodes. In this paper, the isomorphism between two i ..."
Abstract
 Add to MetaCart
Directed hypergraphs are much like standard directed graphs. In intuitionistic fuzzy directed hypergraphs, like directed graphs, standard arcs connect a single tail node to a single head node, hyperarcs connect a set of tail nodes to a set of head nodes. In this paper, the isomorphism between two intuitionistic fuzzy directed hypergraphs is discussed. The condition for two intuitionistic fuzzy directed hypergraphs is isomorphic also discussed and some of its properties are also analyzed.
Modeling Collaborative Referring for Situated Referential Grounding
"... In situated dialogue, because humans and agents have mismatched capabilities of perceiving the shared physical world, referential grounding becomes difficult. Humans and agents will need to make extra efforts by collaborating with each other to mediate a shared perceptual basis and to come to a mutu ..."
Abstract
 Add to MetaCart
In situated dialogue, because humans and agents have mismatched capabilities of perceiving the shared physical world, referential grounding becomes difficult. Humans and agents will need to make extra efforts by collaborating with each other to mediate a shared perceptual basis and to come to a mutual understanding of intended referents in the environment. In this paper, we have extended our previous graphmatching based approach to explicitly incorporate collaborative referring behaviors into the referential grounding algorithm. In addition, hypergraphbased representations have been used to account for group descriptions that are likely to occur in spatial communications. Our empirical results have shown that incorporating the most prevalent pattern of collaboration with our hypergraphbased approach significantly improves reference resolution in situated dialogue by an absolute gain of over 18%. 1
ShiftReduce CCG Parsing with a Dependency Model
"... This paper presents the first dependency model for a shiftreduce CCG parser. Modelling dependencies is desirable for a number of reasons, including handling the “spurious ” ambiguity of CCG; fitting well with the theory of CCG; and optimizing for structures which are evaluated at test time. We deve ..."
Abstract
 Add to MetaCart
This paper presents the first dependency model for a shiftreduce CCG parser. Modelling dependencies is desirable for a number of reasons, including handling the “spurious ” ambiguity of CCG; fitting well with the theory of CCG; and optimizing for structures which are evaluated at test time. We develop a novel training technique using a dependency oracle, in which all derivations are hidden. A challenge arises from the fact that the oracle needs to keep track of exponentially many goldstandard derivations, which is solved by integrating a packed parse forest with the beamsearch decoder. Standard CCGBank tests show the model achieves up to 1.05 labeled Fscore improvements over three existing, competitive CCG parsing models.