A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Fast Learning from Strings of 2-Letter Rigid Grammars
[chapter]
2002
Lecture Notes in 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
doi:10.1007/3-540-45790-9_17
fatcat:sl4xqlen3vbtvcelpeqsuhfpem