Sciweavers

482 search results - page 41 / 97
» Structural Equations in Language Learning
Sort
View
PEPM
2011
ACM
12 years 10 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
IANDC
2006
101views more  IANDC 2006»
13 years 7 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte
NIPS
2008
13 years 9 months ago
Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text
In this paper, we address the question of what kind of knowledge is generally transferable from unlabeled text. We suggest and analyze the semantic correlation of words as a gener...
Yi Zhang 0010, Jeff Schneider, Artur Dubrawski
ECML
2006
Springer
13 years 9 months ago
Distributional Features for Text Categorization
Abstract-- Text categorization is the task of assigning predefined categories to natural language text. With the widely used `bag of words' representation, previous researches...
Xiao-Bing Xue, Zhi-Hua Zhou
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon