by Manuel Bodirsky, Denys Duchier, Joachim Niehren
http://www.informatik.hu-berlin.de/~bodirsky/publications/wndcs.ps.gz
Add To MetaCart
Abstract:
Abstract. Dominance constraints are logical descriptions of trees that have numerous applications in computational linguistics. Ecient algorithms for the subclass of normal dominance constraints were proposed recently. We present a new graph algorithm that enumerates the solved forms of weakly normal dominance constraints. We thereby improve on the best previously known algorithm for normal dominance constraints in eciency, coverage, and applicability. 1
Citations
|
128
|
Predicate logic unplugged
– Colloquium, Bos, et al.
- 1996
|
|
121
|
Minimal Recursion Semantics: An Introduction
– Copestake, Flickinger, et al.
- 1999
|
|
109
|
D-theory: talking about talking about trees
– Marcus, Hindle, et al.
- 1983
|
|
56
|
a platform for combinatorial and geometric computing
– LEDA
- 1999
|
|
54
|
The Constraint Language for Lambda Structures
– Egg, Koller, et al.
|
|
45
|
Obtaining trees from their descriptions: An application to tree-adjoining grammars
– Rogers, Vijay-Shanker
- 1994
|
|
44
|
Describing discourse semantics
– Gardent, Webber
- 1998
|
|
41
|
Dominance constraints: Algorithms and complexity
– Koller, Niehren, et al.
- 1998
|
|
22
|
An efficient graph algorithm for dominance constraints
– Althaus, Duchier, et al.
|
|
19
|
A polynomial-time fragment of dominance constraints
– Koller, Mehlhorn, et al.
- 2000
|
|
12
|
A axiomatization of the theory of trees
– Backofen, Rogers, et al.
- 1995
|
|
9
|
Pure dominance constraints
– Bodirsky, Kutz
- 2002
|
|
2
|
A linear time algorithm for the con problem of dominance graphs
– Thiel
- 2002
|
