Login / Signup

-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.

Denis BéchetAnnie Foret
Published in: Theor. Comput. Sci. (2006)
Keyphrases
  • complex objects
  • argument structures
  • learning algorithm
  • natural language
  • natural language processing
  • grammatical inference
  • machine learning
  • context free grammars
  • predicate argument