Sciweavers

482 search results - page 12 / 97
» Structural Equations in Language Learning
Sort
View
PARLE
1987
13 years 11 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
IUI
2006
ACM
14 years 1 months ago
Interactive learning of structural shape descriptions from automatically generated near-miss examples
Sketch interfaces provide more natural interaction than the traditional mouse and palette tool, but can be time consuming to build if they have to be built anew for each new domai...
Tracy Hammond, Randall Davis
NN
2007
Springer
162views Neural Networks» more  NN 2007»
13 years 7 months ago
Learning grammatical structure with Echo State Networks
Echo State Networks (ESNs) have been shown to be effective for a number of tasks, including motor control, dynamic time series prediction, and memorizing musical sequences. Howeve...
Matthew H. Tong, Adam D. Bickett, Eric M. Christia...
ALIFE
2010
13 years 6 months ago
Modeling Social Learning of Language and Skills
We present a model of social learning of both language and skills, while assuming—insofar as possible—strict autonomy, virtual embodiment, and situatedness. This model is built...
Paul Vogt, Evert Haasdijk
LREC
2008
140views Education» more  LREC 2008»
13 years 9 months ago
Toward Active Learning in Data Selection: Automatic Discovery of Language Features During Elicitation
Data Selection has emerged as a common issue in language technologies. We define Data Selection as the choosing of a subset of training data that is most effective for a given tas...
Jonathan Clark, Robert E. Frederking, Lori S. Levi...