Parsing with Tree Des riptions

Stefan Thater

Description

Parsing with Tree Des riptions: a onstraint{based approa h Denys Du hier Stefan Thater du hierps.uni-sb.de stth oli.uni-sb.de Abstra t In previous work [7, 8? it was shown that a onstraint-based treatment of tree- des riptions results in a simple and tra table implementation. However, that ap- proa h treated only the onjun tive fragment. Therefore it ould not be dire tly applied to parsing with tree des ription-based grammars where lexi al ambiguity gives rise to disjun tion. In this paper, we extend the previous approa h in two ways. First, we intro- du e the formalism of ele trostati tree des riptions', whi h ombines dominan e logi with a notion of polarities and permits a onvenient hara terization of ad- missible synta ti stru tures. Se ond, we extend this idea to disjun tive systems of des riptions suÆ ient to a ount for lexi al ambiguities. Finally, we exhibit an en oding that turns parsing into a onstraint satisfa tion problem (CSP) solvable by onstraint programming. 1 Introdu tion Traditionally, syntax is about trees: phrase stru ture trees. In omputational syntax however, it has variously been argued that des riptions of trees oer an alternative with signi ant advantages.

• missible synta


• tion


• grammar


• lexi al


• ti stru


• based approa


• alized tree


• tures


• onstraints whi

Sujets

• Grammar

Informations

• Publié par: pefav
• Nombre de lectures: 14
• Langue: English

Extrait

P
refer
arsing
all
with
presen
T
under-sp
ree
The
Descriptions:
relation
a
an

ree
t{based
mo

under-sp
h
rather

ed
Den
b
ys
Pro

descriptions
hier
a
Stefan
for
Thater
their

T

descriptions

t

guises.
In
o
previous

w
and
ork
no
[7
these
,
funded
8]
with
it
sho
w
tal
as
them
sho
t
wn
℄
that

a
℄

uniform
t-based

treatmen
framew
t
is
of

tree-
an
descriptions
the
results
in
in
v
a
In
simple
v
and
the
tractable
ts
implemen
to
tation.
under-sp
Ho
een
w
and
ev
the
er,

that
pap
ap-
DF

1
h
t
treated
[11
only
that
the
ort


e
℄
fragmen
pro
t.
monotone
Therefore

it
Grammar;

them
not
bining
b
syn-
e
and

o
applied
for
to
t
parsing

with
in
tree
G-lik
description-based
Common
grammars
prop
where
idea

ermit
am
el
biguit

y
and
giv
t
es
under
rise

to
w

no
In
are
this
no
pap
t
er,
no
w
ma
e
one
extend
no
the
dominance
previous
allo

opp
h

in
ermit
t
the
w
et
o
w
w
v
a

ys.
w
First,
no
w
ariables
e

in
in
tro-
w

y
the
in
formalism
C2
of
e


tree
adv
descriptions',
tages.
whic
℄
h
ws

tree
bines
supp
dominance


syn
with
pro
a
[16
notion
uses
of
to
p
vide
olarities
fully
and
treatmen
p
of
ermits
T
a
Adjoining

[12
v
nds
enien

t


seman

with
of

ad-

missible
[13
syn
adv



use

a
w
treatmen
e
of
extend
d-
this
and
idea
tation
to
a

A
e
e
systems
ork.
of
to
descriptions
these
Æ
osals,
t
the
to
that

p
t
a
for
lev

of
am

biguities.
for
Finally
adequate
,
elegan
w
treatmen
e
of
exhibit
phenomena
an


under-sp
ding
is
that
t
turns
o
parsing
First,
in
de
to
ariables
a
used

than
t
des.
satisfaction
particular,
problem
w
(CSP)

solv
de
able
ariables
b
y
y
to

and
t
same
programming.
de.
1
arbitrary
In
statemen
tro
are

w
T
(as
raditionally
osed
,
only
syn
dominance)
tax
p
is
to
ab
ecify
out

trees:
b
phrase
w

t
trees.
o
In
de

ariables
syn
therefore,
tax
,
ho
et
w
een
ev
tree
er,
des
it
v
has
denote.
v
The
ariously
h
b
ted
een
this
argued
er
that
as
descriptions
b
of
the
tr
G
e
SFB{378,
es

oer
(LISA).
an
alternativdene
The
and
tree
fragmen
descriptions
grammar
used

b
enien
y
a

3.3
linguists
with
are
bine
expressions
upp
in
ork
a
an
tree
ts

descriptions
e.g.

[2,
in
1
T
℄
to
they
for
are
b

p
form

ulae

whic
of
h,
yle,
if
b

for
t,
in
are
of
satised
systems
b
onding
y
a
one
mo
and
outlines
usually
adjoining
man
grammar
y
trees).
more

mo
phenomena
dels
one.
in
A
that
with

ermits
These
of
mo
extend
dels
form
are
am
the
a
syn
w

in
trees
parsing
the
problem
linguist
programming.
is
the

it
hing
that
for.
seman
In
a
terms
ork.
of

pro
4

dev
ho
del.
w
sc
ev
our
er,
in
tree
discusses
descriptions
e
are
dev
often
Lik
treated
A
as
a
data-structures
that
and
phrase

parsing
bined
in
together
order
using
mo
v

arious
the

G
osition
op
op
split
erations.
lo
Under
notion

and
h

a

view,
syn
parsing
w
is
formal
dealt
a
with

b
for
y
y
means
tro
of

standard
del.

pro
hniques
d-
e.g.

an
turns
Earley
in
st
t
yle
solv
parsing

algorithm
2
in
motiv
[13

℄
the
and
outlines
automaton-based
t
parsing

in

[3
of
℄
dev
The
mo
price
parsing
to
particular,
pa
the
y

is
descriptions.
that
to
no
ect
de
a
v
t
ariables
e
are

no
that
longer
expressed
v
mo
ariables:
a
they

are

no
results
des
protot
whic
tation
h
of
under
t.

Description



(L
b
the
e
t
merged.
descrip-
Under
a
the
w

ts
view
(elemen
on
task
the
to
other
fragmen
hand,
a
v
tree.
ariables

are
dication
v
emen
ariables
is
and
insert
parsing
in
is
of
a
T
mo
is
del-generation
the
problem:
of
giv
de
en
to
a
and

er
form
a
ula
of

olarities
,
p
ho
a
w
v

t
w

e
admissible
generate

the

minimal
e
mo
the
dels
framew
that
with
satisfy

it?
of
As
to
℄
t
remarks,

naiv
biguit
e
,
tableau-based
in


hes


notion
h
mo
as
Third,
[14
e
,
vide
4]


ing,
lead
the
to
st

that
binatorial
a
explosion
problem
in
to
the


satisfaction
of
(CSP)

able
inheren
y
t
t
in

the
presen
theory
and
of
ates
trees.
tree
In
used

writing
[9
grammar;
℄
then
sho
a
ws
fragmen
that
in
solving

purely
3

tro
e
the
descriptions

is
tree
NP-hard.
and
In
elops
spite
formal
of
del
this
our

framew
result,
In


algorithms
extends
are
seman
needed
to
to
e
en
of
umerate

solutions
turns
as
the

asp
tly
and
as
elops
p

ossible.

In
mo
[7
W
,
precisely
8]
an
w
ding
e
heme
describ
turns
ed
problem
a
in

formal
t-based
del

to
h
CSP
b
our
y
t

del.
ding
5
in
preliminary
to
obtained
nite
our
set
yp

implemen
ts.
and
This


future
hnique
elopmen
resulted
2
in
ree
a
Grammar
simple
e
and
tree

grammar
t
T
implemen
G)
tation

in
onen
the
of

tree
t
tion

is
t

programming
maps
language
ords
Oz
fragmen
[10
of
,

15
tary
℄
The
In
of
this
is
pap

er,
these
w
ts
e