書目名稱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é)科排名
作者: 全面 時(shí)間: 2025-3-21 22:43
Ten Open Problems in Grammatical Inferenceical questions. They cover the areas of polynomial learning models, learning from ordered alphabets, learning deterministic .s, learning negotiation processes, learning from context-free background knowledge.作者: Cocker 時(shí)間: 2025-3-22 03:39 作者: monochromatic 時(shí)間: 2025-3-22 07:49 作者: macular-edema 時(shí)間: 2025-3-22 09:40 作者: 巨頭 時(shí)間: 2025-3-22 16:35 作者: 巨頭 時(shí)間: 2025-3-22 17:44
Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Modelnt semantic analysis (PLSA) for the purpose of statistical language modeling. The SLM is essentially a generalization of shift-reduce probabilistic push-down automata thus more complex and powerful than probabilistic context free grammars (PCFGs). The added context-sensitiveness due to trigrams and 作者: initiate 時(shí)間: 2025-3-22 23:14 作者: Omnipotent 時(shí)間: 2025-3-23 03:24
Learning Analysis by Reduction from Positive Datapaper we propose a method for learning restarting automata which are strictly locally testable (.-.-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by .-.-automata with respect to the Choms作者: 使堅(jiān)硬 時(shí)間: 2025-3-23 09:00 作者: 厭惡 時(shí)間: 2025-3-23 10:42 作者: faultfinder 時(shí)間: 2025-3-23 17:05 作者: 可行 時(shí)間: 2025-3-23 22:01
Protein Motif Prediction by Grammatical Inferenceis very important the development of tools to locate, within protein sequences, those subsequences with an associated function or specific feature. In our work, we propose a method to predict one of those functional motifs (coiled coil), related with protein interaction. Our approach uses even linea作者: 傳染 時(shí)間: 2025-3-23 22:30
Grammatical Inference in Practice: A Case Study in the Biomedical Domainructing a grammar underlying a given text source. It has been noted that the rules produced by GI can also be interpreted semantically [16] where a non-terminal describes interchangeable elements which are the instances of the same concepts. Such an observation leads to the hypothesis that GI might 作者: emulsify 時(shí)間: 2025-3-24 03:51
Inferring Grammar Rules of Programming Language Dialectst asset because it is used in developing many software engineering tools. Sometimes, grammars of languages are not available and have to be inferred from the source code; especially in the case of programming language dialects. We propose an approach for inferring the grammar of a programming langua作者: 戲法 時(shí)間: 2025-3-24 09:23 作者: 樹木中 時(shí)間: 2025-3-24 13:50
Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1ic finite state transducers, and discuss the design of the algorithms and the design and implementation of the program that solved the first problem. Though the OSTIA algorithm has good asymptotic guarantees for this class of problems, the amount of data required is prohibitive. We therefore develop作者: 低三下四之人 時(shí)間: 2025-3-24 15:34 作者: 的’ 時(shí)間: 2025-3-24 20:17 作者: tenosynovitis 時(shí)間: 2025-3-25 02:28
https://doi.org/10.1057/9780230287129ery simple grammars called ., and presents an algorithm that identifies right-unique simple grammars in the limit from positive data. The learning algorithm possesses the following three properties. It computes a conjecture in polynomial time in the size of the input data if we regard the cardinalit作者: 切掉 時(shí)間: 2025-3-25 04:13
The Impact of Interoception on Memoryrings of the language and the non-terminals of the grammar. We show that when the distribution of samples is generated by a PCFG, based on the same grammar as the target language, the class of unambiguous NTS languages is PAC-learnable from positive data alone, with polynomial bounds on data and com作者: 彎曲道理 時(shí)間: 2025-3-25 07:52
Proust, the Madeleine and Memorythe system are incremental learning, rule generation based on bottom-up parsing of positive samples, and search for rule sets. From the results of parsing, a rule generation process, called “bridging,” synthesizes the production rules that make up any lacking parts of an incomplete derivation tree f作者: 不能平靜 時(shí)間: 2025-3-25 14:38 作者: 脾氣暴躁的人 時(shí)間: 2025-3-25 17:15
Pacifism on the Precipice of Warnt semantic analysis (PLSA) for the purpose of statistical language modeling. The SLM is essentially a generalization of shift-reduce probabilistic push-down automata thus more complex and powerful than probabilistic context free grammars (PCFGs). The added context-sensitiveness due to trigrams and 作者: obsession 時(shí)間: 2025-3-25 20:43 作者: 許可 時(shí)間: 2025-3-26 00:21 作者: 恃強(qiáng)凌弱的人 時(shí)間: 2025-3-26 05:18 作者: Antigen 時(shí)間: 2025-3-26 11:56 作者: Trabeculoplasty 時(shí)間: 2025-3-26 15:57 作者: 破譯密碼 時(shí)間: 2025-3-26 16:55
is very important the development of tools to locate, within protein sequences, those subsequences with an associated function or specific feature. In our work, we propose a method to predict one of those functional motifs (coiled coil), related with protein interaction. Our approach uses even linea作者: Modicum 時(shí)間: 2025-3-26 22:29
Reduction of the Number of Variables,ructing a grammar underlying a given text source. It has been noted that the rules produced by GI can also be interpreted semantically [16] where a non-terminal describes interchangeable elements which are the instances of the same concepts. Such an observation leads to the hypothesis that GI might 作者: 蔑視 時(shí)間: 2025-3-27 04:57 作者: 散布 時(shí)間: 2025-3-27 06:48 作者: 小教堂 時(shí)間: 2025-3-27 12:45
Abdullah G. Alharbi,Masud H. Chowdhuryic finite state transducers, and discuss the design of the algorithms and the design and implementation of the program that solved the first problem. Though the OSTIA algorithm has good asymptotic guarantees for this class of problems, the amount of data required is prohibitive. We therefore develop作者: 消音器 時(shí)間: 2025-3-27 15:01
Abdullah G. Alharbi,Masud H. Chowdhuryed a new strategy for inferring large scale transducers that is more adapted for large random instances of the type in question, which involved combining traditional state merging algorithms for inference of finite state automata with EM based alignment algorithms and state splitting algorithms.作者: corpuscle 時(shí)間: 2025-3-27 20:48
Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1ed a new strategy for inferring large scale transducers that is more adapted for large random instances of the type in question, which involved combining traditional state merging algorithms for inference of finite state automata with EM based alignment algorithms and state splitting algorithms.作者: GULP 時(shí)間: 2025-3-27 22:06
Remembering to Forget/Forgetting to Remembericient condition for . to be identifiable in the limit from positive data and we present a unified identification algorithm for it. Furthermore, we show that some proper subclasses of . are polynomial time identifiable in the limit from positive data in the sense of Yokomori.作者: 激勵(lì) 時(shí)間: 2025-3-28 03:25 作者: Exaggerate 時(shí)間: 2025-3-28 08:39 作者: travail 時(shí)間: 2025-3-28 11:49
Protein Motif Prediction by Grammatical Inference our work, we propose a method to predict one of those functional motifs (coiled coil), related with protein interaction. Our approach uses even linear languages inference to obtain a transductor which will be used to label unknown sequences. The experiments carried out show that our method outperforms the results of previous approaches.作者: hauteur 時(shí)間: 2025-3-28 15:37 作者: 牢騷 時(shí)間: 2025-3-28 20:25 作者: 小步舞 時(shí)間: 2025-3-29 01:38 作者: 占卜者 時(shí)間: 2025-3-29 03:31 作者: arterioles 時(shí)間: 2025-3-29 08:25 作者: 無關(guān)緊要 時(shí)間: 2025-3-29 14:25
Reduction of the Number of Variables,the way such relations are expressed linguistically..Throughout the paper, we propose a general framework for using GI for named entity recognition by discussing several possible approaches. In addition, we demonstrate that these methods successfully work on biomedical data using an existing GI tool.作者: 暴行 時(shí)間: 2025-3-29 17:53 作者: 步履蹣跚 時(shí)間: 2025-3-29 20:28
Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data provided example contradicts the previous conjecture. The algorithm has a sub-algorithm that solves the inclusion problem for a superclass of right-unique simple grammars, which is also presented in this paper.作者: NOCT 時(shí)間: 2025-3-30 00:25 作者: 松軟 時(shí)間: 2025-3-30 06:42
Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Modelbly intractable, however the analysis of the behavior of the lexical and semantic enhanced structural language model leads to a generalized inside-outside algorithm and thus to rigorous exact EM type re-estimation of the composite language model parameters.作者: disparage 時(shí)間: 2025-3-30 09:22 作者: 禁止,切斷 時(shí)間: 2025-3-30 13:21 作者: 戰(zhàn)勝 時(shí)間: 2025-3-30 20:04
Grammatical Inference in Practice: A Case Study in the Biomedical Domainthe way such relations are expressed linguistically..Throughout the paper, we propose a general framework for using GI for named entity recognition by discussing several possible approaches. In addition, we demonstrate that these methods successfully work on biomedical data using an existing GI tool.作者: insincerity 時(shí)間: 2025-3-30 20:56 作者: commute 時(shí)間: 2025-3-31 03:12 作者: HUMID 時(shí)間: 2025-3-31 06:42 作者: Limpid 時(shí)間: 2025-3-31 10:44
Colleen M. Kelley,Benjamin R. Stephensvaluation order, i.e. an order in which the rules are evaluated for correctness. A set of rules are correct if their addition makes the grammar complete. Experiments show that the proposed rule evaluation order improves the process of grammar inference.作者: CODE 時(shí)間: 2025-3-31 15:42 作者: 緩解 時(shí)間: 2025-3-31 18:28 作者: 機(jī)構(gòu) 時(shí)間: 2025-4-1 00:39 作者: Recess 時(shí)間: 2025-4-1 01:53 作者: extinguish 時(shí)間: 2025-4-1 07:24
Lovorka Gruic Grmusa,Biljana OklopcicIn this article, we present and contrast recent statistical approaches to word dependency parsing and lexicalized formalisms for grammar and semantics. We then consider the possibility of integrating those two extreme ideas, which leads to fully lexicalized parsing without any syntactic grammar rules.作者: 嫌惡 時(shí)間: 2025-4-1 11:50 作者: micronutrients 時(shí)間: 2025-4-1 15:15 作者: 招致 時(shí)間: 2025-4-1 20:01
