Pages that link to "Item:Q5706930"
From MaRDI portal
The following pages link to Logical Aspects of Computational Linguistics (Q5706930):
Displaying 6 items.
- Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors (Q1675806) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Learning discrete categorial grammars from structures (Q3514641) (← links)
- Learning Subclasses of Parallel Communicating Grammar Systems (Q3588391) (← links)
- (Q4223176) (← links)
- Set-driven and rearrangement-independent learning of recursive languages (Q4717054) (← links)