| Description |
Given:
-
an infinite stream of examples, where
examples are either
-
well-formed sentences of a language, or
-
sentences classified as well-formed or not
well-formed,
-
and
-
a class of languages ₤, where
for each language there exists a procedure
to decide whether a sentence is member of
this language,
-
or a class of automata Å,
where each automata can decide whether a
given sentence is accepted.
Find the language L ∈ ₤ / the automaton
A ∈ Å, that generates / accepts all
well-formed sentences.
The most interesting language, of course, is natural
language. However, most methods learn much more restricted
classes of languages, e.g. pattern languages (i.e. sets of
strings).
|
