Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language gram-mars are more powerful than context-free grammars and hu-mans learn them with remarkable ease from positive exam-ples (Marcus 1993). Identifiability results for formal lan-guages ignore a potentially powerful source of information available to learners of natural languages, namely, meanings. This paper explores the learnability of syntax (i.e. context-free grammars) given positive examples and knowledge of lexical semantics, and the learnability of lexical semantics given knowledge of syntax. The long-term goal is to develop an approach to learning both syntax and semantics that boot-straps itself, using limited knowledge ab...
: In this paper, we propose a unified framework for the syntactico-semantic learning of natural lan...
It is suggested that the concept of "logic grammar" as relation between a string and a parse-tree ca...
International audienceThis paper is a theoretical contribution to the debate on the learnability of ...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
Abstract. In this paper, we propose a new framework for the computational learning of formal grammar...
This paper proposes a formulation of grammar learning in which meaning plays a fundamental role. We ...
We present a relational learning framework for grammar induction that is able to learn meaning as we...
This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicaliz...
In this thesis, we investigate an approach for grammar induction that relies on se-mantics to drive ...
When starting to learn the classifier-noun combination in a second language (L2), how do we acquire ...
Self-supervised pre-training techniques, albeit relying on large amounts of text, have enabled rapid...
This paper presents a brief summary of the major work relevant to formal and computational approache...
Much is still unknown about how children learn language, but it is clear that they perform “grounded...
AbstractA procedure for learning a lexical assignment together with a system of syntactic and semant...
: In this paper, we propose a unified framework for the syntactico-semantic learning of natural lan...
It is suggested that the concept of "logic grammar" as relation between a string and a parse-tree ca...
International audienceThis paper is a theoretical contribution to the debate on the learnability of ...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
Abstract. In this paper, we propose a new framework for the computational learning of formal grammar...
This paper proposes a formulation of grammar learning in which meaning plays a fundamental role. We ...
We present a relational learning framework for grammar induction that is able to learn meaning as we...
This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicaliz...
In this thesis, we investigate an approach for grammar induction that relies on se-mantics to drive ...
When starting to learn the classifier-noun combination in a second language (L2), how do we acquire ...
Self-supervised pre-training techniques, albeit relying on large amounts of text, have enabled rapid...
This paper presents a brief summary of the major work relevant to formal and computational approache...
Much is still unknown about how children learn language, but it is clear that they perform “grounded...
AbstractA procedure for learning a lexical assignment together with a system of syntactic and semant...
: In this paper, we propose a unified framework for the syntactico-semantic learning of natural lan...
It is suggested that the concept of "logic grammar" as relation between a string and a parse-tree ca...
International audienceThis paper is a theoretical contribution to the debate on the learnability of ...