نتایج جستجو برای: free translation

تعداد نتایج: 637842  

2010
Christopher Dyer Philip Resnik

We describe a class of translation model in which a set of input variants encoded as a context-free forest is translated using a finitestate translation model. The forest structure of the input is well-suited to representing word order alternatives, making it straightforward to model translation as a two step process: (1) tree-based source reordering and (2) phrase transduction. By treating the...

Journal: :Journal of virology 1973
D W Kingsbury

Polypeptides corresponding in electrophoretic mobility to virion polypeptides 1, 3, and 5 were made in a reticulocyte cell-free system to which 18S RNA from Sendai virus-infected cells was added. Immune precipitation was used to select relevant polypeptides from endogenous products. The cell-free product corresponding to virion polypeptide 3 (the nucleocapsid structure unit) was the most abunda...

2003
Federico Gaspari

This paper focuses on the use of free on-line machine translation (MT) services on the Internet and discusses how they could be enhanced. Some of the key challenges of using MT technology in the Internet environment are addressed within a wide framework, so as to emphasise the relevance of web usability, userfriendliness and good interaction design for the successful deployment of on-line MT se...

1994
Ralf Steinberger

In free word order languages, every s('.ni;cn(:(~ is cml)eddcd in its specific contexL The order of consl;ituenLs is d('tcrmincd l)y the categories theme, t heme and contrastive J'oc'us. This paper shows [low to recognisc mid to transhti,e these cat;egorles autom;~t;ically on ;~ serH,e.ntial basis, so that SCilI;ClIC(.' ('ml)edding; can I)c' achieved wit;houL having i;o tel'e,' 1,o l,h(', co,> ...

2008
Donghi Lee DONGHI LEE

Abstract. Let Fn be a free group of rank n ≥ 2. Two elements g, h in Fn are said to be translation equivalent in Fn if the cyclic length of φ(g) equals the cyclic length of φ(h) for every automorphism φ of Fn. Let F (a, b) be the free group generated by {a, b} and let w(a, b) be an arbitrary word in F (a, b). We prove that w(g, h) and w(h, g) are translation equivalent in Fn whenever g, h ∈ Fn ...

1979
H. Willam Buttelmann

A formal d e f i n i t i o n f o r t h e semantics of a c o n t e x t free language, c a l l e d a phrase-structure semantics., i s given. The d e f i n i t i o n i s a model of t h e n o t i o n t h a t i t i s phrases which have meaning and t h a t t h e meaning of a phrase is a f u n c t i o n of i t s s y n t a c t i c s t r u c t u r e and of the meanings of i t s c o n s t i t u e n t s. ...

Journal: :Proceedings of the American Mathematical Society 1995

2016
Jurek Failmezger Robert Nitschel Andrés Sánchez-Kopper Michael Kraml Martin Siemann-Herzberg

Cell-free protein synthesis, which mimics the biological protein production system, allows rapid expression of proteins without the need to maintain a viable cell. Nevertheless, cell-free protein expression relies on active in vivo translation machinery including ribosomes and translation factors. Here, we examined the integrity of the protein synthesis machinery, namely the functionality of ri...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید