... strategies in a transparent
way. We discuss which features have been
incorporated into the parser in order to
process speech data, in particular the abi-
lity to perform direction independent ...
land parsing, to handle gaps in the utter-
ance and its hypothesis scoring scheme.
I. GLP, A GENERAL LINGUISTIC PROCESSOR
GLP (Goerz 1981, 1982a,b) is a multi-
strategy chart...
... participating
Table 1. Amino acid frequencies (%) in a-amylase linkers, in a set
of globular proteins, in the Swiss-Prot databank and in intrinsically
unstructured proteins.
Amino
acid Linkers
a
Globular
proteins
b
Swiss-Prot
c
Intrinsically
unstructured
proteins
b
Ala ... are expected to behave as a spring, allowing
the nanomachine (catalytic domain–linker–binding
module) to craw...
... two corresponding trees
containing terminal and nonterminal symbols. In
addition, the nonterminals in the two replacement
trees are linked, which creates new linked nontermi-
nals to which further ... constructed in linear time, which in turn
yields a particular MBOT in linear time.
Finally, we want to relate LMBOT to the STSSG
of Sun et al. (2009). To this end, we also intr...
... "Transforming a Parsed
Corpus into a Corpus Parser", to appear in Proceedings of
the 1987 ICAME 8th International Conference on English
Language Research on Computerised Corpora, Helsinki,
Finland ... to be done to engineer a generally-acceptable
commercial product. We are cun-ently looking for sponsors
and collaborators for this research: anyone interested in
devel...
... de-
termining how close together these words are.
We suppose that if the words of the window are
strongly connected in the network, they belong
to the same domain and so, the cohesion in this ...
not very much linked together, we assume that
the words of the window belong to two different
domains. It means that the window is located
across the transition from one topic to ano...
... Tomita parser,
which is able to handle general context-free grammars,
including cyclic ones.
4 Extension to RTN's
In the preceding section we discussed various ways of
deriving bilinear ... belong
to this subset. For an example, see section 6.
5.2 The automaton
To determine the automaton we specify, in addition to
the set of states Q, the set of stack symbols F QUI°u...
... performing one will be
included in the QA system.
3.5 Other tools we used
In addition to the tools and resources previously
enumerated, we had to develop some basic tools
which one expects to find in ... related words in the way
presented in Section 3.3. Currently, we
are considering using partial parsing trees for
representing the structure of the question in a
manner simil...
... they
did not directly log the input in pinyin (Romanized
Chinese by which native characters are input), but
the input pinyin sequences are recovered from the
Chinese words in the native script (hanzi) ... penguines are marching in the snow.” and “Mummy,
my feet can’t touch the bottom.”)
3.2 Task interface
For logging the keystrokes including the use of
backspaces, we designed an origina...
... this paper due to space constraint.
443
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
Line
1234567890123456789012345678901234567890123456789012345678901234567890 ... tables in Figure 1 to 3.
Instead of resorting to an ad-hoc method to rec-
ognize tables, we present a new approach in this pa-
per that l...