Sciweavers

3 search results - page 1 / 1
» Inductive inference from noisy examples using the hybrid fin...
Sort
View
TNN
1998
92views more  TNN 1998»
13 years 5 months ago
Inductive inference from noisy examples using the hybrid finite state filter
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
Marco Gori, Marco Maggini, Enrico Martinelli, Giov...
DKE
2006
139views more  DKE 2006»
13 years 5 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
GRC
2005
IEEE
13 years 11 months ago
An evolution strategy for the induction of fuzzy finite-state automata
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
Zhiwen Mo, Min Wan, Lan Shu