this paper, we address the relationship between dependency structures and phrase structures from a practical perspective; namely, the exploration of different algorithms that convert dependency structures to phrase structures and the evaluation of their performance against an existing Treebank. This work not only provides ways to convert Treebanks from one type of representation to the other, but also clarifies the differences in representational coverage of the two approache
This paper describes a simple graph grammar based formalism that is capable to translate dependency ...
The number of treebanks available for different languages is growing steadily. A considerable portio...
Transforming constituent-based annotation into dependency-based annotation has been shown to work fo...
In this paper we propose an algorithm for converting dependency structures to phrase structures. Thi...
<p>We present a new algorithm for transforming dependency parse trees into phrase-structure parse tr...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
During the last decade, the Computational Linguistics community has shown an increased interest in D...
A language is considered here as a finite set of symbols (words of the language) together with a set...
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drasti...
Syntactic structure can be expressed in terms of either constituency or dependency. Constituency rel...
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drasti...
In this chapter, we are dealing with treebanks and their applications. We describe VIT (Venice Itali...
In this chapter, we are dealing with treebanks and their applications. We describe VIT (Venice Itali...
This paper describes a simple graph grammar based formalism that is capable to translate dependency ...
The number of treebanks available for different languages is growing steadily. A considerable portio...
Transforming constituent-based annotation into dependency-based annotation has been shown to work fo...
In this paper we propose an algorithm for converting dependency structures to phrase structures. Thi...
<p>We present a new algorithm for transforming dependency parse trees into phrase-structure parse tr...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees...
During the last decade, the Computational Linguistics community has shown an increased interest in D...
A language is considered here as a finite set of symbols (words of the language) together with a set...
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drasti...
Syntactic structure can be expressed in terms of either constituency or dependency. Constituency rel...
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drasti...
In this chapter, we are dealing with treebanks and their applications. We describe VIT (Venice Itali...
In this chapter, we are dealing with treebanks and their applications. We describe VIT (Venice Itali...
This paper describes a simple graph grammar based formalism that is capable to translate dependency ...
The number of treebanks available for different languages is growing steadily. A considerable portio...
Transforming constituent-based annotation into dependency-based annotation has been shown to work fo...