Switch to: Citations

Add references

You must login to add references.
  1. Attribute-Value Logic and the Theory of Grammar.Mark Johnson - 1989 - Center for the Study of Language and Information Publications.
    Because of the ease of their implementation, attribute-value based theories of grammar are becoming increasingly popular in theoretical linguistics as an alternative to transformational accounts and in computational linguistics. This book provides a formal analysis of attribute-value structures, their use in a theory of grammar and the representation of grammatical relations in such theories of grammar. It provides a classical treatment of disjunction and negation, and explores the linguistic implications of different representations of grammatical relations. Mark Johnson is assistant professor (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Unification grammars and off-line parsability.Efrat Jaeger, Nissim Francez & Shuly Wintner - 2005 - Journal of Logic, Language and Information 14 (2):199-234.
    Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w L(G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP), were suggested, such that the recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP and discuss their interrelations, proving that some of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Introduction to Unification-Based Approaches to Grammar.Stuart M. Shieber - 1987 - Journal of Symbolic Logic 52 (4):1052-1054.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
    Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity and allow for efficient processing. We first show that non-reentrant unification grammars generate exactly the class of context-free languages. We then relax the constraint and show that one-reentrant (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation