書目名稱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é)科排名
作者: browbeat 時(shí)間: 2025-3-22 00:06 作者: 平息 時(shí)間: 2025-3-22 03:35
Analogical Equations in Sequences: Definition and ResolutionWe present a definition of analogy on sequences which is based on two principles: the definition of an analogy between the letters of an alphabet and the use of the edit distance between sequences. Our definition generalizes the algorithm given by Lepage and is compatible with another definition of analogy in sequences given by Yvon.作者: amputation 時(shí)間: 2025-3-22 05:29 作者: Lyme-disease 時(shí)間: 2025-3-22 09:13 作者: incarcerate 時(shí)間: 2025-3-22 16:04 作者: incarcerate 時(shí)間: 2025-3-22 20:23 作者: IVORY 時(shí)間: 2025-3-22 23:46 作者: 圍巾 時(shí)間: 2025-3-23 02:52
Learning Node Selecting Tree Transducer from Completely Annotated Examplesrees automatically from examples. We introduce . (.) and show how to induce deterministic .s in polynomial time from completely annotated examples. We have implemented learning algorithms for .s, started applying them to Web information extraction, and present first experimental results.作者: Tortuous 時(shí)間: 2025-3-23 09:22
Introducing Domain and Typing Bias in Automata Inferenceg background knowledge. Algorithmic solutions are provided to introduce this additional information efficiently in the classical state-merging automata learning framework. Improvement induced by the use of this background knowledge is shown on both artificial and real data.作者: modish 時(shí)間: 2025-3-23 13:23 作者: 觀點(diǎn) 時(shí)間: 2025-3-23 15:36
Grammatical Inference Using Suffix Treesave computational drawbacks, resulting in limitations with respect to the amount of language data to be used. In this article, we propose a new alignment method, which can find possible constituents in time linear in the amount of data. This solves the scalability problem and allows ABL to be applied to larger data sets.作者: 遵循的規(guī)范 時(shí)間: 2025-3-23 18:05 作者: beta-carotene 時(shí)間: 2025-3-24 00:45 作者: 陶醉 時(shí)間: 2025-3-24 06:06 作者: ABYSS 時(shí)間: 2025-3-24 07:54 作者: FLAT 時(shí)間: 2025-3-24 13:16 作者: botany 時(shí)間: 2025-3-24 16:18 作者: 執(zhí) 時(shí)間: 2025-3-24 22:05
,Erzeugung topologischer R?ume,g background knowledge. Algorithmic solutions are provided to introduce this additional information efficiently in the classical state-merging automata learning framework. Improvement induced by the use of this background knowledge is shown on both artificial and real data.作者: 狂亂 時(shí)間: 2025-3-25 01:23 作者: DEFER 時(shí)間: 2025-3-25 07:04
Problematik der Differentialdiagnose,ave computational drawbacks, resulting in limitations with respect to the amount of language data to be used. In this article, we propose a new alignment method, which can find possible constituents in time linear in the amount of data. This solves the scalability problem and allows ABL to be applied to larger data sets.作者: GLARE 時(shí)間: 2025-3-25 11:14
Untersuchung und allgemeine Symptomatik,ic finite automata cannot be identified from only a polynomial quantity of data. If concerned with approximation results, they become .-learnable if the .. norm is used. We also investigate queries that are sufficient for the class to be learnable.作者: 出處 時(shí)間: 2025-3-25 14:13 作者: mechanism 時(shí)間: 2025-3-25 18:52
Gender and Constructs of Mental Disorderee grammatical inference algorithms. This paper discusses design issues and decisions made when creating the competition. It also includes a new measure of the complexity of inferring context-free grammars, used to rank the competition problems.作者: 著名 時(shí)間: 2025-3-25 23:51 作者: Genteel 時(shí)間: 2025-3-26 03:18
Men, Masculinity and Contemporary Datinginly qualifies as a rich collection of related concepts, and has the advantage of thousands of years of effort devoted to improving its representations and clarifying its interconnections. This talk will present some of the issues I have encountered, and will probably consist of more questions than answers.作者: fastness 時(shí)間: 2025-3-26 06:40
A Political History of Extinction,is supported by high compatibility with other merges. Incompatible merges can be trivially detected during the computation of the heuristic. We also propose a new heuristic limitation of the set of candidates after a backtrack to these incompatible merges, allowing to introduce diversity in the search.作者: 名詞 時(shí)間: 2025-3-26 11:43 作者: acetylcholine 時(shí)間: 2025-3-26 13:24 作者: Infinitesimal 時(shí)間: 2025-3-26 17:57
Diagnostik der bakteriellen Meningitis,ting more information into the CF symbols. The approach has been fully implemented in ...Due to space limitations, the interested reader might further consult [3]. This report discusses several orthogonal adjusting parameters, additional postprocessing steps and motivate that the extracted CFGs can be tuned to deliver a meaningful semantic output.作者: temperate 時(shí)間: 2025-3-27 00:10
Learning and Mathematicsinly qualifies as a rich collection of related concepts, and has the advantage of thousands of years of effort devoted to improving its representations and clarifying its interconnections. This talk will present some of the issues I have encountered, and will probably consist of more questions than answers.作者: 擋泥板 時(shí)間: 2025-3-27 02:57 作者: 種族被根除 時(shí)間: 2025-3-27 07:51
Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptationignificantly better. The convergence speed is increased up to five times, while at the same time the training procedure becomes more robust, as tested on ap-plications from molecular biology. This is accomplished without additional computational complexity or the need for parameter tuning.作者: 不感興趣 時(shí)間: 2025-3-27 11:20
Navigation Pattern Discovery Using Grammatical Inferencee traditional grammatical inference methods. The evaluation of our method was based on two web usage data sets from two very dissimilar web sites. It consisted in producing, for each user, a personalized list of recommendations and then measuring its recall and expected utility.作者: Adrenaline 時(shí)間: 2025-3-27 14:08 作者: 對待 時(shí)間: 2025-3-27 20:17
Grammatical Inference: Algorithms and Applications作者: brachial-plexus 時(shí)間: 2025-3-27 22:48
Learning Finite-State Models for Machine Translationnsducers. We also review the results achieved by the systems developed under this paradigm. After presenting the traditional approach, where transducer learning is mainly solved under the grammatical inference framework, we propose a new approach where learning is explicitly considered as a statisti作者: 得體 時(shí)間: 2025-3-28 05:02
Identifying Clusters from Positive Dataot characterize it. On one hand, many interesting conditions make use of both the topological structure of the class and a well-chosen numbering. On the other hand, the clusterability of a class does not depend on the decision which numbering of the class is used as a hypothesis space for the cluste作者: Vital-Signs 時(shí)間: 2025-3-28 06:56
Music Listening, Emotions, Age and Context,nsducers. We also review the results achieved by the systems developed under this paradigm. After presenting the traditional approach, where transducer learning is mainly solved under the grammatical inference framework, we propose a new approach where learning is explicitly considered as a statisti作者: 闖入 時(shí)間: 2025-3-28 11:48 作者: Nonporous 時(shí)間: 2025-3-28 15:20
Learning and Mathematicshat our models generally do not represent learning a concept as an incremental addition to a rich collection of related concepts. This raises the question of how to make a good model of a “rich collection of related concepts.” Rather than start by trying to make a general model, or adapting existing作者: 使糾纏 時(shí)間: 2025-3-28 22:35
Learning Finite-State Models for Machine Translationful, recursive models can be used to account for more complex mappings, it has been argued that the input-output relations underlying most usual natural language pairs are essentially rational. Moreover, the relative simplicity of these mappings has recently lead to the development of techniques for作者: 分發(fā) 時(shí)間: 2025-3-29 00:28
The Omphalos Context-Free Grammar Learning Competition. The competition was created in an effort to promote the development of new and better grammatical inference algorithms for context-free languages, to provide a forum for the comparison of different grammatical inference algorithms and to gain insight into the current state-of-the-art of context-fr作者: PLE 時(shí)間: 2025-3-29 04:44
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFAng problems. EDSM, however, often does not converge to the target DFA and, in the case of sparse training data, does not converge at all. In this paper we argue that is partially due to the particular heuristic used in EDSM and also to the greedy search strategy employed in EDSM. We then propose a n作者: FAZE 時(shí)間: 2025-3-29 09:55
Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptationdescent method for Conditional Maximum Likelihood (CML) training of HMMs, which significantly outperforms traditional gradient descent. Instead of using fixed learning rate for every adjustable parameter of the HMM, we propose the use of independent learning rate/step-size adaptation, which has been作者: 投射 時(shí)間: 2025-3-29 13:08 作者: 態(tài)度暖昧 時(shí)間: 2025-3-29 19:29
Learnability of Pregroup Grammarstics. In a first theoretical approach, we provide learnability and non-learnability results in the sense of Gold for subclasses of Pregroup Grammars. In a second more practical approach, we propose an acquisition algorithm from a special kind of input called Feature-tagged Examples, that is based on作者: explicit 時(shí)間: 2025-3-29 20:51
A Markovian Approach to the Induction of Regular String Distributionsmodels (POMMs) is introduced. POMMs form a particular case of HMMs where any state emits a single letter with probability one, but several states can emit the same letter. It is shown that any HMM can be represented by an equivalent POMM. The proposed induction algorithm aims at finding a POMM fitti作者: 使成整體 時(shí)間: 2025-3-30 01:47
Learning Node Selecting Tree Transducer from Completely Annotated Examplesrees automatically from examples. We introduce . (.) and show how to induce deterministic .s in polynomial time from completely annotated examples. We have implemented learning algorithms for .s, started applying them to Web information extraction, and present first experimental results.作者: Cytology 時(shí)間: 2025-3-30 06:07
Identifying Clusters from Positive Data. considered is given by a numbering ..,..,... of nonempty subsets of ? or ?. which is also used as a hypothesis space. A clustering task is a finite and nonempty set of indices of pairwise disjoint sets. The class . is said to be clusterable if there is an algorithm which, for every clustering task作者: 殺人 時(shí)間: 2025-3-30 11:51
Introducing Domain and Typing Bias in Automata Inferencerings that belong to the language and eventually strings that do not. In this paper, we present a generic setting allowing to express domain and typing background knowledge. Algorithmic solutions are provided to introduce this additional information efficiently in the classical state-merging automat作者: 防水 時(shí)間: 2025-3-30 13:31
Representing Languages by Learnable Rewriting Systemse represent these languages. Among the formalisms that allow to define classes of languages, the one of string-rewriting systems (SRS) has outstanding properties. Indeed, SRS are expressive enough to define, in a uniform way, a noteworthy and non trivial class of languages that contains all the regu作者: Amorous 時(shí)間: 2025-3-30 20:23
A Divide-and-Conquer Approach to Acquire Syntactic Categoriesclassify function words from unannotated corpora. Then, the acquired information is used in two different learning processes. On the one hand, it is used to learn morpho-syntactic categories of nouns and, on the other, it turns out to be useful to also induce syntactic/semantic relationships between作者: 去才蔑視 時(shí)間: 2025-3-30 21:32
Grammatical Inference Using Suffix Treesd according to a context-free grammar. The framework produces good results even when simple techniques are used. However, the techniques used so far have computational drawbacks, resulting in limitations with respect to the amount of language data to be used. In this article, we propose a new alignm作者: 表被動 時(shí)間: 2025-3-31 04:56
Learning Stochastic Finite Automata learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned with approximation results, they become .-learnable if t作者: Diastole 時(shí)間: 2025-3-31 07:26 作者: 馬籠頭 時(shí)間: 2025-3-31 11:26
A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure GrammarI [2], into context-free grammars (CFGs). The method is unsound in that it does . generate a CFG whose language is a true superset of the language accepted by the original UBG. It is a corpus-driven method in that it relies on a corpus of parsed sentences and generates broader CFGs when given more i作者: thwart 時(shí)間: 2025-3-31 16:04 作者: 惡臭 時(shí)間: 2025-3-31 19:05 作者: embolus 時(shí)間: 2025-4-1 01:19
Music Listening, Emotions, Age and Context,ful, recursive models can be used to account for more complex mappings, it has been argued that the input-output relations underlying most usual natural language pairs are essentially rational. Moreover, the relative simplicity of these mappings has recently lead to the development of techniques for作者: Bumble 時(shí)間: 2025-4-1 04:31 作者: 淡紫色花 時(shí)間: 2025-4-1 06:09
A Political History of Extinction,ng problems. EDSM, however, often does not converge to the target DFA and, in the case of sparse training data, does not converge at all. In this paper we argue that is partially due to the particular heuristic used in EDSM and also to the greedy search strategy employed in EDSM. We then propose a n作者: 含水層 時(shí)間: 2025-4-1 11:10
