Example-based complexity
Published • Jan 1, 2000
Authors:
Robert John Freeman
Abstract
Computational linguists have traditionally sought to model language by finding underlying parameters which govern numerous examples. I describe a different approach which argues that numerous examples themselves, by virtue of their many possible arrangements, provide the only way to specify a suffic...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!