نتایج جستجو برای: parts as conjunctions verity
تعداد نتایج: 5704558 فیلتر نتایج به سال:
We present an eecient algorithm to detect if the conjunction of two nonlocal predicates is possibly true in a distributed computation. For ooine detection of such global predicates, our algorithm is signiicantly more eecient than the previous algorithms
The recognition of named entities is now a welldeveloped area, with a range of symbolic and machine learning techniques that deliver high accuracy identification and categorisation of a variety of entity types. However, there are still some named entity phenomena that present problems for existing techniques; in particular, relatively little work has explored the disambiguation of conjunctions ...
Named entity recognition consists of identifying ‘mentions’ — strings in a text that correspond to named entities — and then classifying each such mention as corresponding to a specific type of named entity, with typical categories being Company, Person and Location. The full range of named entity categories to be identified is usually application dependent. Introduced for the first time as a s...
this study investigates the relationship between field-related cognitive styles and global reading comprehension of hypertext. technically, field dependency is prevailing dominance of field on perception of parts, while global comprehension is skim-like reading to grasp the general content. in this research project, 60 senior and junior students of arak university majoring in english literature...
We show that adding role conjunctions to the Description Logics (DLs) SHI and SHOIF causes a jump in the computational complexity of the standard reasoning tasks from ExpTime-complete to 2ExpTime-complete and from NExpTime-complete to N2ExpTime-hard respectively. We further show that this increase is due to a subtle interaction between inverse roles, role hierarchies, and role transitivity in t...
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value bipartite graph. Therefore, we investigate the problem of finding simultaneous bipartite matchings. We present an extension of the famous Hall theorem which characterizes when simultaneous bipartite matchings exists. ...
Determining the correct structure of coordinating conjunctions and the syntactic constituents that they coordinate is a difficult task. This subtask of syntactic parsing is explored here for biomedical scientific literature. In particular, the intuition that sentences containing coordinating conjunctions can often be rephrased as two or more smaller sentences derived from the coordination struc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید