This paper introduces a paradigm of context-dependent grammar (CDG) and an acquisition system that, through interactive teaching sessions, accumulates the CDG rules. The resulting context-sensitive rules are used by a stack-based, shift~reduce parser to compute unambiguous syntactic structures of sentences. The acquisition system and parser have been applied to the phrase structure and case ana...

The growing context-sensitive languages have been classiied through the shrinking two-pushdown automaton, the deterministic version of which characterizes the class of generalized Church-Rosser languages (Buntrock and Otto 1995). Exploiting this characterization we prove that this latter class coincides with the class of Church-Rosser languages that was introduced by McNaughton, Narendran, and ...

The existence of context-sensitive general terms raises some issues that have only recently begunto be addressed. One of these is the nature of context-sensitivity itself: is it a purely (“narrow”)psychological phenomenon, internal to the speaker? Is it in part social? Or is it perhapsecological, in the sense of pertaining to the relationship between a community of speakers andt...

This paper introduces weakly growing context-sensitive grammars. Abstract-1 Such grammars generalize the class of growing context-sensitive grammars (studied by several authors), in that these grammars have rules that “grow” according to a position valuation. If a position valuation coincides with the initial part of an expoAbstract-2 nential function, it is called a steady position valuation. ...

We introduce the deenition of local structures as description of computations to recognize strings. Then, we identify the type of local structures corresponding to regular, context free and context sensitive languages, respectively and give a uniform characterization of those families in Chomsky's hierachy in terms of projection of frontiers of local sets of structures. In the second part, we c...

This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy, including Context Free Grammars (CFGs), Minimalist Grammars (MG), and other weakly MG-equivalent languages like Linear Context-Free Rewriting Systems. We then dev...

Substructural logics are formal logics whose Gentzen-style sequent systems abandon some/all structural rules (Weakening, Contraction, Exchange, Associativity). They have extensively been studied in current literature on nonclassical logics from different points of view: as sequent axiomatizations of relevant, multiple-valued and fuzzy logics [73, 44], as so-called resource-sensitive logics for ...

This paper describes the formal power of feature grammars such as Generalised Phrase Structured Grammars (GPSG) 1]. It shows how such grammars relate to context-free grammar (Chomsky type 2) and which extensions cause the formalism to increase in power to context-sensitive grammar and beyond. Also, it describes how any Turing machine can be implemented as a feature grammar showing that the powe...

Entity resolution is the problem of identifying the tuples that represent the same real world entity. In this paper, we address the problem of entity resolution over probabilistic data (ERPD), which arises in many applications that have to deal with probabilistic data. To deal with the ERPD problem, we distinguish between two classes of similarity functions, i.e. context-free and context-sensit...

It is well established that a formal language generated from a unimodal map is regular if and only if the map’s kneading sequence is either periodic or eventually periodic. A previously proposed conjecture said that if a language generated from a unimodal map is context-free, then it must be regular, i.e. there exists no proper context-free language which can be generated from a unimodal map. T...