Báo cáo khoa học: "Quasi-Destructive Graph Unification" potx
Báo cáo khoa học: "EXTENDED GRAPH UNIFICATION" pot
...
concise.
2
GRAPH
SPECIFICATION
We start by defining a language GSL
(graph spec-
ification language}
for describing graphs, and by
specifying the conditions under which two graphs
unify. ...
mandatory.
A graph descriptor
consists of a set of path de-
scriptors separated by commas. The graph con-
sists of the set of described paths. If two node
descriptors in a graph de...
Tài liệu Báo cáo khoa học: "A Graph-based Semi-Supervised Learning for Question-Answering" doc
... x
j
∈ X
ncp
(2)
The diagonal degree matrix D is defined for graph
g by D=
j
˜w
ij
. In general graph- based SSL, a
function over the graph is estimated such that it
satisfies two conditions: 1) ... =
i∈L∪U
w
x
i
f
i
i∈L∪U
w
x
i
(6)
Thus, we use induction, where we can, to avoid
re-construction of the graph for new test points.
4 Graph Summarization
Research on graph- based SSL a...
Tài liệu Báo cáo khoa học: "Translating a Unification Grammar with Disjunctions into Logical Constraints" pdf
... understand. Parsing with
term-based internal representations is more efficient than
parsing with graph- based representations. Therefore, it
is effective to translate unification grammar formalism ... the viewpoint
of the ways feature structures are represented: (a) those
using labeled, directed graphs (Shieber, 1984) and (b)
those using first-order terms (Pereira and Warren, 1980;
Ma...
Tài liệu Báo cáo khoa học: "Coping with Extragrarnmaticality" potx
... system, but recognizable by a combination of contextual
expectations and morphological or orthographic features
(e.g., capitalization).
In the first situation, there is no meaningful recovery
Tài liệu Báo cáo khoa học: "Talking About Trees" potx
...
ural thing to do. After all, the trees and feature
structures used in linguistics are simple graphical
objects. To put it another way, they are merely
rather simple Kripke models, and modal ... about modal
languages is that they are nothing but extremely
simple languages for talking about graphs. Unfortu-
nately, the more philosophical presentations of modal
logic tend to obscure this...
Báo cáo khoa học: "Integrating Graph-Based and Transition-Based Dependency Parsers" docx
... can
be described as either graph- based or transition-
based (McDonald and Nivre, 2007). In graph- based
parsing, we learn a model for scoring possible de-
pendency graphs for a given sentence, ... with label l in the graph. A dependency
graph G for a sentence x must be a directed tree orig-
inating out of the root node 0 and spanning all nodes
in V , as exemplified by the graph in figur...
Báo cáo khoa học: "A Graph Approach to Spelling Correction in Domain-Centric Search" doc
... fairly
straightforward) dynamic-programming algorithm.
2.2.2 Correction Graph
In the next step (line 2 in Algorithm 1), we con-
struct the correction graph, which we denote by
G
D
(s). The construction is as ... of the graph G
D
(s) is a pair w, w
, where
w is an sp-token and w
∈ top
D
(w). Recall our
simplifying assumption that a token s
[i,j)
uniquely
identifies the indices i an...
Báo cáo khoa học: "A Graph-based Cross-lingual Projection Approach for Weakly Supervised Relation Extraction" pptx
... propose a graph- based
projection approach for relation extraction.
3 Graph Construction
The most crucial factor in the success of graph-
based learning approaches is how to construct a
graph that ... direct projection.
In this paper, we propose a graph- based projec-
tion approach for weakly supervised relation extrac-
tion. This approach utilizes a graph that is con-
stucted with...
Từ khóa: