書目名稱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é)科排名
作者: 畢業(yè)典禮 時(shí)間: 2025-3-21 23:43
https://doi.org/10.1007/978-3-319-59318-0es from a language, a canonical grammar for the training corpus, and a parsing task, Partition Search . Learning constructs a grammar that maximises performance on the parsing task and minimises grammar size. This paper describes Partition Search in detail, also providing theoretical background and 作者: 樹上結(jié)蜜糖 時(shí)間: 2025-3-22 02:49 作者: Rct393 時(shí)間: 2025-3-22 05:15 作者: Mobile 時(shí)間: 2025-3-22 09:16 作者: intelligible 時(shí)間: 2025-3-22 16:56
https://doi.org/10.1007/978-3-531-91531-9e introduced in [.] a class of automata based on properties of residual languages (RFSA) and showed in [.] and [.] that this class could be interesting for grammatical inference purpose. Here, we study properties of 0-reversible languages that can be expressed as properties of their residual languag作者: intelligible 時(shí)間: 2025-3-22 17:19
https://doi.org/10.1007/978-3-322-93584-7mple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated by residuals) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Deterministic Finite Automata (PDFA). We pre作者: 喚起 時(shí)間: 2025-3-23 00:45
https://doi.org/10.1007/978-3-0348-5195-4ies. More precisely, rational transducers can be used to implement explicit fragmentation to define new identifiable regular language classes. Context conditions can be used to construe identifiable and characterizable language classes which may contain non-regular languages by means of implicit fra作者: 擁護(hù)者 時(shí)間: 2025-3-23 03:30 作者: 壕溝 時(shí)間: 2025-3-23 08:45
,P?dagogische und politische Perspektiven,h trees which are a quite natural way to represent structured information. These trees are used afterwards to infer a stochastic tree automaton, using a well-known grammatical inference algorithm. We propose two extensions of this algorithm: use of sorts and generalization of the infered automaton a作者: erythema 時(shí)間: 2025-3-23 10:12
Francesco Prontera,Eckart Olshausen for certain subclasses of the linear grammars given which these classes can be polynomially identified in the limit from given data. This enables us to give new proofs of the identification of well known classes of grammars, and to propose a new (and larger) class of linear grammars for which polyn作者: Hirsutism 時(shí)間: 2025-3-23 15:46 作者: Consensus 時(shí)間: 2025-3-23 19:23 作者: 支柱 時(shí)間: 2025-3-24 01:34 作者: muster 時(shí)間: 2025-3-24 03:00
Chemisch-?Konomische Kulturmassnahmening approaches make repeated passes over the training data. The memory requirements of such algorithms are ill-suited for embedded agents exposed to large amounts of training data over long periods of time. We present a novel algorithm, called HOLA, for estimating the parameters of SCFGs that comput作者: Ccu106 時(shí)間: 2025-3-24 08:17
https://doi.org/10.1007/978-3-663-08756-4lass of the languages recognizable by ascending tree automata. One of the advantages of this approach is that the probabilistic model can be updated in an incremental fashion. Another feature is that backing-off schemes can be defined. As an illustration of their applicability, they have been used t作者: 歌唱隊(duì) 時(shí)間: 2025-3-24 10:41
Mensch und Organisation in der Unternehmungtive examples. In the search for classes which can be learned efficiently from strings, we study the class of 2-letter rigid grammars, which is the class of classical categorial grammars with an alphabet of two letters, each of which is assigned a single type. The (non-trivial) structure of this cla作者: Left-Atrium 時(shí)間: 2025-3-24 17:30
Bettina Purkarthofer,Barbara Friehsom .. There are two different approaches to this topic: (i) reducing the new classes to well known ones, and (ii) designing new learning algorithms for the new classes. In this work we will use reduction techniques to define new classes of even linear languages which can be inferred from positive da作者: CYN 時(shí)間: 2025-3-24 19:36 作者: nullify 時(shí)間: 2025-3-25 00:34 作者: Fabric 時(shí)間: 2025-3-25 06:40
PCFG Learning by Nonterminal Partition Searches from a language, a canonical grammar for the training corpus, and a parsing task, Partition Search . Learning constructs a grammar that maximises performance on the parsing task and minimises grammar size. This paper describes Partition Search in detail, also providing theoretical background and 作者: CLOWN 時(shí)間: 2025-3-25 10:09 作者: 清唱?jiǎng)?nbsp; 時(shí)間: 2025-3-25 12:41 作者: 連鎖 時(shí)間: 2025-3-25 15:59 作者: 包庇 時(shí)間: 2025-3-25 20:57 作者: bypass 時(shí)間: 2025-3-26 03:02 作者: 閃光你我 時(shí)間: 2025-3-26 04:42
Fragmentation: Enhancing Identifiabilityies. More precisely, rational transducers can be used to implement explicit fragmentation to define new identifiable regular language classes. Context conditions can be used to construe identifiable and characterizable language classes which may contain non-regular languages by means of implicit fra作者: FLOUR 時(shí)間: 2025-3-26 09:58 作者: 燦爛 時(shí)間: 2025-3-26 14:09 作者: Synovial-Fluid 時(shí)間: 2025-3-26 20:52 作者: 悲觀 時(shí)間: 2025-3-27 00:57 作者: 全國(guó)性 時(shí)間: 2025-3-27 03:08 作者: acquisition 時(shí)間: 2025-3-27 05:41 作者: 挑剔為人 時(shí)間: 2025-3-27 11:02
Estimating Grammar Parameters Using Bounded Memorying approaches make repeated passes over the training data. The memory requirements of such algorithms are ill-suited for embedded agents exposed to large amounts of training data over long periods of time. We present a novel algorithm, called HOLA, for estimating the parameters of SCFGs that comput作者: exacerbate 時(shí)間: 2025-3-27 15:55
Stochastic ,-testable Tree Languages and Applicationslass of the languages recognizable by ascending tree automata. One of the advantages of this approach is that the probabilistic model can be updated in an incremental fashion. Another feature is that backing-off schemes can be defined. As an illustration of their applicability, they have been used t作者: 細(xì)節(jié) 時(shí)間: 2025-3-27 20:57 作者: backdrop 時(shí)間: 2025-3-28 01:28 作者: PHONE 時(shí)間: 2025-3-28 06:05 作者: 縮減了 時(shí)間: 2025-3-28 06:34
https://doi.org/10.1007/978-3-319-59318-0r noun phrase extraction, a task that is crucial in many applications involving natural language processing. In the experiments, Partition Search improves parsing performance by up to 21.45% compared to a general baseline and by up to 3.48% compared to a task-specific baseline, while reducing grammar size by up to 17.25%.作者: disciplined 時(shí)間: 2025-3-28 14:02 作者: 同謀 時(shí)間: 2025-3-28 17:43
https://doi.org/10.1007/978-3-663-10779-8 these conditions. Furthermore the number of examples needed to correctly identify can diminish drastically with the quality of the added information. We show that this general setting can cope with several well known learning tasks.作者: 無(wú)能力之人 時(shí)間: 2025-3-28 22:47 作者: Catheter 時(shí)間: 2025-3-29 02:32
Mensch und Organisation in der Unternehmungroblem runs in time linear in the total length of the input strings. After seeing two or more strings in a language, the algorithm can determine precisely the (finite) set of grammars which can generate those strings.作者: 新字 時(shí)間: 2025-3-29 07:07 作者: agonist 時(shí)間: 2025-3-29 10:21 作者: 四指套 時(shí)間: 2025-3-29 13:38 作者: Allergic 時(shí)間: 2025-3-29 17:08
Estimating Grammar Parameters Using Bounded Memoryot by the amount of training data. Empirical results show that HOLA performs as well as the Inside-Outside algorithm on a variety of standard problems, despite the fact that it has access to much less information.作者: 特別容易碎 時(shí)間: 2025-3-29 23:21
Fast Learning from Strings of 2-Letter Rigid Grammarsroblem runs in time linear in the total length of the input strings. After seeing two or more strings in a language, the algorithm can determine precisely the (finite) set of grammars which can generate those strings.作者: Nomogram 時(shí)間: 2025-3-29 23:54 作者: jumble 時(shí)間: 2025-3-30 04:15 作者: triptans 時(shí)間: 2025-3-30 10:41
Stochastic ,-testable Tree Languages and Applicationsn an incremental fashion. Another feature is that backing-off schemes can be defined. As an illustration of their applicability, they have been used to compress tree data files at a better rate than string-based methods.作者: 刺激 時(shí)間: 2025-3-30 14:52 作者: 引導(dǎo) 時(shí)間: 2025-3-30 17:15 作者: 面包屑 時(shí)間: 2025-3-30 22:18
https://doi.org/10.1007/978-3-531-91531-9es and that are useful for identification from positive data. This leads us to define classes of languages which strictly contain the class of 0-reversible languages and are identifiable in the limit from positive data.作者: 褲子 時(shí)間: 2025-3-31 04:43 作者: Spangle 時(shí)間: 2025-3-31 06:55 作者: 排他 時(shí)間: 2025-3-31 09:44 作者: 沉積物 時(shí)間: 2025-3-31 13:41 作者: 萬(wàn)花筒 時(shí)間: 2025-3-31 17:48 作者: 左右連貫 時(shí)間: 2025-3-31 23:21 作者: panorama 時(shí)間: 2025-4-1 02:05 作者: 四牛在彎曲 時(shí)間: 2025-4-1 07:28
Some Classes of Regular Languages Identifiable in the Limit from Positive Dataes and that are useful for identification from positive data. This leads us to define classes of languages which strictly contain the class of 0-reversible languages and are identifiable in the limit from positive data.作者: 闡明 時(shí)間: 2025-4-1 13:16 作者: 我要威脅 時(shí)間: 2025-4-1 14:31
Generalized Stochastic Tree Automata for Multi-relational Data Miningccording to a local criterion. We show on some experiments that our approach scales with large databases and both improves the predictive power of the learned model and the convergence of the learning algorithm.作者: 彎彎曲曲 時(shí)間: 2025-4-1 19:45
Stochastic Grammatical Inference with Multinomial Teststical evidence is cumulated. Third, a statistical score is associated to each possible merging operation and can be used for best-first strategy. Improvement over classical stochastic grammatical inference algorithm is shown on artificial data.
