The paper presents a computationally tractable application of Bulgarian pronouns representation using Universal Networking Language (UNL) formalism. It analyses grammar features of pronouns and offers a model of their formal representation based on incorporation of grammar, semantic and lexical knowledge by using standard UNL knowledge representation mechanisms. The entire application presents ...

The lexical representation of words in Indo European languages is generally assumed to be driven by meaning compositionality. This study examined the lexical representation of complex verbs in German, which is a morphologically rich representative of Indo European languages. Three overt priming experiments manipulated prime target relations between morphological, semantic, and form relatedness....

In this study, Van Dijk’s (1998) model of CDA was utilized in order to examine the representation of Iran’s nuclear program in editorials published by British news casting companies. The analysis of the editorials was carried out at two levels of headlines and full text stories with regard to the linguistic features of lexical choices, nominalization, passivization, overcompleteness, and voice....

Current lexical semantic theories provide representations at a coarse grained level. In this paper, I will provide motivations for a fine grained representation for verbs and. nouns. An initial case study is done to serve as evidence that a more detailed representation is needed for tasks that require high accuracy rates, such as machine translation. An automatic approach to gather fine grained...

The PASCAL RTE challenge has helped LCC to explore the applicability of enhancements that have been made to our logic form representation and WordNet lexical chains generator. Our system transforms each T-H pair into logic form representation with semantic relations. The system automatically generates NLP axioms serving as linguistic rewriting rules and lexical chain axioms that connect concept...

The alignment of different ontologies requires the specification, representation and execution of translation rules. The rules need to integrate translations at the lexical, the syntactic and the semantic layer requiring semantic reasoning as well as low-level specification of adhoc conversions of data. Existing formalisms for representing translation rules cannot cover the representation needs...

Much effort has been put into computational lexicons over the years, and most systems give much room to (lexical) semantic data. However, in these systems, the effort put on the study and representation of lexical items to express the underlying continuum existing in 1) language vagueness and polysemy, and 2) language gaps and mismatches, has remained embryonic. A sense enumeration approach fai...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...