Grammatical inference : algorithms and applications (Amsterdam, 23-25 September 2002)Adriaans, Pieter; Fernau, Henning; van Zaanen, Menno et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44239-1, IX, 314 p, isbn 3-540-44239-1Conference Proceedings

On limit points for some variants of rigid Lambek grammarsFORET, Annie; LE NIR, Yannick.Lecture notes in computer science. 2002, pp 106-119, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Learning languages with helpKERMORVANT, Christopher; DE LA HIGUERA, Colin.Lecture notes in computer science. 2002, pp 161-173, issn 0302-9743, isbn 3-540-44239-1, 13 p.Conference Paper

Fragmentation: Enhancing identifiabilityFERNAU, Henning.Lecture notes in computer science. 2002, pp 92-105, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Incremental learning of context free grammarsNAKAMURA, Katsuhiko; MATSUMOTO, Masashi.Lecture notes in computer science. 2002, pp 174-184, issn 0302-9743, isbn 3-540-44239-1, 11 p.Conference Paper

A PAC learnability of simple deterministic languagesTAJIMAL, Yasuhiro; TERADA, Matsuaki.Lecture notes in computer science. 2002, pp 249-260, issn 0302-9743, isbn 3-540-44239-1, 12 p.Conference Paper

A framework for Inductive learning of typed-unification grammarsCIORTUZ, Liviu.Lecture notes in computer science. 2002, pp 299-302, issn 0302-9743, isbn 3-540-44239-1, 4 p.Conference Paper

The EMILE 4.1 grammar induction toolboxADRIAANS, Pieter; VERVOORT, Marco.Lecture notes in computer science. 2002, pp 293-295, issn 0302-9743, isbn 3-540-44239-1, 3 p.Conference Paper

Fast learning from strings of 2-letter rigid grammarsSEGINER, Yoav.Lecture notes in computer science. 2002, pp 213-224, issn 0302-9743, isbn 3-540-44239-1, 12 p.Conference Paper

Implementing alignment-based LearningVAN ZAANEN, Menno.Lecture notes in computer science. 2002, pp 312-314, issn 0302-9743, isbn 3-540-44239-1, 3 p.Conference Paper

Lyrebird<^TM> : Developing spoken dialog systems using examplesSTARKIE, Bradford; FINDLOW, Greg; KHANH HO et al.Lecture notes in computer science. 2002, pp 309-311, issn 0302-9743, isbn 3-540-44239-1, 3 p.Conference Paper

On the learnability of hidden Markov modelsTERWIJN, Sebastiaan A.Lecture notes in computer science. 2002, pp 261-268, issn 0302-9743, isbn 3-540-44239-1, 8 p.Conference Paper

Estimating grammar parameters using bounded memoryOATES, Tim; HEERINGA, Brent.Lecture notes in computer science. 2002, pp 185-198, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Stochastic k-testable tree languages and applicationsRICO-JUAN, Juan Ramon; CALERA-RUBIO, Jorge; CARRASCO, Rafael C et al.Lecture notes in computer science. 2002, pp 199-212, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

PCFG Learning by nonterminal Partition SearchBELZ, Ania.Lecture notes in computer science. 2002, pp 14-27, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Learning Probabilistic Residual Finite State AutomataESPOSITO, Yann; LEMAY, Aurélien; DENIS, Francois et al.Lecture notes in computer science. 2002, pp 77-91, issn 0302-9743, isbn 3-540-44239-1, 15 p.Conference Paper

Beyond EDSMCICCHELLO, Orlando; KREMER, Stefan C.Lecture notes in computer science. 2002, pp 37-48, issn 0302-9743, isbn 3-540-44239-1, 12 p.Conference Paper

Learning of regular Bi-w languagesTHOMAS, D. G; HUMROSIA BEGAM, M; SUBRAMANIAN, K. G et al.Lecture notes in computer science. 2002, pp 283-292, issn 0302-9743, isbn 3-540-44239-1, 10 p.Conference Paper

'NAIL': Artificial intelligence software for learning natural languageLIEVESLEY, Sam; ATWELL, Eric.Lecture notes in computer science. 2002, pp 306-308, issn 0302-9743, isbn 3-540-44239-1, 3 p.Conference Paper

Shallow parsing using probabilistic grammatical inferenceTHOLLARD, Franck; CLARK, Alexander.Lecture notes in computer science. 2002, pp 269-282, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Stochastic grammatical inference with multinomial testsKERMORVANT, Christopher; DUPONT, Pierre.Lecture notes in computer science. 2002, pp 149-160, issn 0302-9743, isbn 3-540-44239-1, 12 p.Conference Paper

Some classes of regular languages identifiable in the limit from positive dataDENIAL, Francois; LEMAY, Aurélien; TERLUTTE, Alain et al.Lecture notes in computer science. 2002, pp 63-76, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

On sufficient conditions to identify in the limit classes of grammars from polynomial time and dataDE LA HIGUERA, Colin; ONCINA, Jose.Lecture notes in computer science. 2002, pp 134-148, issn 0302-9743, isbn 3-540-44239-1, 15 p.Conference Paper

Inferring subclasses of regular languages faster using RPNI and forbidden configurationsCANO, Antonio; RUIZ, Josh; GARCIA, Pedro et al.Lecture notes in computer science. 2002, pp 28-36, issn 0302-9743, isbn 3-540-44239-1, 9 p.Conference Paper

Consistent identification in the limit of rigid grammars from strings is NP-hardCOSTA FLORENCIO, Christophe.Lecture notes in computer science. 2002, pp 49-62, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper