Learning Semantic Grammars with Constructive nduct ive ogic

نویسندگان

  • John M. Zelle
  • Raymond J. Mooney
چکیده

Automating the construction of semantic grammars is a difficult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be viewed as the learning of search-control heuristics in a logic program. Appropriate control rules are learned using a new first-order induction algorithm that automatically invents useful syntactic and semantic categories. Empirical results show that the learned parsers generalize well to novel sentences and out-perform previous approaches based on connectionist techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Semantic Grammars with Constructive Inductive Logic Programming

Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be viewed as the learning of search-control heuristics in a logic program. Appropriate control rules are learned using a new rst-order induction algorithm that automatically invents useful syntactic and semantic categories....

متن کامل

Learning Correction Grammars

We investigate a new paradigm in the context of learning in the limit, namely, learning correction grammars for classes of computably enumerable (c.e.) languages. Knowing a language may feature a representation of it in terms of two grammars. The second grammar is used to make corrections to the first grammar. Such a pair of grammars can be seen as a single description of (or grammar for) the l...

متن کامل

Nduct Ive Ilist Ic Ai

This paper describes an inductive learning method in probabilistic domain. It acquires an appropriate probabilistic model from a small amount of observation data. In order to derive an appropriate probabilistic model, a presumption tree with least description length is constructed. Description length of a presumption tree is defined as the sum of its code length and log-likelihood. Using a cons...

متن کامل

Learning Semantic Functions of Attribute Grammars

Attribute grammars can be considered as an extension of context-free grammars, where the attributes are associated with grammar symbols, and the semantic rules deene the values of the attributes. This formalism is widely applied for the speciication and implementation of the compilation-oriented languages. The paper presents a method for learning semantic functions of attribute grammars which i...

متن کامل

Lexicalized Well-Founded Grammars: Learnability and Merging

This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicalized Well-Founded Grammars, which are adequate for modeling human language and are learnable. These features make the grammars suitable for developing robust and scalable natural language understanding systems. Our grammars capture both syntax and semantics and have two types of constraints at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999