Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...

Vijay-Shanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially context-free structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear context-free rewriting systems (LCFRS’s, see also Weir (1988)) as a unifying framework for superficially different such formalisms (like (...

Abstract Second Language Acquisition (SLA) has benefited quite a lot from Construction Grammar. Most of the previous SLA researches adopting constructionist approach have been primarily engaged in issues pertinent to relevance construction SLA, process second language (L2) learning, and factors affecting L2 learning. This paper distinguishes itself research by embarking on new direction perspec...

and Fillmore 1999) provide a framework for describing grammaticality in terms of both form and meaning constraints. On the meaning side, cognitive linguists have contributed many great insights into the conceptual structures necessary for understanding language, but challenges remain in developing a precise, formal representation of construction grammar that supports both detailed linguistic an...

Linguistic resources are very important to any natural language processing task. Unfortunately, the manual construction of these resources is laborious and time-consuming. The use of annotated corpora as a knowledge database might be a solution to a fast construction of a grammar for a given language. In this paper, we present our method to automatically induce a syntactic grammar from an Arabi...

A formal architecture for Construction Grammar (CG) is sketched. Modeling domain objects (constructs) are constituent structures with feature structures at the nodes, aka Feature Structure Trees (FTs). Constructions are partial descriptions of FTs, expressed as sets of constituent structure equations and path equations. Uni-cation of constructions is deened. A construct c is licensed by a gramm...

We question whether Adele Goldberg fulfills her self-declared goal in ‘‘Constructions at Work’’, i.e. to develop a usage-based theory that ‘‘can produce an open-ended number of novel utterances based on a finite amount of input’’. We point out converging trends in computational linguistics that suggest formalizations of Construction Grammar. In particular, we go into recent developments in Data...