Notes on computational linguistics.pdf - UCLA Department of ...

Stabler - Lx 185/209 2003
is the following language:
Jan säit das mer (d’chind) ∗ (em Hans) ∗ hænd wele (laa) ∗ (hälfe) ∗ aastriiche
Jan says that we the children Hans have wanted let help paint
Jan säit das mer (d’chind) i (em Hans) j hænd wele (laa) i (hälfe) j aastriiche.
Some dialects of English have constructions that strongly favor perfect copying (Manaster-Ramer, 1986), which
also involves crossing dependencies.
Big vicious dog or no big vicous dog, I’ll deliver the mail.
The formal language {xx| x ∈{a, b} ∗ } is a particularly simple formal example of crossing dependencies like
this. It is easily defined with a unification grammar like this one:
% xx.pl
’S’ :˜ [’A’(X),’A’(X)].
’A’([a|X]) :˜ [a,’A’(X)].
’A’([b|X]) :˜ [b,’A’(X)].
’A’([]) :˜ [].
We can use this grammar in sessions like this:
˜/tex/185 1%pl
Welcome to SWI-Prolog (Version 5.0.8)
Copyright (c) 1990-2002 University of Amsterdam.
1 ?- [tdp,xx].
\% tdp compiled 0.00 sec, 1,968 bytes
\% xx compiled 0.00 sec, 820 bytes
Yes
2 ?- ([a,b,a,b]?˜[’S’]@[T]).
T = ’S’/[’A’([a, b])/[a/[], ’A’([b])/[b/[], ’A’(...)/[]]], ’A’([a, b])/[a/[], ’A’([b])/[b/[], ...
No
3 ?- ([a,b,a]?˜[’S’]@[T]).
No
5 ?-
Developing an observation of Kenesei, Koopman and Szabolcsi observe the following pattern in negated or
focused sentences of Hungarian, schematized on the right where “M” is used to represent the special category
of “verbal modifiers” like haza-:
(48) Nem
not
(49) Nem
not
fogok akarni kezdeni haza-menni
will-1s want-inf begin-inf home-go-inf
fogok akarni haza-menni kezdeni
will-1s want-inf home-go-inf begin-inf
V1 V2 V3 M V4
V1 V2 M V4 V3
59