Inproceedings,

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.

, and .
WoLLIC, volume 84 of Electronic Notes in Theoretical Computer Science, page 60-72. Elsevier, (2003)

Meta data

Tags

Users

  • @dblp

Comments and Reviews