Fast Learning from Strings of 2-Letter Rigid Grammars

@inproceedings{Seginer2002FastLF,
  title={Fast Learning from Strings of 2-Letter Rigid Grammars},
  author={Yoav Seginer},
  booktitle={ICGI},
  year={2002}
}
  • Y. Seginer
  • Published in ICGI 23 September 2002
  • Computer Science
It is well-known that certain classes of classical categorial grammars are learnable, within Gold's paradigm of identification in the limit, from positive examples. In the search for classes which can be learned efficiently from strings, we study the class of 2-letter rigid grammars, which is the class of classical categorial grammars with an alphabet of two letters, each of which is assigned a single type. The (non-trivial) structure of this class of grammars is studied and it is shown that… 

References

SHOWING 1-4 OF 4 REFERENCES
Learnable Classes of Categorial Grammars
TLDR
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.
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard
TLDR
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, Studies in Logic Language and Information
  • Learnable Classes of Categorial Grammars, Studies in Logic Language and Information
  • 1998
Concrete Mathematics
  • Concrete Mathematics
  • 1994