نتایج جستجو برای: sings and symbols

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

Journal: :The Japanese journal of ergonomics 1965

Journal: :bulletin of emergency and trauma 0
seyed vahid hosseini colorectal research center, shiraz university of medical sciences, shiraz, iran. babak sabet shiraz university of medical sciences, shiraz, iran. abbas rezaianzadeh research center for health sciences, shiraz university of medical sciences, shiraz, iran. leila ghahramani colorectal research center, shiraz university of medical sciences, shiraz, iran. seyed hossein hosseini shahid faghihi hospital, shiraz university of medical sciences, shiraz, iran. alireza safarpour colorectal research center, shiraz university of medical sciences, shiraz, iran.

objective: to evaluate the role of physical examination in decision making for exploring patients with penetrating zone ii neck injury. methods: this was a cross-sectional study being performed in a level i trauma center between 2006 and 2010. the present study reviewed the records of 150 patients with penetrating neck injuries. of 46 cases with zone ii deep platysma neck injuries, 3 patients d...

2010
Stephen R Balzac

I’ve heard about the Superbowl focused on the ads. This year, of course, was different. Sure, there was plenty of speculation about the ads, but most of the discussion had to do with the New Orleans Saints finally qualifying. It’s not easy to have an even more losing reputation than the pre-2004 Boston Red Sox. At least Red Sox fans knew that their team had won the World Series once upon a time...

Journal: :CoRR 2016
Jochen Burghardt

We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.

2012
Francis Ferraro Benjamin Van Durme Matt Post

We provide a model that extends the splitmerge framework of Petrov et al. (2006) to jointly learn latent annotations and Tree Substitution Grammars (TSGs). We then conduct a variety of experiments with this model, first inducing grammars on a portion of the Penn Treebank and the Korean Treebank 2.0, and next experimenting with grammar refinement from a single nonterminal and from the Universal ...

2015
Xing Wang Deyi Xiong Min Zhang

In hierarchical phrase-based translation, coarse-grained nonterminal Xs may generate inappropriate translations due to the lack of sufficient information for phrasal substitution. In this paper we propose a framework to refine nonterminals in hierarchical translation rules with real-valued semantic representations. The semantic representations are learned via a weighted mean value and a minimum...

Journal: :J. Comput. Syst. Sci. 1982
Joost Engelfriet Gilberto Filé

An attribute grammar is simple multi-visit if each attribute of a nonterminal has a fixed visit-number associated with it such that, during attribute evaluation, the attributes of a node which have visit-number j are computed at the jth visit to the node. An attribute grammar is Iordered if for each nonterminal a linear order of its attributes exists such that the attributes of a node can alway...

This paper introduces a set of English grammar symbols that the author has developed to enhance students’ understanding and consequently, application of the English grammar rules. A pretest-posttest control-group design was carried out in which the samples were students in two girls’ senior high schools (N=135, P ≤ 0.05) divided into two groups: the Treatment which received gramm...

Journal: :Kybernetika 1967
Jozef Gruska

The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­ terminal symbols) of G. The classification of definable and strongly definable sets in dependence on minimal number of nonterminal symbols needed for their generation is given.

2011
Pierluigi Crescenzi Daniel Gildea Andrea Marino Gianluca Rossi Giorgio Satta

We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified righthand-side nonterminal (the head) and add the remaining nonterminals one at a time in any order. We show that it is NP-hard to find the best head-driven strategy in terms of either the time or space complexity of parsing.

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

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