書目名稱Grammatical Inference: Algorithms and Applications影響因子(影響力)學(xué)科排名
書目名稱Grammatical Inference: Algorithms and Applications網(wǎng)絡(luò)公開度
書目名稱Grammatical Inference: Algorithms and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Grammatical Inference: Algorithms and Applications被引頻次
書目名稱Grammatical Inference: Algorithms and Applications被引頻次學(xué)科排名
書目名稱Grammatical Inference: Algorithms and Applications年度引用
書目名稱Grammatical Inference: Algorithms and Applications年度引用學(xué)科排名
書目名稱Grammatical Inference: Algorithms and Applications讀者反饋
書目名稱Grammatical Inference: Algorithms and Applications讀者反饋學(xué)科排名
作者: jet-lag 時間: 2025-3-22 00:08 作者: rectum 時間: 2025-3-22 02:09
Learning Context-Free Grammars from Partially Structured Examples,rom partially structured examples can identify a context-free grammar having the intended structure and is more flexible and applicable than the learning methods from completely structured examples [5].作者: 疲勞 時間: 2025-3-22 05:52
Troubling Our Heads about Ichabod,gular language . from any sample . which contains S.. We think that working on non deterministic automata will allow, in a great amount of cases, to reduce the size of the characteristic sample. This is already true for some languages for which the sample needed by DeLete is far smaller than the one needed by classical algorithms.作者: 使害羞 時間: 2025-3-22 09:23
https://doi.org/10.1057/9780230510128raction levels for the pattern discovery process. The results of the previous step then are used to induce temporal grammatical rules at different abstraction levels. This approach was successfully applied to a problem in medicine, called sleep apnea.作者: Obstacle 時間: 2025-3-22 14:06 作者: Obstacle 時間: 2025-3-22 19:46
The Induction of Temporal Grammatical Rules from Multivariate Time Series,raction levels for the pattern discovery process. The results of the previous step then are used to induce temporal grammatical rules at different abstraction levels. This approach was successfully applied to a problem in medicine, called sleep apnea.作者: 詼諧 時間: 2025-3-22 22:56 作者: 才能 時間: 2025-3-23 04:31 作者: DOTE 時間: 2025-3-23 06:44
Effects of Excessive Androgen Use and Abusethe standard PAC model have been shown to be learnable in these models. In this paper we identify the relationships between these different learning models. We also address the issue of unnatural collusion between the teacher and the learner that can potentially trivialize the task of learning in helpful environments.作者: 民間傳說 時間: 2025-3-23 10:12 作者: 卜聞 時間: 2025-3-23 16:08 作者: dialect 時間: 2025-3-23 20:26
On the Relationship between Models for Learning in Helpful Environments,the standard PAC model have been shown to be learnable in these models. In this paper we identify the relationships between these different learning models. We also address the issue of unnatural collusion between the teacher and the learner that can potentially trivialize the task of learning in helpful environments.作者: Estrogen 時間: 2025-3-24 01:21 作者: Femine 時間: 2025-3-24 05:39 作者: 名字的誤用 時間: 2025-3-24 06:52
An American “Sputnik” for the Russians?able languages in the strict sense just as example language classes. This paper also proposes a framework for defining language classes based on iterated transductions. We believe that the framework is quite adequate for theoretically investigate the classes of languages which are efficiently learnable from positive data.作者: 返老還童 時間: 2025-3-24 12:16
https://doi.org/10.1057/978-1-137-57555-5which generates minimal production rules required for parsing positive samples. Synapse can generate unambiguous grammars as well as ambiguous grammars. Some experiments showed that . can synthesize several simple context free grammars in considerably short time.作者: Consensus 時間: 2025-3-24 16:23
Metabolic Syndrome: The Vicious Cycle, the model can be updated in an incremental fashion. This method is an alternative to costly learning algorithms (as inside-outside-based methods) or algorithms that require larger samples (as many state merging/splitting methods).作者: 一大群 時間: 2025-3-24 21:13 作者: Incumbent 時間: 2025-3-25 02:24 作者: Abnormal 時間: 2025-3-25 07:04
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View,able languages in the strict sense just as example language classes. This paper also proposes a framework for defining language classes based on iterated transductions. We believe that the framework is quite adequate for theoretically investigate the classes of languages which are efficiently learnable from positive data.作者: 必死 時間: 2025-3-25 10:07
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm,which generates minimal production rules required for parsing positive samples. Synapse can generate unambiguous grammars as well as ambiguous grammars. Some experiments showed that . can synthesize several simple context free grammars in considerably short time.作者: NUL 時間: 2025-3-25 15:36 作者: Barrister 時間: 2025-3-25 18:07
Memristors and Memristive Systemsrs and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer..The proposed method was assessed through a series of experiments within the f作者: 食品室 時間: 2025-3-25 22:01
e more used than determinism grammars. Computing the probability of parsing a given string or its most probable parse with . can be performed in linear time. However, the problem of finding the most probable string has yet not given any satisfactory answer. In this paper we prove that the problem is作者: Parameter 時間: 2025-3-26 01:43
Prison Setting and Sexual Sceneider this problem as a particular case of the inference of unambiguous finite state classifier. We are then able to present an efficient incompatibility NFA detection framework for state merging inference process.作者: 極力證明 時間: 2025-3-26 05:22
Troubling Our Heads about Ichabod,omata class and shares with it a fundamental property : the existence of a canonical minimal form for any regular language. We also define a notion of characteristic sample S. for a given regular language . and a learning algorithm (DeLeTe). We show that DeLeTe can produce the canonical RFSA of a re作者: 半圓鑿 時間: 2025-3-26 12:01
Guidelines for Assessment and Treatment,ton is a statistical estimation problem, the usual data sparseness problem arises. We propose here the use of an error correcting technique for smoothing automata. This technique is based on a symbol dependent error model which guarantees that any possible string can be predicted with a non-zero pro作者: 尊嚴(yán) 時間: 2025-3-26 14:46 作者: Harness 時間: 2025-3-26 18:44 作者: 易碎 時間: 2025-3-27 00:59 作者: MELD 時間: 2025-3-27 02:08
https://doi.org/10.1007/978-3-319-30097-9Trakhenbrot and Barzdin/Gold by one hand and the ./Lang algorithm by the other. As a previous step, for a better comparison, we formulate the algorithm of Gold as a merging states in the prefix tree acceptor scheme.作者: 龍蝦 時間: 2025-3-27 06:42 作者: 假裝是我 時間: 2025-3-27 13:26 作者: KIN 時間: 2025-3-27 13:44
An American “Sputnik” for the Russians?ficiently learnable in the limit from positive data. Furthermore, the set contains the class of .-reversible languages and the class of .-locally testable languages in the strict sense just as example language classes. This paper also proposes a framework for defining language classes based on itera作者: Alveolar-Bone 時間: 2025-3-27 20:54
https://doi.org/10.1057/978-1-137-57555-5nference system called .. The method is based on incremental learning for positive samples and a rule generation method by “inductive CYK algorithm,” which generates minimal production rules required for parsing positive samples. Synapse can generate unambiguous grammars as well as ambiguous grammar作者: 完成才能戰(zhàn)勝 時間: 2025-3-27 22:12
https://doi.org/10.1057/9781137346346aximize a certain criterion function from a training sample by using gradient descendent techniques. In this optimization process, the obtaining of the initial SCFGs is an important factor, given that it affects the convergence process and the maximum which can be achieved. Here, we show experimenta作者: Tremor 時間: 2025-3-28 04:18 作者: 關(guān)節(jié)炎 時間: 2025-3-28 08:39
Metabolic Syndrome: The Vicious Cycle,ls, frequencies are estimated for a probabilistic regular tree grammar wich is bottom-up deterministic. One of the advantages of this approach is that the model can be updated in an incremental fashion. This method is an alternative to costly learning algorithms (as inside-outside-based methods) or 作者: aggravate 時間: 2025-3-28 11:32 作者: 脫毛 時間: 2025-3-28 16:10
Inference of Finite-State Transducers by Using Regular Grammars and Morphisms,rs and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer..The proposed method was assessed through a series of experiments within the f作者: 和諧 時間: 2025-3-28 19:42
Computational Complexity of Problems on Probabilistic Grammars and Transducers,e more used than determinism grammars. Computing the probability of parsing a given string or its most probable parse with . can be performed in linear time. However, the problem of finding the most probable string has yet not given any satisfactory answer. In this paper we prove that the problem is作者: 為寵愛 時間: 2025-3-29 01:40 作者: gustation 時間: 2025-3-29 04:29 作者: 嚴(yán)峻考驗 時間: 2025-3-29 09:18 作者: cutlery 時間: 2025-3-29 13:33
Inferring Subclasses of Contextual Languages,s of internal contextual languages, namely, k-uniform and strictly internal contextual languages which are incomparable classes and provide an algorithm to learn these classes. The algorithm can be used when the rules are applied in a parallel mode.作者: 壓碎 時間: 2025-3-29 16:05 作者: 舊病復(fù)發(fā) 時間: 2025-3-29 20:23
Computation of Substring Probabilities in Stochastic Grammars,ern recognition problems concerning the prediction and/or recognition based on partial observations. This paper presents algorithms for the computation of substring probabilities in stochastic regular languages. Situations covered include prefix, suffix and island probabilities. The computational ti作者: 小步走路 時間: 2025-3-30 03:03
A Comparative Study of Two Algorithms for Automata Identification,Trakhenbrot and Barzdin/Gold by one hand and the ./Lang algorithm by the other. As a previous step, for a better comparison, we formulate the algorithm of Gold as a merging states in the prefix tree acceptor scheme.作者: 巡回 時間: 2025-3-30 06:03 作者: 閑蕩 時間: 2025-3-30 12:06 作者: 附錄 時間: 2025-3-30 14:50
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View,ficiently learnable in the limit from positive data. Furthermore, the set contains the class of .-reversible languages and the class of .-locally testable languages in the strict sense just as example language classes. This paper also proposes a framework for defining language classes based on itera作者: 微粒 時間: 2025-3-30 18:36 作者: 共棲 時間: 2025-3-31 00:18
Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Conteaximize a certain criterion function from a training sample by using gradient descendent techniques. In this optimization process, the obtaining of the initial SCFGs is an important factor, given that it affects the convergence process and the maximum which can be achieved. Here, we show experimenta作者: 車床 時間: 2025-3-31 02:15
On the Relationship between Models for Learning in Helpful Environments,nd in the PAC learning framework (concept classes such as . (DFA) are not efficiently learnable in the PAC model). The PAC model’s requirement of learnability under all conceivable distributions could be considered too stringent a restriction for practical applications. Several models for learning i作者: AGONY 時間: 2025-3-31 05:41 作者: cortex 時間: 2025-3-31 11:23 作者: cajole 時間: 2025-3-31 13:39 作者: organism 時間: 2025-3-31 20:03 作者: 生命 時間: 2025-3-31 21:43
https://doi.org/10.1007/978-1-349-16692-3s of internal contextual languages, namely, k-uniform and strictly internal contextual languages which are incomparable classes and provide an algorithm to learn these classes. The algorithm can be used when the rules are applied in a parallel mode.作者: NEG 時間: 2025-4-1 04:52
https://doi.org/10.1057/9781137331809that some of the classes based on these procedures are learnable. The complexity of learning them was still left open..In this paper it is shown that learning some of these classes is NP-hard under certain restrictions.作者: 要控制 時間: 2025-4-1 08:31 作者: 耐寒 時間: 2025-4-1 12:11 作者: 確認(rèn) 時間: 2025-4-1 15:44
Inference of Finite-State Transducers by Using Regular Grammars and Morphisms,rs and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer..The proposed method was assessed through a series of experiments within the framework of the EUTRANS project.
