Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (23)

1Representation Of Feature Systems In A NonConnectionist Molecular Machine1987  Laselo Kalmanof information stored in the molecules, i.e. it is a directed graph representing a substructure of molecules with their...

2Dependency Parsing with Undirected Graphswn be an input string. A dependency graph for w is a directed graph G = (Vw, E), where Vw = {0, . . . , n} is the set of...

3A Model For Preferencewil l be partial. In general the outcome will be a directed graph. There are three ways of tackl ing this problem: The...

4Online Learning of Approximate Dependency Parsing Algorithms2006  Ryan McDonald,Fernando Pereiramodel headdependent syntactic relations as edges in a directed graph. Figure 1 displays a dependency representation for the...

5ElectionWatch: Detecting Patterns in News Coverage of US Electionsthe political discourse. The Endorsement Network is a directed graph. To perform its partitioning we first omit directionality...

6How to Parse Gaps in Spoken Utterances1983  G. Goerz,C. Becksteinstore intermediary results, which is represented as a directed graph, and makes it into an active parsing agent. Initially...

7Cooperative Error Handling and Shallow Processing1995  Tanya Bowdenover a character trie which has been compressed into a (directed) graph. Common endings are shared and category information...

8Constraints on NonProjective Dependency Parsing2006  Joakim Nivre2 Dependency Graphs A dependency graph is a labeled directed graph, the nodes of which are indices corresponding to the...

9Cube Summing, Approximate Inference with NonLocal Features, and Dynamic Programming without Semirings2009  Kevin Gimpel,Noah A. Smithgeneralize Goodman’s algorithm, we suggest using the directedgraph data structure known variously as an arithmetic circuit...

10Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument Satisfaction Modelthe minimum spanning tree (MST) problem. We define a directed graph (digraph) in a standard way, G = (V,E) where V is a set...