Filters








125 Hits in 5.3 sec

Prefix probabilities from stochastic Tree Adjoining Grammars

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998 Proceedings of the 36th annual meeting on Association for Computational Linguistics -  
Language models for speech recognition typically use a probability model of the form  ...  The probability model used for a stochastic grammar was ~we~* Pr (al..-anw) . However, language models that are based on trigram probability models out-perform stochastic CFGs.  ...  Computing Prefix Probabilities This section develops an algorithm for the computation of prefix probabilities for stochastic TAGs.  ... 
doi:10.3115/980691.980726 dblp:conf/acl/NederhofSS98 fatcat:3e2zwasqzfdmjf4mk45iu246w4

Prefix Probabilities from Stochastic Tree Adjoining Grammars [article]

Mark-Jan Nederhof, Giorgio Satta
1998 arXiv   pre-print
The main result in this paper is an algorithm to compute such prefix probabilities given a stochastic Tree Adjoining Grammar (TAG). The algorithm achieves the required computation in O(n^6) time.  ...  A language model of the above form is constructed from such grammars by computing the prefix probability Sum_w in Sigma* Pr(a_1 ... a_n w), where w represents all possible terminations of the prefix a_  ...  Complexity and concluding remarks We have presented a method for the computation of the prefix probability when the underlying model is a Tree Adjoining Grammar.  ... 
arXiv:cs/9809026v1 fatcat:j3f2us6mqfewvf67usexcnf23y

Prefix probabilities from stochastic Tree Adjoining Grammars

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998 Proceedings of the 17th international conference on Computational linguistics -   unpublished
Language models for speech recognition typically use a probability model of the form  ...  The probability model used for a stochastic grammar was ~we~* Pr (al..-anw) . However, language models that are based on trigram probability models out-perform stochastic CFGs.  ...  Computing Prefix Probabilities This section develops an algorithm for the computation of prefix probabilities for stochastic TAGs.  ... 
doi:10.3115/980432.980726 fatcat:ekhwt3hhxba2zpee74ri7vns6e

Page 3631 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
Summary: “Tree insertion grammar (TIG) is a tree-based formal- ism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammars.  ...  Summary: “We describe an extension of Earley’s parser for sto- chastic context-free grammars that computes the following quan- tities given a stochastic context-free grammar and an input string: (a) probabilities  ... 

Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Model [chapter]

Shaojun Wang, Shaomin Wang, Li Cheng, Russell Greiner, Dale Schuurmans
2006 Lecture Notes in Computer Science  
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 PLSAs and violation of tree structure in the topology of the underlying random field model make the inference and parameter estimation problems plausibly  ...  Diagram illustrating inside probability recursions: adjoin left vs adjoin right T ) is the probability of generating sentence W l in document d with parse tree T and semantic content sequence G l , c  ... 
doi:10.1007/11872436_9 fatcat:lr47b4pjufbbdckyec3aiejkie

An alternative conception of tree-adjoining derivation

Yves Schabes, Stuart M. Shieber
1992 Proceedings of the 30th annual meeting on Association for Computational Linguistics -  
The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical  ...  We argue that the definition of tree-adjoining derivation must be reformulated in order to manifest the proper linguistic dependencies in derivations.  ...  Statistical analysis can be explored through the specification of derivational probabilities as formalized in stochastic tree-adjoining grammars.  ... 
doi:10.3115/981967.981989 dblp:conf/acl/SchabesS92 fatcat:iki4p6umqbbw3nkbn27y5p5x54

Genetic algorithms for structural editing [chapter]

Richard Myers, Edwin R. Hancock
1998 Lecture Notes in Computer Science  
Secondly, we apply genetic algorithms to tree adjoining grammars with the introduction of a new editing operation.  ...  We use the tree adjoining grammar developed by Joshi [1] as a prototypical structural model, and realise the editing process using a genetic algorithm.  ...  Parsing with Tree Adjoining Grammars A tree adjoining grammar, G, is a pair, (I, A), of sets of ordered labelled trees, where I is the set of initial trees, which correspond to minimal sentences in the  ... 
doi:10.1007/bfb0033234 fatcat:ora47h6i7jex7llyyqdabakhhi

A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars

Jason Eisner, Giorgio Satta
2000 International Workshop on Tree Adjoining Grammars and Related Formalisms  
Introduction Lexicalized Tree-Adjoining Grammars (LTAGs) were first introduced in (Schabes et a/" 1988) as a variant ofTree-Adjoining Grammars (TAGs) (Joshi, 1987) .  ...  Altematively, under a stochastic LTAG (Resnik, 1992; Schabes, 1992) , one may prune away unpromising items, such as those with low inside probability. lt should be possible to combine any ofthese tricks  ... 
dblp:conf/tag/EisnerS00 fatcat:fiepmmfagveg5kmwk7o7mvgfpm

An Alternative Conception of Tree-Adjoining Derivation [article]

Yves Schabes, Stuart M. Shieber
1994 arXiv   pre-print
The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical  ...  We argue that the definition of tree-adjoining derivation must be reformulated in order to manifest the proper linguistic dependencies in derivations.  ...  The second author was supported in part by Presidential Young Investigator award IRI-91-57996 from the National Science Foundation and a matching grant from Xerox Corporation.  ... 
arXiv:cmp-lg/9404001v1 fatcat:prjsaaouhraqvlvhekm7doh2oy

A possibilistic linear program is equivalent to a stochastic linear program in a special case

Masahiro Inuiguchi, Masatoshi Sakawa
1995 Fuzzy sets and systems (Print)  
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar.  ...  Any context-free grammar (CFG) can be converted into a lexicalized tree insertion grammar (LTIG) that generates the same trees.  ...  We thank Masaru Tomita for making his test grammars available to us.  ... 
doi:10.1016/0165-0114(94)00364-7 fatcat:zd42exh3urfnrercev7lxxt7mq

Part-of-Speech Tagging and Partial Parsing [chapter]

S. Abney
1997 Text, Speech and Language Technology  
There have also been efforts at learning parts of speech from word distributions, with application to tagging [76, 77] . Taggers are currently wide-spread and readily available.  ...  In another line of development, hidden Markov models (HMMs) were imported from speech recognition and applied to tagging, by Bahl and Mercer [9], Derouault and Merialdo [26], and Church [20].  ...  Their partial parser developed from work on lexicalized tree-adjoining grammar (LTAG), in which each elementary tree contains a unique lexical item.  ... 
doi:10.1007/978-94-017-1183-8_4 fatcat:nkdxn66w7beita4esb5s55dx44

Syntactic realization with data-driven neural tree grammars

Brian McMahan, Matthew Stone
2016 International Conference on Computational Linguistics  
We develop a new method for syntactic choice based on learning a stochastic tree grammar in a neural architecture.  ...  We also induce embeddings to generalize over elementary tree structures and exploit a tree recurrence over the input structure to model long-distance influences between NLG choices.  ...  Acknowledgments This research was supported in part by NSF IIS-1526723 and by a sabbatical leave from Rutgers to Stone.  ... 
dblp:conf/coling/McMahanS16 fatcat:jfl3tyzstndirp5ys4j3sli4pi

Tabling for infinite probability computation

Taisuke Sato, Philipp Meyer, Marc Herbstritt
2012 International Conference on Logic Programming  
Our generalized approach to prefix probability computation through tabling opens a way to logic-based probabilistic modeling of cyclic dependencies.  ...  Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for PCFGs to probabilistic logic programs.  ...  They also studied prefix probability computation for a variant of PCFGs [8] . Nederhof et al. proposed prefix probability computation for stochastic tree adjoining grammars [6] .  ... 
doi:10.4230/lipics.iclp.2012.348 dblp:conf/iclp/SatoM12 fatcat:mn2gvmoqbbhinhadqrw54i7psq

Duality for Labelled Markov Processes [chapter]

Michael Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell
2004 Lecture Notes in Computer Science  
We characterize the state space of the universal LMP as the set of homomorphims from an ordered commutative monoid of labelled trees into the multiplicative unit interval.  ...  Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions.  ...  We extend the grammar (2) for trace trees to a grammar of functional expressions by allowing rational linear combinations.  ... 
doi:10.1007/978-3-540-24727-2_28 fatcat:wmwhgmig6zaqngra47gwnia4y4

Infinite probability computation by cyclic explanation graphs

TAISUKE SATO, PHILIPP MEYER
2013 Theory and Practice of Logic Programming  
Our general approach to prefix probability computation through tabling not only allows to deal with non-probabilistic context-free grammars such as probabilistic left-corner grammars but has applications  ...  Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabilistic context-free grammars (PCFGs) to probabilistic logic  ...  Nederhof et al. proposed prefix probability computation for stochastic tree adjoining grammars (Nederhof et al. 1998 ).  ... 
doi:10.1017/s1471068413000562 fatcat:pcplpnvb2bfs5kygochjzzoppa
« Previous Showing results 1 — 15 out of 125 results