Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard

  title={Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard},
  author={Christophe Costa Flor{\^e}ncio},
In [Bus87] and [BP90] some 'discovery procedures' for classical categorial grammars were defined. These procedures take a set of structures (strings labeled with derivational information) as input and yield a set of hypotheses in the form of grammars.In [Kan98] learning functions based on these discovery procedures were studied, and it was shown that some of the classes associated with these functions can be identified in the limit (i.e. are learnable) from strings, by a computable function… 

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

Kanazawa ([8]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in the technical sense of

Learning Recursive Automata from Positive Examples

This theoretical paper studies how to translate finite state automata into categorial grammars and back, and shows that the generalization operators employed in both domains can be compared and that their result can always be represented by generalized automata, called "recursive automata ".

A Learnable Class of CCGs from Typed Examples

A new way of considering learning Categorial Grammars from semantic knowledge is presented, and the hypothesis that semantic types, in the usual sense, are general information making a distinction between facts, is made.

Partial Learning Using Link Grammars Data

This article proposes to adapt this kind of symbolic learning to natural languages by assuming that a small part of the grammar to be learned is given as input to compensate the combinatorial explosion of the learning algorithm.

A Learnable Class of Classical Categorial Grammars from Typed Examples

The main result is that for every CCG, a new subclass of CCGs with good properties from a language-theoretic point of view is defined.

When Categorial Grammars Meet Regular Grammatical Inference

It is proved that every unidirectional categorial grammar, and thus every context-free language, can be represented by a new kind of finite-state generative model called a recursive automaton.

Grammatical Inference: Learning Automata and Grammars

The author describes a number of techniques and algorithms that allow us to learn from text, from an informant, or through interaction with the environment that concern automata, grammars, rewriting systems, pattern languages or transducers.

Proceedings of FGVienna: The 8th conference on Formal Grammar

It is proved that the languages of link structured lists of words associated to rigid link grammars have finite elasticity and a learning algorithm is shown and this result leads to the learnability of rigid or k-valued link Grammars learned from strings.

Advances in Learning Formal Languages

An overview in the advances related to the learning of formal languages i.e. development in the grammatical inference research is presented, and the case of context-free grammars, challenges, recent trends etc., is cited.

How to Split Recursive Automata

In this paper, we interpret in terms of operations applying on extended finite state automata some algorithms that have been specified on categorial grammars to learn subclasses of context-free



Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard

It is shown that learning any (except one) class from this family by means of a consistent learning function is NP-hard as well.

Learnable Classes of Categorial Grammars

The dissertation investigates learnability of various classes of classical categorial grammars within the Gold paradigm of identification in the limit from positive data and proves that finite elasticity is preserved under the inverse image of a finite-valued relation, extending results of Wright's and of Moriyama and Sato's.

Finding patterns common to a set of strings (Extended Abstract)

This problem is shown to be effectively solvable in the general case and to lead to correct inference in the limit of the pattern languages and a polynomial time algorithm for finding minimal one-variable pattern languages compatible with a given set of strings is given.

Categorial grammars determined from linguistic data by unification

The algorithm presented here extends an earlier one restricted to rigid categorial grammars, introduced in [4] and [5], by admitting non-rigid outputs, and introduces the notion of an optimal unifier, a natural generalization of that of a most general unifier.

A Guided Tour Across the Boundaries of Learning Recursive Languages

The influence of various monotonicity constraints to the learning process is considered, and a thorough study concerning the influence of several parameters is provided, which provides a unifying framework for learning.

Language Identification in the Limit

  • E. M. Gold
  • Linguistics, Computer Science
    Inf. Control.
  • 1967

Computers and Intractability: A Guide to the Theory of NP-Completeness

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Consistent Polynominal Identification in the Limit

It will turn out, that consistency is the first natural condition having a narrowing effect for arbitrary update boundaries, and it is shown the existence of arbitrary hard, as well as an infinite chain of harder and harder consistent learnable sets.

Algorithmic Learning for Knowledge-Based Systems: Gosler Final Report

This paper presents a meta-modelling framework for inductive inference of recurrence-term languages from positive data that automates the very labor-intensive and therefore time-heavy and expensive process of rewriting programs.

On the Complexity of Consistent Identification of Some Classes of Structure Languages

In [5,7] ‘discovery procedures’ for CCGs were defined that accept a sequence of structures as input and yield a set of grammars.