probabilistic synchronous contextfree grammars

... Trang 1Prefix Probability for Probabilistic Synchronous Context-Free Grammars Mark-Jan Nederhof School of Computer Science University of St Andrews ... probabilities for synchronous context-free grammars Our framework is fairly gen-eral and relies on the combination of a sim-ple, novel grammar transformation and stan-dard techniques to bring grammars ... models that have been investigated in the literature are based on synchronous rewriting or tree transduc-tion Probabilistic synchronous context-free gram-mars (PSCFGs) are one among the most

Ngày tải lên: 23/03/2014, 16:20

... Trang 1Exploiting Multiple Treebanks for Parsing with Quasi-synchronousGrammars Zhenghua Li, Ting Liu∗, Wanxiang Che Research Center for Social Computing and Information ... of CoNLL 2009: Shared Task, pages 37–42. Kevin Gimpel and Noah A Smith 2011 Quasi-synchronous phrase dependency grammars for ma-chine translation In Proceedings of the 2011 Confer-ence on Empirical ... Journal of Chinese Information Processing, 18(4):1–8. David Smith and Jason Eisner 2006 Quasi-synchronous grammars: Alignment by soft projection of syntac-tic dependencies In Proceedings on the Workshop

Ngày tải lên: 16/03/2014, 19:20

... characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed Essentially, ... Unifying synchronous tree adjoining grammars and tree transducers via bimor-phisms In Proc EACL, pages 377–384 Association for Computational Linguistics. Stuart M Shieber 2007 Probabilistic synchronous ... introduction to synchronous grammars In Proc ACL Association for Computa-tional Linguistics Part of a tutorial given with Kevin Knight. Bruno Courcelle and Paul Franchi-Zannettacci 1982 Attribute grammars

Ngày tải lên: 17/03/2014, 00:20

... distinct probabilistic combinatorial optimization problems denoted in the sequel byPROBABILISTIC MAX INDEPENDENT SET1, PROBABILISTIC MAX INDEPENDENT SET2, PROBABILISTIC MAX INDEPENDENT SET3,PROBABILISTIC ... is done in [BER 90b] for the probabilistic travelingsalesman problem, the probabilistic minimum spanning tree problem, the probabilisticSteiner tree problem8, the probabilistic vehicle routing ... For instance, if it is feasible forPROBABILISTIC MAX INDEPENDENT SET,PROBABILISTIC MIN VERTEX COVERandPROBABILISTIC MIN COLORING, this is not the case for PROBABILISTIC LONGEST PATH, unless particular

Ngày tải lên: 12/02/2014, 16:20

... Trang 1Chapter 5 Synchronous Machines Main features of synchronous machines: A synchronous machine is an ac machine whose speed under steady-state ... (b) four-pole, and (c) Y connection of the windings §5.1 Introduction to Polyphase Synchronous Machines Synchronous machines: Armature winding: on the stator, alternating current Field winding: ... increase in synchronous electromechanical torque, with the result that synchronism will no longer be maintained and the rotor will speed up loss of synchronism, pulling out of step max T ⇒ §5.2 Synchronous-Machine

Ngày tải lên: 14/02/2014, 16:36

... adjoined Most work has been concerned with probabilistic interleaving mod-els [LS91,Seg95,DEP02] In contrast, we propose a probabilistic causal model, a form of probabilistic event structure An event ... important notion of probabilistic test Traditionally, in domain theory a probabilistic process is represented as a uous valuation on the open sets of a domain, i.e., as an element of the probabilisticpowerdomain ... significantly, in a valuation the probabilistic choices at contin-different cells need not be probabilistically independent In the process we are led to amore general definition of probabilistic event structure

Ngày tải lên: 19/02/2014, 03:20

... increases by 1 Thus, simple context-free tree grammars strongly lexicalize tree adjoining grammars and themselves. 1 Introduction Tree adjoining grammars [TAG] (Joshi et al., 1969; Joshi et al., ... 1968 Grammars with macro-like productions In Proc 9th Ann Symp Switching and Automata Theory, pages 131–142 IEEE Computer Society. Akio Fujiyoshi 2005 Epsilon-free grammars and lexicalized grammars ... Tree-adjoining grammars and lexicalized grammars In Maurice Nivat and Andreas Podelski, editors, Tree Au-tomata and Languages North-Holland. Aravind K Joshi and Yves Schabes 1997 Tree-adjoining grammars

Ngày tải lên: 07/03/2014, 18:20

... translation, paraphrase, and map-pings can be expressed by synchronous grammars Where the tree pairs are isomorphic, synchronous context-free grammars (SCFG) may suffice, but in general, non-isomorphism ... substitution (Eisner, 2003) or tree-adjoining grammars may better capture the pair-ings In this work, we explore techniques for inducing synchronous tree-substitution grammars (STSG) using as a testbed ... of a sentence, they may be harder to extend to general paraphrasing Synchronous tree-substitution grammar is a for-malism for synchronously generating a pair of non-isomorphic source and target

Ngày tải lên: 07/03/2014, 22:20

... approxi- mations for context-free grammars and equivalent augmented phrase-structure grammar formalisms The approximation is exact for certain context- free grammars generating regular languages, ... right-linear context-free grammars The algorithm has been used to con- struct finite-state language models for limited- domain speech recognition tasks 1 M o t i v a t i o n Grammars for spoken language ... in Section 3.2 that the method is exact for left-linear and right-linear grammars, two important classes of context-free grammars generating regular lan- guages 1 At first sight, this requirement

Ngày tải lên: 08/03/2014, 07:20

... This observation also holds for the grammars discussed above even though these are b o t h lexicalist grammars Head-corner parsing appears to be superior for grammars in which the head-corner table ... parsing algorithms to such grammars is unsatisfactory for a number of rea- sons Earley parsing is intractable in general, as the rule set is simply too general For some grammars, naive top-down ... be possible A head-driven parsing strategy is particularly interesting for lexicalist grammars, as these grammars normally suffer most from the prob- lem that rules or rule-schemata hardly constrain

Ngày tải lên: 09/03/2014, 01:20

... withthe idea of shape grammars are possible and can define classes of grammars analogous to the different classes of phrase ture grammars (Ginsberg, 1966) struc-Where we use shape grammars exclusively ... art Trang 3SHAPE GRAMMARS AND THE GENERATIVE SPECIFICATIONOF PAINTING AND SCULPTURE In this paper we present (1) a definition of shape grammars,(2) a formalism, based on these grammars, for the ... to George Stiny Trang 2Paper 128SHAPE GRAMMARS AND THE GENERATIVE SPECIFICATION OF PAINTING AND SCULPTURE Abstract A method of shape generation using shape grammars whichtake shape as primitive

Ngày tải lên: 16/03/2014, 14:20

... robust active and reactive power control Here, besides synchronous generators with electromagnetic excitation, permanent magnet (PM) synchronous as... groups for automobiles) or may have ... robust active and reactive power control Here, besides synchronous generators with electromagnetic excitation, permanent magnet (PM) synchronous as well as cage-rotor induction generators ... energy Transmission Wind energy Wind turbine Electric generator Electric energy © 2006 by Taylor & Francis Group, LLC 1-6 Synchronous Generators • Steam turbines • Gas turbines • Hydraulic turbines • Wind turbines • Diesel

Ngày tải lên: 21/03/2014, 12:12

... power (Pe) Electric generator ssion Transmi-Power grid 3~ Autonomous load Speed sensor Trang 3With synchronous generators operating in a constant voltage and frequency power system, the speeddrop ... the IV in the IP stage to provide fast and safe control During steam turbine starting — toward synchronous generator synchronization — the MSV is fullyopen, while the GV and IV are controlled

Ngày tải lên: 21/03/2014, 12:12

... improves the results of Web search by applying probabilistic model on the link structure of Webs to evaluate the “importance” of Webs In PageRank probabilistic model, the links and webs are uniform, ... Trang 1Applying probabilistic model for ranking Webs inmulti-context Le Trung Kien1,∗ Tran Loc Hung1, Le Anh Vu2 ... problems From this judgement, in this paper, we introduce and describe the MPageRank based on a new probabilistic model supporting multi-context for ranking Webs A Web now has different ranking scores,

Ngày tải lên: 22/03/2014, 11:20

... Urform I, II, and III Shape Grammars Shape grammars are similar to phrase structure grammars, which were introduced by Chomsky [4] in linguistics Where phrase structure grammars are Trang 5defined ... with the idea of shape grammars are possible and can define classes of grammars analogous to the different classes of phrase structure grammars [5] Trang 8Where we use shape grammars exclusively ... phrase structure grammars Grammar-grammars, where the sentences generated are themselves shape grammars, are possible While no parsing algorithms have been developed, shape grammars seem applicable

Ngày tải lên: 23/03/2014, 11:21

... Trang 1Probabilistic Ranking of Database Query Results Abstract We investigate the problem of ranking answers to a database query when many tuples are returned We adapt and apply principles of probabilistic ... describable ranking functions? To achieve this, we develop ranking functions that are based on Probabilistic Information Retrieval (PIR) ranking models We chose PIR models because we could ... outline the architecture of our solution In Section 4 we discuss our approach to ranking based on probabilistic models from information retrieval In Section 5 we describe an efficient implementation

Ngày tải lên: 23/03/2014, 12:20

... establishes a theoretical connection between two very differ-ent kinds of probabilistic models: Probabilistic Context-Free Grammars (PCFGs) and a class of models known as Latent Dirichlet Allocation ... al-gorithm based on Gibbs sampling; both are quite effective in practice 3 Probabilistic Context-Free Grammars Context-Free Grammars are a simple model of hi-erarchical structure often used to describe ... different kinds of probabilistic models Latent Dirich-let Allocation (LDA) models are used as “topic models” to produce a low-dimensional representation of documents, while Probabilistic Context-Free

Ngày tải lên: 23/03/2014, 16:20

... assigning struc- tural descriptions to dictionary entries Dictionary grammars follow the basic notational conventions of logic grammars; however, we use additional operators tailored to the structure ... etymology, pronun- ciation or usage notes) We have built a Dictionary Entry Parser (DEP) together with grammars for several different dic- tionaries Our goal has been to create a general mechanism for ... unlike the tagging of the OED, carried out in several passes over the data and using different grammars (in order to cope with the highly complex, idiosyncratic and am- biguous nature of dictionary

Ngày tải lên: 24/03/2014, 02:20

... Trang 1Tree Representations in Probabilistic Models for Extended NamedEntities Detection Marco Dinarelli LIMSI-CNRS Orsay, France ... approach the task in two steps, involving Conditional Random Fields and Probabilis-tic Context-Free Grammars, integrated in a single parsing algorithm We analyse the effect of using several tree representations. ... being real-ized with Conditional Random Fields (CRF) (Laf-ferty et al., 2001), the second with a Probabilistic Context-Free Grammar (PCFG) (Johnson, 1998) The motivations behind that are: • Since

Ngày tải lên: 24/03/2014, 03:20

... D k denotes the data points in the branch T k Each node defines a probabilistic model for words that the cluster acquires The probabilistic D i D k D j Figure 2: A segment of a tree with with ... further The paper is structured as follows: section 2 gives the related work, section 3 describes the probabilistic hierarchical clustering scheme, sec-tion 4 explains the morphological segmenta-tion ... analyses of words are provided to the system In contrast, our pro-posed method is fully unsupervised 3 Probabilistic Hierarchical Model The hierarchical clustering proposed in this work is different

Ngày tải lên: 24/03/2014, 03:20