English

Disambiguating with Controlled Disjunctions

cmp-lg 2007-05-23 v1 Computation and Language

Abstract

In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions into a HPSG feature structure representation. Finally, we present a direct implementation by means of delayed evaluation and we develop an example within the functionnal programming paradigm.

Keywords

Cite

@article{arxiv.cmp-lg/9710003,
  title  = {Disambiguating with Controlled Disjunctions},
  author = {Philippe Blache},
  journal= {arXiv preprint arXiv:cmp-lg/9710003},
  year   = {2007}
}

Comments

requires LaTeX2e, uses tree-dvips, avm