Publications
Authors:
  • Salah Ait-Mokhtar , Jean-Pierre Chanod , Claude Roux
Citation:
Proceedings of the Seventh IWPT (International Workshop on Parsing Technologies), Beijing, China, 17-19 October, 2001
Abstract:
This paper describes a generic approach to compute dependencies from a variety of input ranging from raw text to syntactic trees. The dependency calculus is incremental and combines topological constraints on sub-tree patterns together with logical constraints defined as Boolean expressions over the set of dependencies.
This formalism has been successfully implemented and tested with a broad coverage grammar for French,
and leads to computationally efficient and linguistically deep parsing.
Year:
2001
Report number:
2001/015
Attachments: