Add to ORKGDespite the recent advances in parsing, significant efforts are needed to improve the current parsers performance, such as the enhancement of the argument/adjunct recognition. There is evidence that verb subcategorization frames can contribute to parser accuracy, but a number of issues remain open. The main aim of this paper is to show how subcategorization frames acquired from a syntactically annotated corpus and organized into fine-grained classes can improve the performance of two rulebased dependency grammar
A context-free grammar (CFG) in which dependency constraints are tucked into production rules has be...
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism that has proven effe...
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomou...
Despite the recent advances in parsing, significant efforts are needed to improve the current parser...
International audienceStatistical parsers are trained on treebanks that are composed of a few thousa...
Subcategorization information is a useful feature in dependency parsing. In this paper, we explore a...
Syntactic structure can be expressed in terms of either constituency or dependency. Constituency rel...
This paper describes an approach to treebank development which relies on the manual development of a...
The paper describes a system for extracting subcategorization frames of verbs not found in existing ...
International audienceTreebanks are not large enough to adequately model subcategorization frames of...
Bilexical dependencies capturing asymmetrical lexical relations between heads and dependents are vie...
This paper introduces UDLex, a computational framework for the automatic extraction of argument stru...
We present a simple and effective semisupervised method for training dependency parsers. We focus on...
We propose two general and robust methods for enriching resources annotated in the Frame Semantic pa...
Unsupervised grammar induction models tend to employ relatively simple models of syntax when compare...
A context-free grammar (CFG) in which dependency constraints are tucked into production rules has be...
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism that has proven effe...
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomou...
Despite the recent advances in parsing, significant efforts are needed to improve the current parser...
International audienceStatistical parsers are trained on treebanks that are composed of a few thousa...
Subcategorization information is a useful feature in dependency parsing. In this paper, we explore a...
Syntactic structure can be expressed in terms of either constituency or dependency. Constituency rel...
This paper describes an approach to treebank development which relies on the manual development of a...
The paper describes a system for extracting subcategorization frames of verbs not found in existing ...
International audienceTreebanks are not large enough to adequately model subcategorization frames of...
Bilexical dependencies capturing asymmetrical lexical relations between heads and dependents are vie...
This paper introduces UDLex, a computational framework for the automatic extraction of argument stru...
We present a simple and effective semisupervised method for training dependency parsers. We focus on...
We propose two general and robust methods for enriching resources annotated in the Frame Semantic pa...
Unsupervised grammar induction models tend to employ relatively simple models of syntax when compare...
A context-free grammar (CFG) in which dependency constraints are tucked into production rules has be...
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism that has proven effe...
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomou...