نتایج جستجو برای: well formedness

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

Journal: :iranian journal of applied language studies 2014
vahid sadeghi

the distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. an organized survey was conducted to elicit the judgments of 37 native persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. the results showed that the differences in judgment between the various categories are not just t...

Journal: :Software Process: Improvement and Practice 2005
Tran Dan Thu Hanh Nhi Tran Dong Thi Bich Thuy Bernard Coulette Xavier Crégut

RHODES is an environment for modelling software processes, in which software processes are described by using a Process Modelling Language called PBOOL+. In this environment, a software process is built from PBOOL+ process components that can be reused to construct other processes. To identify well-formed process components, we study properties to be able to characterize topological structure o...

2012
Kyle Gorman

Gradientwordlikeness judgements do not necessarily imply that a gradientwell-formedness system underlies them; gradient judgements may be an artifact of gradient rating tasks. Dubious architectural assumptions are needed for speakers to report gradient well-formedness judgements. Simple baselines beer account for gradient well-formedness judgements than state-of-the-art computational models of...

1999
Mieczyslaw A. Klopotek Slawomir T. Wierzchon

The paper provides a frequency-based interpretation for conditional belief functions that overcomes the well-formedness problem of DST belief networks by identifying a class of conditional belief functions for which well-formedness is granted.

2015
Matt Kaufmann

Some runtime checks can be safely removed from code if appropriate program properties are proved. We describe how we have applied this idea to the ACL2 theorem prover to speed up the application of user-defined proof procedures. In particular, we discuss how and why we have added a new feature to ACL2 that allows the user to verify certain well-formedness properties of the expressions produced ...

2005

Using data from ellipsis as evidence, this talk argues that a grammar formalism for natural languages should both articulate the process of building up interpretation in real time, and be sensitive to contextually provided information. Almost every natural language expression displays some form of context dependence. This is most obvious with anaphora and tense construal, but the effects go muc...

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

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