(Enter summary)
Abstract: Monotonic and dual monotonic language learning from positive as well as from positive
and negative examples is investigated. Three different notions of monotonicity are considered.
Each of them reflects an alternative formalization of the requirement that the
learner has to produce better and better generalizations when fed more and more data on
the concept to be learned. Strong--monotonicity absolutely requires that only better and
better generalizations be produced. Monotonic learning... (Update)
Context of citations to this paper: More
.... some learner can succeed on the pattern languages from noise free informants and on its first guess as to a correct grammar (see [LZK95]) The class 2 Again for language learning from positive data and with learners outputting grammars, a somewhat related negative result...
.... some learner can succeed on the pattern languages from noise free informants and on its first guess as to a correct grammar (see [LZK96] The class of languages formed by taking the union of two pattern languages can be Ex learned from texts [Shi83] however, this class...
Cited by: More
Set-Driven and Rearrangement-Independent Learning of.. - Steffen Lange Htwk (1996)
(Correct)
Incremental Learning from Positive Data - Lange, Zeugmann (1996)
(Correct)
Trading Monotonicity Demands versus Efficiency - Lange, Zeugmann (1995)
(Correct)
Similar documents (at the sentence level):
8.5%: A Guided Tour Across the Boundaries of Learning Recursive.. - Zeugmann, Lange (1994)
(Correct)
8.3%: Class Preserving Monotonic and Dual Monotonic Language Learning - Lange, Zeugmann, al. (1992)
(Correct)
7.1%: Characterizations of Monotonic and Dual Monotonic Language.. - Zeugmann, Lange (1995)
(Correct)
Active bibliography (related documents): More All
5.3: Two Variations of Inductive Inference of Languages from.. - Tabe, Zeugmann (1995)
(Correct)
1.0: Characterizations of Class Preserving Monotonic and Dual.. - Zeugmann, Kapur (1994)
(Correct)
0.8: Characterization of Language Learning from Informant under.. - Lange, Zeugmann (1994)
(Correct)
Similar documents based on text: More All
0.5: A Collection of Approaches to Algorithmic Learning .. - O. Arnold, V.. (1996)
(Correct)
0.5: A Unifying Approach to Monotonic Language Learning on Informant - Lange, Zeugmann (1992)
(Correct)
0.5: Refined Incremental Learning - Lange, Zeugmann
(Correct)
Related documents from co-citation: More All
9: Language identification in the limit (context) - Gold - 1967
9: Inductive inference of formal languages from positive data (context) - Angluin - 1980
7: Toward a mathematical theory of inductive inference (context) - Blum, Blum - 1975
BibTeX entry: (Update)
Lange, S., Zeugmann, T., and Kapur, S. (1992), Monotonic and dual monotonic language learning, to appear in Theoretical Computer Science. A prelimary version appeared as GOSLER-Report 14/94, TH Leipzig, FB Mathematik und Informatik, August 1992. http://citeseer.ist.psu.edu/lange92monotonic.html More
@article{ lange96monotonic,
author = "Steffen Lange and Thomas Zeugmann and Shyam Kapur",
title = "Monotonic and dual monotonic language learning",
journal = "Theoretical Computer Science",
volume = "155",
number = "2",
pages = "365--410",
year = "1996",
url = "citeseer.ist.psu.edu/lange92monotonic.html" }
Citations (may not include all citations):
412
Language identification in the limit (context) - Gold - 1967
190
Inductive inference: theory and methods (context) - Angluin, Smith - 1983
169
A formal theory of inductive inference (context) - Solomonoff - 1964
156
Inductive inference of formal languages from positive data (context) - Angluin - 1980
144
Computational limitations on learning from examples (context) - Pitt, Valiant
142
Finding patterns common to a set of strings (context) - Angluin - 1980
134
Formal Languages and their Relation to Automata (context) - Hopcroft, Ullman - 1979
113
Toward a mathematical theory of inductive inference (context) - Blum, Blum - 1975
87
Nonmonotonic Reasoning: Logical Foundations of Commonsense (context) - Brewka - 1991
71
An Introduction to the General Theory of Algorithms (context) - Machtey, Young - 1978
61
Polynomial-time inference of arbitrary pattern languages (context) - Lange, Wiehagen - 1991
43
A guided tour across the boundaries of learning recursive la..
- Zeugmann, Lange - 1995
40
An Artificial Intelligence Approach (context) - Michalski, Carbonell et al. - 1984
40
An Artificial Intelligence Approach (context) - Michalski, Carbonell et al. - 1986
40
An Artificial Intelligence Approach (context) - Kodratoff, Michalski et al. - 1990
36
A polynomial-time algorithm for learning k--variable pattern.. (context) - Kearns, Pitt - 1989
35
Machine inductive inference and language identification (context) - Case, Lynes - 1982
34
Limes--Erkennung rekursiver Funktionen durch spezielle Strat.. (context) - Wiehagen - 1976
32
Polynomial time inference of extended regular pattern langua.. (context) - Shinohara - 1982
30
Monotonic and non-monotonic inductive inference of functions.. (context) - Jantke - 1991
30
Monotonic and non--monotonic inductive inference (context) - Jantke - 1991
28
Language learning in dependence on the space of hypotheses
- Lange, Zeugmann - 1993
27
The power of vacillation (context) - Case - 1988
25
Monotonic versus non-monotonic language learning
- Lange, Zeugmann - 1993
24
Learning recursive languages with bounded mind changes
- Lange, Zeugmann - 1993
24
Prudence and other restrictions in formal language learning (context) - Fulk - 1990
23
Ignoring data may be the only way to learn efficiently
- Wiehagen, Zeugmann - 1994
23
An Introduction to Learning Theory for Cognitive and Compute.. (context) - Osherson, Stob et al. - 1986
22
Characterizations of monotonic and dual monotonic language l..
- Zeugmann, Lange et al. - 1995
21
Formal inductive inference (context) - Angluin, Smith - 1987
20
Identification of formal languages (context) - Wiehagen - 1977
18
Inclusion is undecidable for pattern languages (context) - Jiang, Salomaa et al. - 1993
17
Learning functions of k terms (context) - Blum, Singh - 1990
17
Learning string patterns and tree patterns from examples (context) - Ko, Marron et al. - 1990
14
Inductive inference of automata (context) - Barzdin - 1974
12
A thesis in inductive inference (context) - Wiehagen - 1991
10
Department of Computer Science (context) - Nix, examples et al. - 1983
9
Recursion theoretic characterizations of language learning (context) - Jain, Sharma
5
Characterization of language learning on informant under var.. (context) - Lange, Zeugmann - 1994
5
Fachbereich Mathematik und Informatik (context) - Lange, Zeugmann et al. - 1992
5
The representation of recursive languages and its impact on .. (context) - Lange - 1994
4
Personal Communication (context) - Beick - 1991
4
Fundamental Studies in Computer Science (context) - Trakhtenbrot, Barzdin et al. - 1973
4
the impact of order independence to the learnability of recu..
- Lange, Zeugmann - 1993
3
The learnability of recursive languages in dependence on the.. (context) - Lange, Zeugmann - 1993
2
and M.K. Warmuth (eds.), Proc. of the 2nd Annual Workshop on.. (context) - Rivest, Haussler - 1989
2
rd International Workshop on Analogical and Inductive Infere.. (context) - Jantke, Proc - 1992
2
rd Annual Workshop on Computational Learning Theory (context) - Fulk, Case et al. - 1990
2
of the 5th Annual Workshop on Computational Learning Theory (context) - Haussler, Proc - 1992
2
nd International Workshop on Analogical and Inductive Infere.. (context) - Jantke, Proc - 1989
2
and T. Sato (eds.), Proc. of the 2nd International Workshop .. (context) - Arikawa, Maruoka - 1991
2
Computer Science Department Technical Report (context) - Kapur, of et al. - 1991
2
st International Workshop on Algorithmic Learning Theory (context) - Arikawa, Goto et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.tcs.mu-luebeck.de/pages/thomas/altselect.jhtml): More
Learning Languages and Functions by Erasing - Jain, Kinber, Lange, Wiehagen, ..
(Correct)
Lange and Wiehagen's Pattern Language Learning Algorithm: An.. - Zeugmann (1996)
(Correct)
Learning One-Variable Pattern Languages in Linear Average Time - Reischuk, Zeugmann (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC