Báo cáo khoa học: "Highly constrained unification grammars" potx
Báo cáo khoa học: "Highly constrained unification grammars" potx
... bound
with respect to subsumption is unification, de-
noted ‘’. Unification is partial; when A B is
undefined we say that the unification fails and de-
note it as A B = . Unification is lifted to MRSs:
given ... unification grammars which
dramatically limit their expressivity. We prove
that non-reentrant unification grammars generate
exactly the class of context-free languages; and
t...
Tài liệu Báo cáo khoa học: "Hierarchical Text Classification with Latent Concepts" doc
... learning algorithm,
which aims to find the new weight vector w
t+1
to be
the solution to the following constrained optimiza-
tion problem in round t.
w
t+1
= arg min
w∈R
n
1
2
||w − w
t
||
2
+ Cξ
s.t.
Từ khóa: