Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings (Q1850308)
From MaRDI portal
![]() | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings for the user view. |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings |
scientific article |
Statements
Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings (English)
0 references
3 December 2002
0 references
The articles of this volume will be reviewed individually. The preceding colloquium (5th, 2000) has been reviewed (see Zbl 0947.00038). Indexed articles: \textit{Antunes, Cláudia M.; Oliveira, Arlindo L.}, Inference of sequential association rules guided by context-free grammars, 1-13 [Zbl 1028.68573] \textit{Belz, Anja}, PCFG learning by nonterminal partition search, 14-27 [Zbl 1028.68576] \textit{Cano, Antonio; Ruiz, José; García, Pedro}, Inferring subclasses of regular languages faster using RPNI and forbidden configurations, 28-36 [Zbl 1028.68580] \textit{Cicchello, Orlando; Kremer, Stefan C.}, Beyond EDSM, 37-48 [Zbl 1028.68583] \textit{Costa Florênico, Christophe}, Consistent identification in the limit of rigid grammars from strings is NP-hard, 49-62 [Zbl 1028.68111] \textit{Denis, François; Lemay, Aurélien; Terlutte, Alain}, Some classes of regular languages identifiable in the limit from positive data, 63-76 [Zbl 1028.68112] \textit{Esposito, Yann; Lemay, Aurélien; Denis, François; Dupont, Pierre}, Learning probabilistic residual finite state automata, 77-91 [Zbl 1028.68113] \textit{Fernau, Henning}, Fragmentation: Enhancing identifiability, 92-105 [Zbl 1028.68114] \textit{Foret, Annie; Le Nir, Yannick}, On limit points for some variants of rigid Lambek grammars, 106-119 [Zbl 1028.68115] \textit{Habrard, Amaury; Bernard, Marc; Jacquenet, François}, Generalized stochastic tree automata for multi-relational data mining, 120-133 [Zbl 1028.68593] \textit{de la Higuera, Colin; Oncina, Jose}, On sufficient conditions to identify in the limit classes of grammars from polynomial time and data, 134-148 [Zbl 1028.68586] \textit{Kermorvant, Christopher; Dupont, Pierre}, Stochastic grammatical inference with multinomial tests, 149-160 [Zbl 1028.68595] \textit{Kermorvant, Christopher; de la Higuera, Colin}, Learning languages with help, 161-173 [Zbl 1028.68594] \textit{Nakamura, Katsuhiko; Matsumoto, Masashi}, Incremental learning of context free grammars, 174-184 [Zbl 1028.68602] \textit{Oates, Tim; Heeringa, Brent}, Estimating grammar parameters using bounded memory, 185-198 [Zbl 1028.68603] \textit{Rico-Juan, Juan Ramón; Calera-Rubio, Jorge; Carrasco, Rafael C.}, Stochastic \(k\)-testable tree languages and applications, 199-212 [Zbl 1028.68608] \textit{Seginer, Yoav}, Fast learning from strings of 2-letter rigid grammars, 213-224 [Zbl 1028.68611] \textit{Sempere, José M.; García, Pedro}, Learning locally testable even linear languages from positive data, 225-236 [Zbl 1028.68612] \textit{Starkie, Bradford}, Inferring attribute grammars with structured data for natural language processing, 237-248 [Zbl 1028.68614] \textit{Tajima, Yasuhiro; Terada, Matsuaki}, A PAC learnability of simple deterministic languages, 249-260 [Zbl 1028.68615] \textit{Terwijn, Sebastiaan A.}, On the learnability of hidden Markov models, 261-268 [Zbl 1028.68616] \textit{Thollard, Franck; Clark, Alexander}, Shallow parsing using probabilistic grammatical inference, 269-282 [Zbl 1028.68617] \textit{Thomas, D. G.; Humrosia Begam, M.; Subramanian, K. G.; Gnanasekaran, S.}, Learning of regular bi-\(\omega\) languages, 283-292 [Zbl 1028.68130] \textit{Adriaans, Pieter; Vervoort, Marco}, The EMILE 4. 1 grammar induction toolbox, 293-295 [Zbl 1028.68571] \textit{Chalup, Stephan K.; Blair, Alan D.}, Software for analysing recurrent neural nets that learn to predict non-regular languages, 296-298 [Zbl 1028.68581] \textit{Ciortuz, Liviu}, A framework for inductive learning of typed-unification grammars, 299-302 [Zbl 1028.68584] \textit{Dudau Sofronie, Daniela; Tellier, Isabelle; Tommasi, Marc}, A tool for language learning based on categorial grammars and semantic information, 303-305 [Zbl 1028.68587] \textit{Lievesley, Sam; Atwell, Eric}, `NAIL': Artificial intelligence software for learning natural language, 306-308 [Zbl 1028.68597] \textit{Starkie, Bradford; Findlow, Greg; Ho, Khanh; Hui, Alvaro; Law, Lawrence; Lightwood, Liron; Michnowicz, Simon; Walder, Christian}, Lyrebird\(^{\text{TM}}\): Developing spoken dialog systems using examples, 309-311 [Zbl 1028.68613] \textit{van Zaanen, Menno}, Implementing alignment-based learning, 312-314 [Zbl 1028.68621]
0 references
Amsterdam (Netherlands)
0 references
Proceedings
0 references
Colloquium
0 references
ICGI 2002
0 references
Grammatical inference
0 references