In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a “stapler” has also been introduced. We present experimental results using EBL for different corpora and architectures to show the effectiveness of our approach
Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with...
In this paper we present a computational study of lexical acquisition. We attempt to characterize th...
Starting from the model proposed by means of Grammatical Evolution, we extend the applicability of t...
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to pa...
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to pa...
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framewor...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsi...
International audienceWe present a novel algorithm for surface realisation with lexicalist grammars....
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framewor...
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsi...
Schema-Tree Adjoining Grammars are proposed for compressing natural-language grammars. Their rules a...
In this paper we present a computational study of lexical acquisition. We attempt to characterize th...
Colloque avec actes et comité de lecture. internationale.International audienceIn the context of a s...
Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with...
In this paper we present a computational study of lexical acquisition. We attempt to characterize th...
Starting from the model proposed by means of Grammatical Evolution, we extend the applicability of t...
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to pa...
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to pa...
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framewor...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsi...
International audienceWe present a novel algorithm for surface realisation with lexicalist grammars....
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framewor...
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsi...
Schema-Tree Adjoining Grammars are proposed for compressing natural-language grammars. Their rules a...
In this paper we present a computational study of lexical acquisition. We attempt to characterize th...
Colloque avec actes et comité de lecture. internationale.International audienceIn the context of a s...
Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with...
In this paper we present a computational study of lexical acquisition. We attempt to characterize th...
Starting from the model proposed by means of Grammatical Evolution, we extend the applicability of t...