Dominance Constraints in Context Unification

Joachim Niehren and Alexander Koller

In Logical Aspects of Computational Linguistics, Third International Conference, LACL'98, Grenoble, France, December 14-16, 1998, Selected Papers, 2001.

Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics, and discourse. Tree descriptions in the language of context unification have attracted some interest in unification and rewriting theory. Recently, dominance constraints and context unification have both been used in different underspecified approaches to the semantics of scope, parallelism, and their interaction. This raises the question whether both description languages are related. In this paper, we show for a first time that dominance constraints can be expressed in context unification. We also prove that dominance constraints extended with parallelism constraints are equal in expressive power to context unification.

Download: Download

BibTeX Entry
@InProceedings{domcu,
	author = {Joachim Niehren and Alexander Koller},
	title = {Dominance Constraints in Context Unification},
	year = {2001},
	booktitle = {Logical Aspects of Computational Linguistics, Third International
		Conference, LACL'98, Grenoble, France, December 14-16, 1998,
		Selected Papers},
	editor = {Michael Moortgat},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	volume = {2014},
	isbn = {3-540-42251-X}
}

Back: Publications