期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
The Semantic Comparison between Bare Noun Phrases in English and in Chinese
1
作者 马永娜 《海外英语》 2018年第11期230-233,共4页
Since Carlson(1977), bare noun phrases(which willbe referred to as BNPs afterwards) have been a focus of linguistics in English. Gradually, the studies of bare noun phrase has also caught much attention in China. Desp... Since Carlson(1977), bare noun phrases(which willbe referred to as BNPs afterwards) have been a focus of linguistics in English. Gradually, the studies of bare noun phrase has also caught much attention in China. Despite of the extensive studies of BNPs in English and Chinese respectively, a systematic comparison between English and Chinese BNPs in semantic readings is still less developed. More detailed studies and comparisons are obviously desirable. Most linguists agree that the semantics of the predicates, syntactic distribution and pragmatic factors all have a role to play in determining the interpretation of BNPs. Thus the paper has systematically made a semantic comparison between English BNPs and Chinese BNPs in terms of different predicate types and different syntactic distributions following the four semantic readings of BNPs of Shen(2005), namely, generic reading, existential reading,definite reading and non-referential reading. 展开更多
关键词 bare noun phrases semantic comparison predicate types syntactic distribution
在线阅读 下载PDF
DEPICT:A High-level Formal Language for Modeling Constraint Satisfaction Problems
2
作者 Abdulwahed M.Abbas Edward P.K.Tsang Ahmad H.Nasri 《International Journal of Automation and computing》 EI 2008年第2期208-216,共9页
The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently de... The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved. 展开更多
关键词 Constraint satisfaction problems (CSPs) and languages formal specifications typed predicate calculus language interpreter
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部