Campus Event Calendar
Event Entry
New for: D1, D2
What and Who
Measuring Computationally Relevant Word Order Complexity
Karel Oliva
Computerlinguistisches Kolloquium
AG 1, AG 2
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 1 December 98
15:10
-- Not specified --
17.2 - Computerlinguistik
Seminarraum
Saarbrücken
Abstract
In the talk, a class of dependency-based formal grammars will be presented
which can be parametrized by two different but similar measures of
non-projectivity (discontinuity). The measures allow for formulating
constraints on degree of word-order freedom of a language. We shall have a
look on word order freedom in English and Czech as well as on the
implications such a comparison brings for computer processing of these
languages.
Contact
--email hidden
passcode not visible
logged in users only
Uwe Brahm, 04/12/2007 11:57 -- Created document.