The generalised computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent objectoriented programming techniques exploiting the fine grain highly parallel features of TGRS in a language independent fashion that renders it able to act as the basis for developing specific languages based on object-orientation but also to study and compare existing approache...

The notion of term graph encodes a refinement of inductively generated syntax in which regard is paid to the the sharing and discard of subterms. Inductively generated syntax has an abstract expression in terms of initial algebras for certain endofunctors on the category of sets, which permits one to go beyond the set-based case, and speak of inductively generated syntax in other settings. In t...

We describe decision procedures for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened.

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...

Finding semantic similarity between short biomedical texts, such as article abstracts or experiment descriptions, may provide important information for health researchers. This paper presents a method for calculating text similarity in the biomedical context. The method implements a pairwise concept semantic similarity measure that uses concept definitions and ontology structure. The respective...

We treat nouns that behave adjectively, which we call adjectival nouns, extracted from large corpora. For example, in “financial world” and “world of finance,” “financial” and “finance” are different parts of speech, but their semantic behaviors are similar to each other. We investigate how adjectival nouns are similar to adjectives and different from non-adjectival nouns by using self-organizi...

constructs such as morality, warmth, and competence are the bread and butter of social psychology. Their antecedents and consequences have been explored frequently using semantic priming, in keeping with early models of memory representation as a semantic network of concept nodes. Contrary to what these models would predict, sensorimotor experiences in multiple modalities have proven capable of...

INCREMENT INTERFACE Increment; ATTRIBUTES Errors:SET OF ERRORS; expanded:BOOLEAN; father: Increment; doc_ver: DocumentVersion; END ATTRIBUTES; END ABSTRACT INCREMENT INTERFACE Increment. TERMINAL INCREMENT INTERFACE ClassIdentifier; INHERIT Increment; REGULAR EXPRESSION {[A−Za−z][A−Za−z0−9_]*} END REGULAR EXPRESSION; SEMANTIC RELATIONSHIPS IMPLICIT Constructors:SET OF Constructor.Constructs; IM...

In this work we investigate commonalities and differences between the semantic representations of concrete and abstract words using human judgments and distributional semantics. We tackle the following questions: a) Does distributional similarity imply similarity in concreteness vs. abstractness? b) How do concrete and abstract context words co-occur with concrete and abstract words? c) Are our...

The concept of graph substitution recently introduced by the authors is applied to term graphs, yielding a uniform framework for uniication, rewriting, and narrowing on term graphs. The notion of substitution allows deenitions of these concepts that are close to the corresponding deenitions in the term world. The rewriting model obtained in this way is equivalent to \collapsed tree rewriting" a...