Search results for 'context-free' (try it on Scholar)

1000+ found
Order:
  1.  29
    Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW] Journal of Logic, Language and Information 13 (4):421-438.
    We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  2.  17
    Stephan Kepser & Jim Rogers (2011). The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. Journal of Logic, Language and Information 20 (3):361-384.
    The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of an (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  3.  48
    Geoffrey K. Pullum & Gerald Gazdar (1982). Natural Languages and Context-Free Languages. Linguistics and Philosophy 4 (4):471 - 504.
    Notice that this paper has not claimed that all natural languages are CFL's. What it has shown is that every published argument purporting to demonstrate the non-context-freeness of some natural language is invalid, either formally or empirically or both.18 Whether non-context-free characteristics can be found in the stringset of some natural language remains an open question, just as it was a quarter century ago.Whether the question is ultimately answered in the negative or the affirmative, there will be interesting further (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   17 citations  
  4.  21
    Mati Pentus (1997). Product-Free Lambek Calculus and Context-Free Grammars. Journal of Symbolic Logic 62 (2):648-660.
    In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we present a construction of context-free grammars involving only product-free types.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  5.  13
    Dan Klein & Christopher D. Manning, An Ç ´Ò¿ Μ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.
    While Ç ´Ò¿ µ methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies, has not yet been provided. This paper presents such an algorithm, and shows its correctness and advantages over prior work. The paper finishes by bringing out the connections between the algorithm and work on hypergraphs, which permits us to extend the presented Viterbi (best parse) algorithm to an inside (total (...)
    No categories
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6.  12
    Gabriel Infante-Lopez & Maarten De Rijke (2006). A Note on the Expressive Power of Probabilistic Context Free Grammars. Journal of Logic, Language and Information 15 (3):219-231.
    We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering out unwanted parses. Probabilities in PCFGs induce an ordering relation among the set of trees that yield a given input sentence. PCFG parsers return the trees bearing the maximum probability for a given sentence, discarding all other possible trees. This mechanism is naturally viewed as a way of defining a new class of (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  7.  22
    Birgitta Dresp-Langley (2015). 2D Geometry Predicts Perceived Visual Curvature in Context-Free Viewing. Computational Intelligence and Neuroscience 2015 (708759):1-9.
    Planar geometry was exploited for the computation of symmetric visual curves in the image plane, with consistent variations in local parameters such as sagitta, chordlength, and the curves’ height-to-width ratio, an indicator of the visual area covered by the curve, also called aspect ratio. Image representations of single curves (no local image context) were presented to human observers to measure their visual sensation of curvature magnitude elicited by a given curve. Nonlinear regression analysis was performed on both the individual and (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  8.  3
    Julie Bertels, Régine Kolinsky & José Morais (2012). Lack of Habituation to Shocking Words: The Attentional Bias to Their Spatial Origin is Context Free. Cognition and Emotion 26 (8):1345-1358.
  9.  4
    Maciej Kandulski (1988). The Equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):41-52.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  10.  4
    Wojcßch Buszkowski (1985). The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  4
    Maciej Kandulski (1988). The Equivalence of Nonassociative Lambek Categorial Grammars and Context‐Free Grammars. Mathematical Logic Quarterly 34 (1):41-52.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  12.  7
    Wojcßch Buszkowski (1985). The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars. Mathematical Logic Quarterly 31 (24):369-384.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  13. G. H. Matthews (1967). Review: N. Chomsky, M. P. Schutzenberger, The Algebraic Theory of Context-Free Languages. [REVIEW] Journal of Symbolic Logic 32 (3):388-389.
     
    Export citation  
     
    My bibliography  
  14.  8
    S. Ginsburg (1972). Review: J. Hartmanis, Context-Free Languages and Turing Machine Computations. [REVIEW] Journal of Symbolic Logic 37 (4):759-759.
    Direct download  
     
    Export citation  
     
    My bibliography  
  15.  7
    G. H. Matthews (1972). Review: Joseph S. Ullian, Partial Algorithm Problems for Context Free Languages. [REVIEW] Journal of Symbolic Logic 37 (1):196-197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. Andrzej Blikle (1968). Review: Seymour Ginsburg, The Mathematical Theory of Context Free Languages. [REVIEW] Journal of Symbolic Logic 33 (2):300-301.
     
    Export citation  
     
    My bibliography  
  17.  19
    Christopher Manning, An ¢¡¤£¦¥¨§ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.
    fundamental rule” in an order-independent manner, such that the same basic algorithm supports top-down and Most PCFG parsing work has used the bottom-up bottom-up parsing, and the parser deals correctly with CKY algorithm (Kasami, 1965; Younger, 1967) with the difficult cases of left-recursive rules, empty elements, Chomsky Normal Form Grammars (Baker, 1979; Jeand unary rules, in a natural way.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  18.  5
    Gabriel Orman (1973). Properties of the Derivations According to a Context-Free Grammar. In Radu J. Bogdan & Ilkka Niiniluoto (eds.), Logic, Language, and Probability. Boston,D. Reidel Pub. Co. 226--236.
    Direct download  
     
    Export citation  
     
    My bibliography  
  19.  3
    Seymour Ginsburg (1971). Review: Sheila A. Greibach, The Unsolvability of the Recognition of Linear Context-Free Languages. [REVIEW] Journal of Symbolic Logic 36 (4):693-693.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20. Richard Stanley (1968). Review: Seymour Ginsburg, Sheila Greibach, Deterministic Context Free Languages. [REVIEW] Journal of Symbolic Logic 33 (2):302-302.
     
    Export citation  
     
    My bibliography  
  21.  4
    Michael O. Rabin (1969). Review: M. P. Schutzenberger, On Context-Free Languages and Push-Down Automata. [REVIEW] Journal of Symbolic Logic 34 (2):297-298.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22.  4
    Walter J. Savitch (1972). Review: P. M. Lewis, R. E. Stearns, J. Hartmanis, Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages. [REVIEW] Journal of Symbolic Logic 37 (3):625-625.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23.  3
    D. Terence Langendoen (1968). Review: Seymour Ginsburg, Joseph Ullian, Ambiguity in Context Free Languages; Seymour Ginsburg, Joseph Ullian, Preservation of Unambiguity and Inherent Ambiguity in Context-Free; Thomas N. Hibbard, Joseph Ullian, The Independence of Inherent Ambiguity From Complementednes Among Context-Free Languages. [REVIEW] Journal of Symbolic Logic 33 (2):301-302.
    Direct download  
     
    Export citation  
     
    My bibliography  
  24.  2
    Asa Kasher (1969). Review: Seymour Ginsburg, Edwin H. Spanier, Quotients of Context-Free Languages. [REVIEW] Journal of Symbolic Logic 34 (1):135-136.
    Direct download  
     
    Export citation  
     
    My bibliography  
  25.  2
    G. H. Matthews (1972). Review: Seymour Ginsburg, Thomas N. Hibbard, Joseph S. Ullian, Sequences in Context Free Languages. [REVIEW] Journal of Symbolic Logic 37 (1):197-197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26.  2
    Rohit Parikh (1969). Review: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars. [REVIEW] Journal of Symbolic Logic 34 (4):658-658.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27.  3
    D. Terence Langendoen (1967). Review: Joseph Ullian, Failure of a Conjecture About Context Free Languages. [REVIEW] Journal of Symbolic Logic 32 (2):266-267.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  3
    Rolf Wilkens & Helmut Schnelle (1990). A Connectionist Parser for Context-Free Phrase Structure Grammars. In G. Dorffner (ed.), Konnektionismus in Artificial Intelligence Und Kognitionsforschung. Berlin: Springer-Verlag 38--47.
    Direct download  
     
    Export citation  
     
    My bibliography  
  29. Joseph Ullian (1967). Failure of a Conjecture About Context Free Languages. Journal of Symbolic Logic 32 (2):266-267.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  30. Andrzej Blikle (1968). Ginsburg Seymour. The Mathematical Theory of Context Free Languages. McGraw-Hill Book Company, New York, San Francisco, St, Louis, Toronto, London, and Sydney, 1966, Xii + 232 Pp. [REVIEW] Journal of Symbolic Logic 33 (2):300-301.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. Rpg de Rijk (1968). Une grammaire [s, f]«context-free» pour la generation mecanique Des noms Des nombres francais. In P. Braffort & F. van Scheepen (eds.), Automation in Language Translation and Theorem Proving. Brussels, Commission of the European Communities, Directorate-General for Dissemination of Information
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  32. Olivier Finkel (2013). The Determinacy of Context-Free Games. Journal of Symbolic Logic 78 (4):1115-1134.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33. Seymour Ginsburg, Joseph Ullian & Thomas N. Hibbard (1968). Ambiguity in Context Free Languages. Journal of Symbolic Logic 33 (2):301-302.
    Direct download  
     
    Export citation  
     
    My bibliography  
  34. Seymour Ginsburg (1971). Greibach Sheila A.. The Unsolvability of the Recognition of Linear Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 582–587. [REVIEW] Journal of Symbolic Logic 36 (4):693.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35. S. Ginsburg (1972). Hartmanis J.. Context-Free Languages and Turing Machine Computations. Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, Providence 1967, Pp. 42–51. [REVIEW] Journal of Symbolic Logic 37 (4):759.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36. Asa Kasher (1969). Ginsburg Seymour and Spanier Edwin H.. Quotients of Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 487–492. [REVIEW] Journal of Symbolic Logic 34 (1):135-136.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37. G. H. Matthews (1967). Chomsky N. And Schützenberger M. P.. The Algebraic Theory of Context-Free Languages. Computer Programming and Formal Systems, Edited by Braffort P. And Hirschberg D., Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam 1963, Pp. 118–161. [REVIEW] Journal of Symbolic Logic 32 (3):388-389.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38. G. H. Matthews (1972). Ginsburg Seymour, Hibbard Thomas N., and Ullian Joseph S.. Sequences in Context Free Languages. Illinois Journal of Mathematics, Vol. 9 , Pp. 321–337. [REVIEW] Journal of Symbolic Logic 37 (1):197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39. G. H. Matthews (1972). Ullian Joseph S.. Partial Algorithm Problems for Context Free Languages. Information and Control, Vol. 11 , Pp. 80–101. Journal of Symbolic Logic 37 (1):196-197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Katsuhiko Nakamura & Akemi Hoshina (2006). Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search. Transactions of the Japanese Society for Artificial Intelligence 21:371-379.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. Rohit Parikh (1969). Greibach Sheila. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 42–52. [REVIEW] Journal of Symbolic Logic 34 (4):658.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42. Michael O. Rabin (1969). Schützenberger M. P.. On Context-Free Languages and Push-Down Automata. Information and Control, Vol. 6 , Pp. 246–264. Journal of Symbolic Logic 34 (2):297-298.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  43. Walter J. Savitch (1972). Lewis P. M. II, Stearns R. E., and Hartmanis J.. Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, Pp. 191–202. See Errata, Ibid., P. 190. [REVIEW] Journal of Symbolic Logic 37 (3):625.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44. Richard Stanley (1968). Ginsburg Seymour and Greibach Sheila. Deterministic Context Free Languages. Informarion and Control, Vol. 9 , Pp. 620–648. [REVIEW] Journal of Symbolic Logic 33 (2):302.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. D. Terence Langendoen (1968). Ginsburg Seymour and Ullian Joseph. Ambiguity in Context Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 62–89.Ginsburg Seymour and Ullian Joseph. Preservation of Unambiguity and Inherent Ambiguity in Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 364–368.Hibbard Thomas N. And Ullian Joseph, The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 588–593. [REVIEW] Journal of Symbolic Logic 33 (2):301-302.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. D. Terence Langendoen (1967). Ullian Joseph. Failure of a Conjecture About Context Free Languages. Information and Control, Vol. 9 , Pp. 61–65. Journal of Symbolic Logic 32 (2):266-267.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47.  4
    Alan S. Brown & Benton J. Underwood (1974). Verbal Context Shifts and Free Recall. Journal of Experimental Psychology 102 (1):133.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  48.  53
    M. van den Hoven (2012). Why One Should Do One's Bit: Thinking About Free Riding in the Context of Public Health Ethics. Public Health Ethics 5 (2):154-160.
    Vaccination programmes against infectious diseases aim to protect individuals from serious illness but also offer collective protection once a sufficient number of people have been immunized. This so-called ‘herd immunity’ is important for individuals who, for health reasons, cannot be immunized or who respond less well to vaccines. For these individuals, it is pivotal that others establish group protection. However, herd immunity can be compromised when people deliberately decide not to be immunized and benefit from the herd’s protection. These agents (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49. Jason S. Miller, Free Will in Context: A Defense of Descriptive Variantism.
    Are free will and determinism compatible? Philosophical focus on this deceptively simple `compatibility question' has historically been so pervasive that the entire free will debate is now standardly framed in its terms - that is, as a dispute between compatibilists, who answer the question affirmatively, and incompatibilists, who respond in the negative. This dissertation, in contrast, adopts a position that I call `descriptive variantism,' according to which prevailing notions of free will exhibit significant aspects of both compatibilism and incompatibilism. My (...)
     
    Export citation  
     
    My bibliography  
  50. Björn Lellmann & Dirk Pattinson (2013). Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. In Kamal Lodaya (ed.), Logic and its Applications. Springer 148--160.
1 — 50 / 1000