... efficient parallel system
for processing Typed Feature Structures (TFSs)
on shared- memory parallel machines. We call
the system Parallel Substrate for TFS (PSTFS}.
PSTFS is designed for parallel ... An Efficient Parallel Substrate for Typed Feature Structures on
Shared Memory Parallel Machines
NINOMIYA Takashi t, TORISAWA Kentaro t and TS...
... respect.
The monotonicity constraints, on the other hand,
might constitute a dilution of the Shake-and-Bake
ideal of independent grammars. For instance, prece-
dence monotonicity requires ...
derivation
information
itself is not used to assist the algorithm. Even in
(Beaven, 1992a), the derivation information is used
simply to cache previous results to avoid exact re-
computatio...
... the Association for Computational Linguistics, pages 19–24,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
NiuTrans: An Open Source Toolkit for
Phrase-based ... implementation of
minimum error rate training that allows for various
evaluation metrics for tuning the system. In
addition, the toolkit provides easy-to-use APIs for
the de...
... the
mention-pair model has a limitation that informa-
tion beyond mention pairs is ignored for training and
testing. As an individual mention usually lacks ad-
equate descriptive information of ... mention that
is classified as positive (if any) with the highest con-
fidence value.
3.2 Entity-Mention Model
The mention-based solution has a limitation that in-
formation beyond a mention pair .....
... corresponding extensions
for context-free LR parsing.
Section 2 discusses our notation. The algo-
rithm for constructing the LR table is given in
Section 3, and the automaton that operates on
these ... very close to traditional LR parsing
for context-free grammars. The construction of
derived trees and the computation of features
also become straightforward.
1 Introduction
The...
...
ification in an LFG framework; that consists of context-
free grammar rules augmented with feature bundles
that are associated with the non-terminals of the rules.
Feature structure computation ... which is common in spontaneous speech.
The GLR* parser has a capability for handling com-
mon word substitutions when the parser's input string
is the output of a speech recognitio...
... it ideal for the mediation of drug binding
site reorientation, although the binding data cannot
unequivocally inform on the orientation of the sites,
only their affinity for interaction with drugs.
The ... through the obser-
vations that nucleotide binding in the absence of
hydrolysis could cause the conformational alteration
(reviewed in [27,28]). The low-affinity conformation of
drug bi...
... both
directions to exclude any mutations. The confirmed
RPE65c cDNA was cloned into a pcDNA3.1()) expression
vector. After sequence confirmation, the expression con-
structs were purified by a QIAfilter ... serum
(dilution 1 : 1000) (Santa Cruz, Santa Cruz, CA, USA). The
secondary antibodies were: donkey anti-(goat IgG) conju-
gated with DyLight 488; donkey anti-(mouse IgG) conju-
gated with DyLi...
... function. Whereas the concen-
tration of LF required to kill 50% of the cells (EC50)
was estimated to be 4 · 10
)11
m, LF-K518E ⁄ E682G
did not cause enough cell death under these conditions
for ... MAPKs.
Interestingly, increasing the LF concentration from
10
)11
m to 10
)10
m had a considerable effect on cell
viability, but relatively minor effects on the phosphory-
lation of the MAPK...
... still allowed for autoinhibition, suggesting that
this function is not dependent on a specific AD, and
supporting the notion that it may function for all Meis
paralogs. Coexpression of Pbx1a was ... HTH
functions could be performed by both isoforms,
although for antenna development only full-length
HTH was sufficient. It may therefore be that Meis2e-
like proteins are functional for s...