scholarly journals Semantic Dependencies and Modularity of Aspect-Oriented Software

2007 ◽  
Author(s):  
Alberto Costa Neto ◽  
Marcio de Medeiros Ribeiro ◽  
Marcos Dosea ◽  
Rodrigo Bonifacio ◽  
Paulo Borba
Keyword(s):  
Semantic Dependencies

Using Semantic Dependencies to Mine Depressive Symptoms from Consultation Records

2005 ◽  
Vol 20 (6) ◽  
pp. 50-58 ◽  
Author(s):  
Chung-Hsien Wu ◽  
Liang-Chih Yu ◽  
Fong-Lin Jang
Keyword(s):  
Depressive Symptoms ◽  
Semantic Dependencies

scholarly journals Method for transforming symbolic radar marks of low-noticeable moving objects based on the Talbot effect

Radiotekhnika ◽  
2021 ◽  
pp. 129-137
Author(s):  
V. Zhyrnov ◽  
S. Solonskaya
Keyword(s):  
Moving Objects ◽  
Radar Data ◽  
Pulse Frequency ◽  
Asymptotic Equality ◽  
Talbot Effect ◽  
Radar Images ◽  
Frequency Code ◽  
Semantic Dependencies ◽  
Symbolic Images ◽  
Synchronous Pulse

In this paper a method to transform radar images of moving aerial objects with scintillating inter-period fluctuations, sometimes resulting to complete signal fading, using the Talbot effect is considered. These transformations are reduced to the establishment of a certain correspondence of the asymptotic equality of perception of visual images, arbitrarily changing in time and space, in the statement about the conditions of simple equality of perception of images of radar marks that have different frequencies of fluctuations. It is shown how this approach can be used to analyze radar data by transforming and smoothing scintillating signal fluctuations, invisible in the presence of interference, into visible symbolic images. First, to detect and recognize the aerial objects from the analysis of relations and functional (semantic) dependencies between attributes, second, to make a decision based on semantic components of symbolic radar images. The possibility of using such transformation to generate pulse-frequency code of fluctuations of the symbolic radar angel-echo images as an important characteristic for their recognition has been experimentally verified. Algorithms for generating symbolic images in asynchronous and synchronous pulse-frequency code are formulated. The symbolic image represented by such a code is considered as an additional feature for recognizing and filtering out natural interferences such as angel-echoes.

Constraints on ellipsis alternation: A view from the history of English

2015 ◽  
Vol 27 (2) ◽  
pp. 227-254 ◽  
Author(s):  
Joanna Nykiel
Keyword(s):  
Early Modern ◽  
Language Processing ◽  
Form Processing ◽  
Argument Ellipsis ◽  
Early Modern English ◽  
History Of ◽  
Construction Type ◽  
Semantic Dependencies ◽  
Late Modern

AbstractI offer a diachronic perspective on English ellipsis alternation, or the alternation between inclusion and omission of prepositions from remnants under sluicing and bare argument ellipsis. The relative freedom to omit prepositions from remnants has not been stable in English; this freedom is connected to the strength of semantic dependencies between prepositions and verbs. Remnants without prepositions are first attested, but remain less frequent than remnants with prepositions, as late as Early Modern English and gain in frequency following this period. I demonstrate that three constraints—correlate informativity, structural persistence, and construction type—predict ellipsis alternation in Early and Late Modern English. However, predicting ellipsis alternation in present-day English requires semantic dependencies in addition to the three constraints. The constraints can be subsumed under principles of language processing and production (considerations of accessibility, a tendency to reuse structure, and a conventionalized performance preference for efficiently accessing constituents that form processing domains), permitting a unified processing account of ellipsis alternation with cross-linguistic coverage.

The relative order of prepositional phrases in English: Going beyond Manner–Place–Time

1999 ◽  
Vol 11 (3) ◽  
pp. 231-266 ◽  
Author(s):  
John A. Hawkins
Keyword(s):  
Relative Order ◽  
Syntactic Complexity ◽  
Processing Efficiency ◽  
Prepositional Phrases ◽  
Lexical Semantic ◽  
Pragmatic Information ◽  
Information Status ◽  
Structural Ambiguity ◽  
Semantic Dependencies ◽  
Single Predictor

This article argues against Manner–Place–Time and other proposed grammatical principles of ordering for prepositional phrases (PPs) in postverbal position in English. Instead, greater empirical adequacy can be achieved by a theory of processing efficiency that defines a preference for minimal domains in the recognition of syntactic phrase structure and in the processing of lexical–semantic dependencies between verbs and prepositions. Some new entailment tests are proposed on the basis of which these dependencies can be defined. The data come from 500 pages of written English. For 300 pages, an additional analysis is given in terms of structural ambiguity avoidance and pragmatic information status. Syntactic complexity is the biggest single predictor of PP sequences, whereas lexical–semantic factors predominate when syntactic preferences are weak. Manner–Place–Time is not the correct semantic generalization, however. Ambiguity avoidance had no clear impact on these orderings. Pragmatic effects were not visible when syntactic weight made no predictions and were correlated with weight when it did but were less strongly supported.

Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization

2012 ◽  
Vol 38 (3) ◽  
pp. 617-629 ◽  
Author(s):  
Marco Kuhlmann ◽  
Giorgio Satta
Keyword(s):  
Lexical Item ◽  
Tree Adjoining Grammar ◽  
Tree Adjoining Grammars ◽  
Lexical Items ◽  
Semantic Dependencies

A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version. We show that such a procedure does not exist: Tree-adjoining grammars are not closed under strong lexicalization.

scholarly journals Multilabel Image Classification With Regional Latent Semantic Dependencies

2018 ◽  
Vol 20 (10) ◽  
pp. 2801-2813 ◽  
Author(s):  
Junjie Zhang ◽  
Qi Wu ◽  
Chunhua Shen ◽  
Jian Zhang ◽  
Jianfeng Lu
Keyword(s):  
Image Classification ◽  
Semantic Dependencies

scholarly journals Improve Data Quality by Processing Null Values and Semantic Dependencies

2016 ◽  
Vol 04 (05) ◽  
pp. 78-85 ◽  
Author(s):  
Houda Zaidi ◽  
Faouzi Boufarès ◽  
Yann Pollet
Keyword(s):  
Data Quality ◽  
Improve Data Quality ◽  
Null Values ◽  
Semantic Dependencies
Sign in / Sign up

Export Citation Format

Share Document