We present in this paper a technique aiming at enriching existing treebanks with constraint-based information. The technique consists in acquiring a constraint grammar from the original constituency treebank and applying it with a constraint parser to the source treebank. The result is an hybrid treebank, with both constituency and constraint-based representations. After a presentation of the general technique in the framework of \emphProperty Grammars, we propose an application for the hybridization of the \emphFrench Treebank. This kind of resource offers several interests, including the possibility of identifying the relative importance of constraints. We present a method assigning weights to individual constraints as well as constraint ...
For the two grammar formalisms Tree--Adjoining Grammars (TAGs) and Constraint Dependency Grammars (C...
We present a method based on the formalism of Property Grammars to enrich the Arabic treebank ATB wi...
Attribute grammars provide a framework to de ne compu- tations over trees, by decorating those trees...
We present in this paper a technique aiming at enriching existing treebanks with constraint-based in...
Thesis (Master's)--University of Washington, 2015In this thesis, I present a new method of producing...
We present an approach specifying constraints on labeled trees, such as are commonly used within (co...
This thesis shows how constraint programming can be applied to the processing of Categorial Type Log...
Colloque avec actes et comité de lecture. internationale.International audienceThe static or axiomat...
Article dans revue scientifique avec comité de lecture. internationale.International audienceTrees w...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
This paper presents a method for representing trees using constraint logic programming over finite d...
ABSTRACT: Trees with labeled edges have widespread applicability, for example for the representation...
Abstract. Blache [1] introduced Property Grammar as a formalism where linguistic information is repr...
Inside the framework of robust parsers for the syntactic analysis of unrestricted text, the aim of ...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
For the two grammar formalisms Tree--Adjoining Grammars (TAGs) and Constraint Dependency Grammars (C...
We present a method based on the formalism of Property Grammars to enrich the Arabic treebank ATB wi...
Attribute grammars provide a framework to de ne compu- tations over trees, by decorating those trees...
We present in this paper a technique aiming at enriching existing treebanks with constraint-based in...
Thesis (Master's)--University of Washington, 2015In this thesis, I present a new method of producing...
We present an approach specifying constraints on labeled trees, such as are commonly used within (co...
This thesis shows how constraint programming can be applied to the processing of Categorial Type Log...
Colloque avec actes et comité de lecture. internationale.International audienceThe static or axiomat...
Article dans revue scientifique avec comité de lecture. internationale.International audienceTrees w...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
This paper presents a method for representing trees using constraint logic programming over finite d...
ABSTRACT: Trees with labeled edges have widespread applicability, for example for the representation...
Abstract. Blache [1] introduced Property Grammar as a formalism where linguistic information is repr...
Inside the framework of robust parsers for the syntactic analysis of unrestricted text, the aim of ...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
For the two grammar formalisms Tree--Adjoining Grammars (TAGs) and Constraint Dependency Grammars (C...
We present a method based on the formalism of Property Grammars to enrich the Arabic treebank ATB wi...
Attribute grammars provide a framework to de ne compu- tations over trees, by decorating those trees...