Paper: Proof-Nets And Dependencies

ACL ID C92-1061
Title Proof-Nets And Dependencies
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992
  • Alain Lecomte (University of Clermont-Ferrand 2, Clermont-Ferrand France)

Proof-Nets (Roorda 1990) are a good device for processing with eategorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Categorial Grammars and Dependency Grammars. We give here an other kind of Proof-Nets which is much related to Dependency Structures similar to those we meet in, for instance (Hudson 1984). These new Proof-Nets are called Connection Nets. We show that Connection Nets provide not only easily interpretable structures, but also that processing with them is more efficient.