書目名稱Grammatical Inference and Applications影響因子(影響力)學科排名
書目名稱Grammatical Inference and Applications網(wǎng)絡公開度
書目名稱Grammatical Inference and Applications網(wǎng)絡公開度學科排名
書目名稱Grammatical Inference and Applications被引頻次
書目名稱Grammatical Inference and Applications被引頻次學科排名
書目名稱Grammatical Inference and Applications年度引用
書目名稱Grammatical Inference and Applications年度引用學科排名
書目名稱Grammatical Inference and Applications讀者反饋
書目名稱Grammatical Inference and Applications讀者反饋學科排名
作者: Guileless 時間: 2025-3-21 22:21
Memorialization in Germany since 1945d English-to-German translations have been generated, and exhaustive experiments have been carried out to test the ability of OSTIA to learn these translations. The success of the results show the usefulness of formal learning techniques in limited-domain Machine Translation tasks.作者: 翅膀拍動 時間: 2025-3-22 01:27
https://doi.org/10.1007/b101865very simplistic and idiosyncratic input coding, the syntactic method performs slightly better than any of the other methods. Furthermore, it is likely that the syntactic method could significantly outperform the other methods given a less idiosyncratic input coding.作者: organism 時間: 2025-3-22 05:52
https://doi.org/10.1007/978-94-011-4006-5nguage. Finally, the automata are converted into regular expressions, and they are used to construct the grammar. In addition to automata, an alternative representation, characteristic .-grams, is introduced. Some interactive operations are also described that are necessary for generating a grammar for a large and complicated document.作者: 吞沒 時間: 2025-3-22 12:03 作者: Nausea 時間: 2025-3-22 16:16 作者: Nausea 時間: 2025-3-22 20:27
Membranfiltration im Molkereiwesen,. Here we present results on new classifications of 2 millions of words of a French text [2], obtained with allowing more than one possible class for each word, as well as optimised combinations of word and class bigram models.作者: 泰然自若 時間: 2025-3-22 22:28
https://doi.org/10.1057/978-1-137-58360-4 between a close fit to the data and a default preference for simpler models (‘Occam‘s Razor’). The general scheme is illustrated using three types of probabilistic grammars: Hidden Markov models, class-based .-grams, and stochastic context-free grammars.作者: 郊外 時間: 2025-3-23 03:13 作者: 有惡臭 時間: 2025-3-23 08:48
Automatic determination of a stochastic bi-gram class language model,. Here we present results on new classifications of 2 millions of words of a French text [2], obtained with allowing more than one possible class for each word, as well as optimised combinations of word and class bigram models.作者: diathermy 時間: 2025-3-23 10:03
Inducing probabilistic grammars by Bayesian model merging, between a close fit to the data and a default preference for simpler models (‘Occam‘s Razor’). The general scheme is illustrated using three types of probabilistic grammars: Hidden Markov models, class-based .-grams, and stochastic context-free grammars.作者: 忘川河 時間: 2025-3-23 16:51 作者: placebo-effect 時間: 2025-3-23 21:26 作者: 周興旺 時間: 2025-3-24 00:52
Inference and estimation of a long-range trigram model, This results in significant savings in computation time, and is applicable to the training of a general probabilistic link grammar. Results of preliminary experiments carried out for this class of models are presented.作者: 駕駛 時間: 2025-3-24 04:13 作者: osteopath 時間: 2025-3-24 09:42
What is the search space of the regular inference?,l properties of the search space are studied and generalization criteria are discussed. In this framework, the concept of . is introduced, that is the set of the most general solutions excluding a negative sample. Finally, the complexity of regular language identification from both a theoritical and a practical point of view is discussed.作者: 談判 時間: 2025-3-24 13:52
Application of OSTIA to machine translation tasks,d English-to-German translations have been generated, and exhaustive experiments have been carried out to test the ability of OSTIA to learn these translations. The success of the results show the usefulness of formal learning techniques in limited-domain Machine Translation tasks.作者: AWRY 時間: 2025-3-24 14:52
A comparison of syntactic and statistical techniques for off-line OCR,very simplistic and idiosyncratic input coding, the syntactic method performs slightly better than any of the other methods. Furthermore, it is likely that the syntactic method could significantly outperform the other methods given a less idiosyncratic input coding.作者: rheumatology 時間: 2025-3-24 20:29 作者: 過份 時間: 2025-3-25 01:48 作者: Individual 時間: 2025-3-25 03:54
Automatic determination of a stochastic bi-gram class language model,e have developed a class-based bigram model determined entirely automatically from written text corpora. The classes are not defined, the words are not tagged, the solely assumption is the number of classes..We get a robust model which insures a more complete coverage of the succession probabilities作者: 前奏曲 時間: 2025-3-25 08:22 作者: 尾巴 時間: 2025-3-25 12:12 作者: 收藏品 時間: 2025-3-25 15:48
Application of OSTIA to machine translation tasks,defined from a conceptually constrained task which was recently proposed within the field of Cognitive Science. Large corpora of English-to-Spanish and English-to-German translations have been generated, and exhaustive experiments have been carried out to test the ability of OSTIA to learn these tra作者: 潰爛 時間: 2025-3-25 23:24
Inducing probabilistic grammars by Bayesian model merging, grammar; subsequently, elements of the model (such as states or nonterminals) are . to achieve generalization and a more compact representation. The choice of what to merge and when to stop is governed by the Bayesian posterior probability of the grammar given the data, which formalizes a trade-off作者: unstable-angina 時間: 2025-3-26 02:33
Statistical estimation of Stochastic Context-Free Grammars using the Inside-Outside algorithm and ad for the estimation of the rule probabilities of Stochastic Context-Free Grammars with the same time complexity as the Inside-Outside algorithm. The transformation algorithm relates Stochastic Context-Free Grammars, whose characteristic grammar is proper and does not have single rules, to Stochasti作者: 裝飾 時間: 2025-3-26 06:10 作者: 溺愛 時間: 2025-3-26 12:15 作者: expire 時間: 2025-3-26 15:29
Forming grammars for structured documents: an application of grammatical inference,les. The examples consist of structures of individual documents, and they can be collected either by converting typographical tagging of documents prepared for printing into structural tags, or by using document recognition techniques. Our method forms first finite-state automata describing the exam作者: 厭食癥 時間: 2025-3-26 17:25
A comparison of syntactic and statistical techniques for off-line OCR, test is to show that syntactic methods can perform as robustly as purely statistical techniques on noisy data. The main result is that, even given a very simplistic and idiosyncratic input coding, the syntactic method performs slightly better than any of the other methods. Furthermore, it is likely作者: aesthetic 時間: 2025-3-26 21:07
Dynamic grammatical representations in guided propagation networks, to complete internal representations in the course of processing allow noisy pattern parsing. Structured representations are obtained through extraction of syntactical substructures using different strategies. A comparison with classical grammar representation is presented.作者: cartilage 時間: 2025-3-27 04:28
A hybrid connectionist-symbolic approach to regular grammatical inference based on neural learning have been suggested to extract a finite state automaton (FSA) from the activation patterns of a trained net. However, the consistency with the examples of the extracted FSA is not guaranteed in these methods, and typically, some parameter of the clustering algorithm must be set arbitrarily (e.g. th作者: abject 時間: 2025-3-27 08:14
B. de Kruijff,P. R. Cullis,A. J. Verkleijthe number of examples required for learning is polynomial, the computational problem associated with learning is intractable..Learning homomorphisms is a simple special case of the general model. While a general method for learning homomorphisms is not known, it is shown that even if the target lan作者: orthopedist 時間: 2025-3-27 10:17
https://doi.org/10.1007/978-1-4684-4850-4c theorems. This framework enables to state the regular inference problem as a search through a boolean lattice built from the positive sample. Several properties of the search space are studied and generalization criteria are discussed. In this framework, the concept of . is introduced, that is the作者: Brochure 時間: 2025-3-27 16:05
Membranfiltration im Molkereiwesen,e have developed a class-based bigram model determined entirely automatically from written text corpora. The classes are not defined, the words are not tagged, the solely assumption is the number of classes..We get a robust model which insures a more complete coverage of the succession probabilities作者: 治愈 時間: 2025-3-27 19:20 作者: Dictation 時間: 2025-3-28 00:31
https://doi.org/10.1007/978-94-017-6123-9icted not only from the two immediately preceeding words, but potentially from any preceeding pair of adjacent words that lie within the same sentence. In this way, the trigram model can skip over less informative words to make its predictions. The underlying “grammar” is nothing more than a list of作者: 即席 時間: 2025-3-28 02:46
Memorialization in Germany since 1945defined from a conceptually constrained task which was recently proposed within the field of Cognitive Science. Large corpora of English-to-Spanish and English-to-German translations have been generated, and exhaustive experiments have been carried out to test the ability of OSTIA to learn these tra作者: Foam-Cells 時間: 2025-3-28 08:06 作者: 作嘔 時間: 2025-3-28 12:23 作者: MORT 時間: 2025-3-28 15:47 作者: Bereavement 時間: 2025-3-28 22:36
https://doi.org/10.1007/978-1-349-00702-8obabilities of the strings in the language. The algorithm builds the prefix tree acceptor from the sample set and merges systematically equivalent states. Experimentally, it proves very fast and the time needed grows only linearly with the size of the sample set.作者: AVOID 時間: 2025-3-28 23:47 作者: 深陷 時間: 2025-3-29 03:21
https://doi.org/10.1007/b101865 test is to show that syntactic methods can perform as robustly as purely statistical techniques on noisy data. The main result is that, even given a very simplistic and idiosyncratic input coding, the syntactic method performs slightly better than any of the other methods. Furthermore, it is likely作者: 沐浴 時間: 2025-3-29 11:16
Alberto Macii,Luca Benini,Massimo Poncino to complete internal representations in the course of processing allow noisy pattern parsing. Structured representations are obtained through extraction of syntactical substructures using different strategies. A comparison with classical grammar representation is presented.作者: 下船 時間: 2025-3-29 11:37 作者: 多山 時間: 2025-3-29 16:32 作者: frenzy 時間: 2025-3-29 22:07 作者: 有毒 時間: 2025-3-30 02:28
Daoudi’s ,: Identity as Performancehis process, which is based on a gradient descent technique, the initialization is a crucial aspect. In this paper, we show experimentally how the results obtained by this method can be improved when structural information about the task is inductively incorporated in the initial models to be learnt.作者: cogitate 時間: 2025-3-30 05:05 作者: 調色板 時間: 2025-3-30 10:13 作者: CEDE 時間: 2025-3-30 14:34 作者: 挫敗 時間: 2025-3-30 17:38
Statistical estimation of Stochastic Context-Free Grammars using the Inside-Outside algorithm and ad for the estimation of the rule probabilities of Stochastic Context-Free Grammars with the same time complexity as the Inside-Outside algorithm. The transformation algorithm relates Stochastic Context-Free Grammars, whose characteristic grammar is proper and does not have single rules, to Stochastic Context-Free Grammars in Chomsky Normal Form作者: GOUGE 時間: 2025-3-30 22:39 作者: bleach 時間: 2025-3-31 02:56
Learning stochastic regular grammars by means of a state merging method,obabilities of the strings in the language. The algorithm builds the prefix tree acceptor from the sample set and merges systematically equivalent states. Experimentally, it proves very fast and the time needed grows only linearly with the size of the sample set.作者: Blatant 時間: 2025-3-31 07:36 作者: Credence 時間: 2025-3-31 11:03
Grammatical Inference and Applications978-3-540-48985-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 寬敞 時間: 2025-3-31 14:26 作者: 處理 時間: 2025-3-31 18:17 作者: 深淵 時間: 2025-3-31 23:53 作者: NEG 時間: 2025-4-1 03:39
A hierarchy of language families learnable by regular language learners,We shall establish the existence of a hierarchy of language families, in which the learning problem for each family is reduced to the learning problem for regular languages. Thus this boosts the learnability of learning algorithms for regular languages.作者: Diskectomy 時間: 2025-4-1 06:08
