Results 1 - 10 of 385

Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems

by Andreas Gebhardt, Johannes Waldmann
"... The “matrix method ” (Hofbauer and Waldmann 2006) proves termination of string rewriting via linear monotone interpretation into the domain of vectors over suitable semirings. Equivalently, such an interpretation is given by a weighted finite automaton. This is a general method that has as parameter ..."
Abstract - Add to MetaCart
The “matrix method ” (Hofbauer and Waldmann 2006) proves termination of string rewriting via linear monotone interpretation into the domain of vectors over suitable semirings. Equivalently, such an interpretation is given by a weighted finite automaton. This is a general method that has

Tree-to-String Alignment Template for Statistical Machine Translation

by Yang Liu, et al. , 2006
"... We present a novel translation model based on tree-to-string alignment template (TAT) which describes the alignment between a source parse tree and a target string. A TAT is capable of generating both terminals and non-terminals and performing reordering at both low and high levels. The model is lin ..."
Abstract - Cited by 173 (32 self) - Add to MetaCart
We present a novel translation model based on tree-to-string alignment template (TAT) which describes the alignment between a source parse tree and a target string. A TAT is capable of generating both terminals and non-terminals and performing reordering at both low and high levels. The model

Termination of string rewriting proved automatically

by H. Zantema - Journal of Automated Reasoning , 2003
"... Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool impl ..."
Abstract - Cited by 28 (5 self) - Add to MetaCart
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool

Cartesian Genetic Programming

by Julian F. Miller , Peter Thomson , 2000
"... This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node funct ..."
Abstract - Cited by 230 (59 self) - Add to MetaCart
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node

Efficient Synthesis of Stringed Musical Instruments

by Julius O. Smith, III , 1993
"... Techniques are described for reducing complexity in stringed instrument simulation for purposes of digital synthesis. These include commuting losses and dispersion to consolidate them into a single lter, replacing body resonators by look-up tables, simplied bow-string interaction, and single-lter ..."
Abstract - Cited by 58 (1 self) - Add to MetaCart
-lter, multiply-free coupled strings implementation. Contents 1 Digital Waveguide Theory 2 2 The Terminated String 4 3 Simplied Body Filters 5 4 Simplied Bowed Strings 8 5 Coupled Strings 10 6 Summary 14 7 Appendix 14 1 Page 2 1 Digital Waveguide Theory This section summarizes the digital waveguide model

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

by G. Ramalingam, Thomas Reps , 1992
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract - Cited by 139 (1 self) - Add to MetaCart
The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also

Termination of Cycle Rewriting

by Hans Zantema, Er Bruggink
"... Abstract. String rewriting can not only be applied on strings, but also on cycles and even on general graphs. In this paper we investigate ter-mination of string rewriting applied on cycles, shortly denoted as cycle rewriting, which is a strictly stronger requirement than termination on strings. Mos ..."
Abstract - Add to MetaCart
Abstract. String rewriting can not only be applied on strings, but also on cycles and even on general graphs. In this paper we investigate ter-mination of string rewriting applied on cycles, shortly denoted as cycle rewriting, which is a strictly stronger requirement than termination on strings

Bayesian inference for PCFGs via Markov chain Monte Carlo

by Mark Johnson, Thomas L. Griffiths - In Proceedings of the North American Conference on Computational Linguistics (NAACL ’07 , 2007
"... This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an alternative to maximum-likelihood estimation using the Inside-Outside algorithm. We illustrate these methods by estimating a sp ..."
Abstract - Cited by 70 (9 self) - Add to MetaCart
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an alternative to maximum-likelihood estimation using the Inside-Outside algorithm. We illustrate these methods by estimating a

Termination proofs for string rewriting systems via inverse match-bounds

by Alfons Geser, Dieter Hofbauer, Johannes Waldmann - In print , 2005
"... Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both terminat ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
termination and preservation of regular languages. We show now that the string rewriting systems whose inverse (left and right hand sides exchanged) is match-bounded, have similar exceptional properties. They effectively preserve context-free languages, and their sets of strings that have infinitely many

The multiple functions of cysteine-string protein analyzed at Drosophila nerve terminals

by Peter Bronk , Zhiping Nie , Markus K Klose , Ken Dawson-Scully , Jinhui Zhang , R Meldrum Robertson , Harold L Atwood , Konrad E Zinsmaier - J. Neurosci , 2005
"... The synaptic vesicle-associated cysteine-string protein (CSP) is important for synaptic transmission. Previous studies revealed multiple defects at neuromuscular junctions (NMJs) of csp null-mutant Drosophila, but whether these defects are independent of each other or mechanistically linked through ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
The synaptic vesicle-associated cysteine-string protein (CSP) is important for synaptic transmission. Previous studies revealed multiple defects at neuromuscular junctions (NMJs) of csp null-mutant Drosophila, but whether these defects are independent of each other or mechanistically linked
Results 1 - 10 of 385