Study of patterns on images is recognized as an important step in characterization and classification of image. The ability to efficiently analyze and describe image patterns is thus of fundamental importance. The study of syntactic methods of describing pictures has been of interest for researchers. Array Grammars can be used to represent and recognize connected patterns. In any image the patt...

A formalism for ~he representation of "semantic emphases" is introduced, using principal and accessory instantiatiQns. It m~es it possible to convert predicate expressions inbo network-like structures. As an application criteria for ooligatory and optional actants are dealt with. 11 ~ 12, t I ~ t2, t I starts t2, t I finishes t 2 etco (Allen (1984); Bier-winch (1988) for the general framework)....

In this work a proposal for automatic textual segmentation is described. The proposal uses the output of an automatic syntactic analyzer – Parser Palavras – to create textual segmentation. Parse trees are used to infer text segments and a dependency tree of the identified segments. The main contribution of this work is the use of the syntactic structure as source for the automatic segmentation ...

In this paper, we employ the centering theory in pronoun resolution from the semantic perspective. First, diverse semantic role features with regard to different predicates in a sentence are explored. Moreover, given a pronominal anaphor, its relative ranking among all the pronouns in a sentence, according to relevant semantic role information and its surface position, is incorporated. In parti...

Ontology and other logical languages are built around the idea that axioms enable the inference of new facts about the available data. In some circumstances, however, the data is meant to be complete in certain ways, and deducing new facts may be undesirable. Previous approaches to this issue have relied on syntactically specifying certain axioms as constraints or adding in new constructs for c...

A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ∈ Σ, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefixclosed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal,...

Sectloo One o f thls paper gives an overview of a generally accepted approach to semantic processing that goes through several levels o f representation to achieve this mapping. Although somewhat inflexible a n d cumbersome, the different levels succeed in preservln S the context sensitive information p r o v i d e d by v e r b semantics. Section Two p r e s e n t s t h e a u t h o r ' s r u l ...