... constrains the
mapping from variables in the lexical string to truth-values
in the surface string, ensuring that whatever value is as-
signed to x in one occurrence must be assigned to x in
every ... BIGMA-
CHINE, since interactions constrain the set of reachable
state-combinations.
Finally, it is worth considering whether the nondeter-
minism involved in constructing the lex...
... COMPUTATIONAL LINGUISTICS IN INDIA: AN OVERVIEW
Akshar Bharati, Vineet Chaitanya, Rajeev Sangal
Language Technologies Research Centre
Indian Institute of Information Technology, Hyderabad
{sangal,vc}@iiit.net
1. ... Hyderabad
{sangal,vc}@iiit.net
1. Introduction
Computational linguistics activities in India are being
carried out at many institutions. The activities are
centred around deve...
...
alternating Turing Machine M on input w.
Let S(n) be a polynomial in n. Then, on input M, a S(n)
space-bounded one tape alternating Turing Machine (ATM),
and string w, we construct a GPSG G in ... computational intractability. The underlying
insight for the following complexity proof is the almost direct
equivalence between Alternating Turing Machines (ATMs) and
syntactic categor...
... concern the testing of the
scheme's efficiency at lower levels endowed with
necessary bilingual information about potential
delimiters.
INTRODUCTION
Parallel linguistically meaningful text ... stored in a
database and input expressions are rendered in
the target language by retrieving from the
database that example which is most similar to
the input. A task of crucial import...
... An Experiment in Machine Translation
INTRODUCTION
Although funding for Machine Translation (MT) research
virtua11y ended in the U.S. with the release of the
ALPAC report [1] in 1966, there ... has been a continuing
interest in this field. Rapid evolution of science and
technology, coupled with increased world-wlde exposure
of their products, demands more and more speed in tra...
...
ABSTRACT
In this paper we provide an abstract
characterisation of different kinds of robust
processing in Machine Translation and Natural
Language Processing systems in terms of the kinds
of ... from a well-known technique in
systems theory: insuring against the effect of
faulty components in crucial parts of a system by
computing the result for a given input by a number
of...
... use the erythropoietin receptor (EpoR)-induced
activation of ERK1 in the hematopoietic suspension
cell line, BaF3-hemaglutinin-tagged (HA)-EpoR, and
the interleukin-6 (IL-6)-induced activation ... while
blotting errors are caused by inhomogeneities of the
gel or the blot.
Eliminating correlated errors by randomized
sample loading
To determine steps predominantly contributing to the
error ob...
... parsers
using realistic, complex unification-based gram-
mars: in particular, with grammars admitting less
ambiguity parse time will tend to increase more
slowly with increasing input length, ... related
to polynomial -complexity bottom-up CF parsing
algorithms. Although incorporating unification
increases their complexity to exponential on gram-
mar size and input length (sectio...
... cannot be
organized in opposite clusters. As pointed out by
Levi (1978), the intrinsic meaning of these ad-
jectives is something along the following lines:
‘of, relating/pertaining to, associated ... offer interesting
insights concerning adjective linguistic behavior
and the identification of relevant common fea-
tures, which may set the basis for an accurate
modeling of this POS in...