000 04301nam a22005895i 4500
001 978-3-540-68707-8
003 DE-He213
005 20240423132550.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540687078
_9978-3-540-68707-8
024 7 _a10.1007/BFb0054058
_2doi
050 4 _aQA76.9.N38
072 7 _aUYQL
_2bicssc
072 7 _aCOM073000
_2bisacsh
072 7 _aUYQL
_2thema
082 0 4 _a006.35
_223
245 1 0 _aGrammatical Inference
_h[electronic resource] :
_b4th International Colloquium, ICGI-98, Ames, Iowa, USA, July 12-14, 1998, Proceedings /
_cedited by Vasant Honavar, Giora Slutzki.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aXI, 277 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1433
505 0 _aResults of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm -- Learning k-variable pattern languages efficiently stochastically finite on average from positive data -- Meaning helps learning syntax -- A polynomial time incremental algorithm for learning DFA -- The data driven approach applied to the OSTIA algorithm -- Grammar model and grammar induction in the system NL PAGE -- Approximate learning of random subsequential transducers -- Learning stochastic finite automata from experts -- Learning a deterministic finite automaton with a recurrent neural network -- Applying grammatical inference in learning a language model for oral dialogue -- Real language learning -- A stochastic search approach to grammar induction -- Transducer-learning experiments on language understanding -- Locally threshold testable languages in strict sense: Application to the inference problem -- Learning a subclass of linear languages from positive structural information -- Grammatical inference in document recognition -- Stochastic inference of regular tree languages -- How considering incompatible state mergings may reduce the DFA induction search tree -- Learning regular grammars to model musical style: Comparing different coding schemes -- Learning a subclass of context-free languages -- Using symbol clustering to improve probabilistic automaton inference -- A performance evaluation of automatic survey classifiers -- Pattern discovery in biosequences.
520 _aThis book constitutes the refereed proceedings of the Fourth International Colloquium on Grammatical Inference, ICGI-98, held in Ames, Iowa, in July 1998. The 23 revised full papers were carefully reviewed and selected for inclusion in the book from a total of 35 submissions. The book addresses a wide range of grammatical inference theory such as automata induction, grammar induction, automatic language acquisition, etc. as well as a variety of applications in areas like syntactic pattern recognition, adaptive intelligent agents, diagnosis, computational biology, data mining, and knowledge discovery.
650 0 _aNatural language processing (Computer science).
650 0 _aPattern recognition systems.
650 0 _aArtificial intelligence.
650 0 _aMachine theory.
650 1 4 _aNatural Language Processing (NLP).
650 2 4 _aAutomated Pattern Recognition.
650 2 4 _aArtificial Intelligence.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aHonavar, Vasant.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSlutzki, Giora.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540647768
776 0 8 _iPrinted edition:
_z9783662200049
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1433
856 4 0 _uhttps://doi.org/10.1007/BFb0054058
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189179
_d189179