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

Stabler - Lx 185/209 2003
At the prompt: more?
to finish
; for more results
t display derivation, x-bar,and bare trees with tk
d print derivation tree to tk and ltree.tex
b print bare tree to tk and ltree.tex
x print x-bar tree to tk and ltree.tex
p pprint derivation tree to terminal and ltree.tex
q pprint bare tree to terminal and ltree.tex
r pprint x-bar tree to terminal and ltree.tex
or anything else for this help
more? r
cP /[
c’ /[
c /[
[] /[]],
iP /[
dP(3) /[
d’ /[
d /[
[titus] /[]]]],
i’ /[
vtP(2) /[
vt’ /[
vt /[
[praise] /[]],
dP /[
t(1) /[]]]],
i’ /[
i /[
[-s] /[]],
predP /[
dP /[
t(3) /[]],
pred’ /[
dP(1) /[
d’ /[
d /[
[lavinia] /[]]]],
pred’ /[
pred /[
[] /[]],
vtP /[
t(2) /[]]]]]]]]]]
more? x
more? q
< /[
[]:[c] /[],
> /[
[titus]:[] /[],
> /[
< /[
[praise]:[] /[],
/[]],
< /[
[-s]:[] /[],
> /[
/[],
> /[
[lavinia]:[] /[],
< /[
[]:[] /[],
/[]]]]]]]]
more? b
more?
Yes
4 ?-
The MG derivation trees displayed in these notes were all generated by mgp.
Complexity: (Harkema, 2000) shows that the time complexity of this parsing method is bounded by
O(n4m+4 ) where m is the number of different movement triggers.
Morawietz has also shown how this kind of parsing strategy can be implemented as a kind of constraint
propagation (Morawietz, 2001).
187