Theoretical Computer Science
Type-raising and directionality in combinatory grammar
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Efficient incremental processing with categorial grammar
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Polarized Non-projective Dependency Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Towards efficient parsing with proof-nets
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Grammars for local and long dependencies
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
Proof-Nets (Roorda 1990) are a good device for processing with categorial 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.