38 search results - page 1 / 8 » Automatic State Machine Induction for String Recognition |
WCE
2007
13 years 5 months ago
2007
—One problem of generating a model to recognize any string is how to generate one that is generalized enough to accept strings with similar patterns and, at the same time, is spe...
ACL
2009
13 years 2 months ago
2009
This paper presents three methods that can be used to recognize paraphrases. They all employ string similarity measures apshallow abstractions of the input sentences, and a Maximu...
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
13 years 8 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 1 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
The paper addresses the question whether it is possible for a machine to learn to distinguish and recognise famous musicians (concert pianists), based on their style of playing. We...