Alexander Koller, Kurt Mehlhorn, Joachim Niehren  Home/Search
Context Related
| mpisb.mpg.de/~mehlhorn/f...polydom.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpiinf.mpg.de/~mehlhorn/...node1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. (Update)
Context of citations to this paper: More
.... constraints is NP complete [8] it appears that dominance constraints occurring in these applications can be solved rather eciently [2, 7]. For a typical application of dominance constraints in semantic underspeci cation of scope we consider the sentence: every yogi has...
.... It draws heavily on the algorithms for dominance and parallelism constraints proposed in [13, 19] and on complexity results in [29, 41, 26]; many technical results that we can only mention here are proved in these papers. However, the algorithmic treatment of binding...
Cited by: More
Constraint Programming and Graph Algorithms - Kurt Mehlhorn Max-Planck-Institut (2000) (Correct)
A Constraint-Programming Approach to Parsing with.. - Erk, Kruijff (2002) (Correct)
An Efficient Graph Algorithm for Dominance Constraints - Althaus, Duchier, Koller, .. (2003) (Correct)
Similar documents (at the sentence level):
56.7%: A Polynomial-Time Fragment of Dominance Constraints - Koller, Mehlhorn, Niehren (2000) (Correct)
Active bibliography (related documents): More All
0.5: An Efficient Algorithm for the Configuration.. - Althaus, Duchier, .. (Correct)
0.3: Dominance Constraints with Set Operators - Duchier, Niehren (2000) (Correct)
0.3: Set Constraints In Computational Linguistics - Solving Tree.. - Duchier (1999) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
6: theory: Talking about talking about trees (context) - Marcus, Hindle et al. - 1983
6: Describing discourse semantics - Gardent, Webber - 1998
6: Dominance constraints: Algorithms and complexity - Koller, Niehren et al. - 1998
BibTeX entry: (Update)
KOLLER A., MEHLHORN K. & NIEHREN J. (2000). A polynomial-time fragment of dominance constraints. In Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics, Hong Kong. http://citeseer.ist.psu.edu/koller00polynomialtime.html More
@misc{ koller00polynomialtime,
author = "A. KOLLER and K. MEHLHORN and J. NIEHREN",
title = "A polynomial-time fragment of dominance constraints",
text = "KOLLER A., MEHLHORN K. & NIEHREN J. (2000). A polynomial-time fragment
of dominance constraints. In Proceedings of the 38th Annual Meeting of the
Association of Computational Linguistics, Hong Kong.",
year = "2000",
url = "citeseer.ist.psu.edu/koller00polynomialtime.html" }
Citations (may not include all citations):375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, aher - 1999
65 Predicate logic unplugged - Bos - 1996
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972
56 theory: Talking about talking about trees (context) - Marcus, Hindle et al. - 1983
36 Constraints over Lambda-Structures in Semantic Underspeci ca.. - Egg, Niehren et al. - 1998
27 Vijay-Shanker (context) - Rambow - 1995
27 Describing discourse semantics - Gardent, Webber - 1998
22 Dominance constraints: Algorithms and complexity - Koller, Niehren et al. - 1998
19 Obtaining trees from their descriptions: An application to t.. - Rogers, Vijay-Shanker - 1994
17 Parsing with tree descriptions: a constraint-based approach - Duchier, Thater - 1999
12 A rst-order axiomatization of the theory of nite trees (context) - Backofen, Rogers et al. - 1995
11 Order-independence and underspeci cation (context) - Muskens - 1995
11 Using descriptions of trees in a tree adjoining grammar (context) - Vijay-Shanker - 1992
4 algorithm for nding a maximal weighted matching in general g.. (context) - Galil, Micali et al. - 1986
3 An algorithm for generating quanti er scopings (context) - Hobbs, Shieber - 1987
3 Two accounts of scope availability and semantic underspeci -.. - Willis, Manandhar - 1999
2 From intuitionistic proof nets to interaction grammars - Perrier - 2000
1 A constraint-based treatment of descriptions (context) - ftp, stanford et al. - 1999
1 An ef- cient algorithm for the con guration problem of domin.. (context) - Althaus, Duchier et al. - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-inf.mpg.de/~mehlhorn/Journallist/node1.html): More
Certifying and Repairing Solutions to Large LPs -.. - Dhiflaoui, Funke, .. (Correct)
Implementation of O(nm log n) Weighted Matchings in General.. - Mehlhorn, Schäfer (Correct)
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC