...
Firstly, Finnish is a " ;free word order& quot;
language in the sense that the order of the main
constituents of a sentence is relatively free.
Variations in word order configurations convey ... associated with the words of an input
sentence, activate one another.
I ~ON
This Daper introduces a computational model
for the description and analysis of an inflectional
fr...
... functioning of the
formalism and some of its virtues.
4.2 The Analysis of German Word Order
Uszkoreit (1982a) proposes a GPSG analysis of German
word order that accounts for the fixed -order phenomena, ... fulfill an important condition
for effcient treatment of partially free word order.
4. The Framework and Syntactic Analysis
4.1 Tile Framework of CPSG in ID/LP Format
T...
... treatment of semi-
free word order and
bounded
discontinuous
constituency. We extend standard feature value
logics to treat word order in a single formalism with
a rigorous semantics without ... to formalise. That is that semi -free word
order and nonconfigurationality are local
phenomenon (i.e., bounded) and that word order
domains are larger than the local trees of...
... this method from bigrams and trigrams, e.g.,
contexts of the form word1 __, __ _word2 ,
__ _word1 word2 , word1 ___ word3 , and word1
word2 ___.
2
Table 1 lists the standard lexical association ... regardless of which word fills the context.
The rank ratio (RR) for the word given the
context can then be defined as:
RR (word, context) =
(
)
( )
,
,
ER word context
AR w...
... microtu-
bule-associated protein-2 (MAP-2) using a Vectastain kit
(Vector Laboratories, Peterborough, UK). Staining was
performed according to the manufacturer’s instructions.
Briefly, endogenous peroxidases ... responsible for
the content or functionality of any supplementary
materials supplied by the authors. Any queries (other
than missing material) should be directed to the corre-
spondi...
... contexts.
5
For each selected context, we sort the words in de-
scending order according to c(w
i
, f
k
) and retrieve
the top-M words (L = M = 1600).
6
We merge
all of the words above as candidate words ... given word sets, we can construct input-and-
answers pairs, where the answers for each word
are the other words in the set the word appears in.
We output a ranked list of 500 simi...
...
rules. It is also the method used by Kay [7] in parsing FUG.
This method works reasonably well for small grammars, but
it is clearly unsatisfactory for descriptions containing more
than a small ... unification algorithm for
disjunctive descriptions wiU require exponential time in the
worst case. However, this result does not preclude algorithms
with better average performance, su...
...
words or morphemes.
The previous algorithms for spelling error cor-
rection basically use a word dictionary. Each word
in a sentence is compared to word dictionary en-
tries, and if the word ...
literary sentences, correcting word spacing error
and spelling error is the very essential problem
with colloquial style sentences.
In order to correct word spacing errors, many...
... each word type idiosyncrat-
ically prefers particular complements with par-
ticular head words. We present O(n 4) parsing
algorithms for two bilexical formalisms, improv-
ing the prior upper ...
pand the start word $ E VT into xSy for some
(x, y) E L(H$), and then recursively expand the
words in strings x and y. More formally, given
H, we simultaneously define La for all a E VT...
...
phonemes for all words in the corpus. Vowel-initial
words show less tendency and fricative-initial words
show a greater tendency to occur as fragments, relative
to the underlying distributions for ... Syntactic Categories for Con-
stituent Repairs (N= 110)
repairs (where the first phrase boundary in the repair
interval delimits a sequence of one or more repeated
words), phonetic err...