Sciweavers

1343 search results - page 26 / 269
» Learning to Complete Sentences
Sort
View
CTRS
1990
15 years 8 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
ECCV
2010
Springer
15 years 8 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
NAACL
2010
15 years 2 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
FLAIRS
2007
15 years 6 months ago
A Machine Learning Approach to Personal Pronoun Resolution in Turkish
In this paper, we present a machine learning based approach for estimating antecedents of anaphorically used personal pronouns in Turkish sentences using a decision tree classific...
Savas Yildirim, Yilmaz Kiliçaslan
IJCNN
2007
IEEE
15 years 10 months ago
Encoding Complete Body Models Enables Task Dependent Optimal Behavior
— Many neural network models of (human) motor learning focus on the acquisition of direct goal-to-action mappings, which results in rather inflexible motor control programs. We ...
Oliver Herbort, Martin V. Butz