15,419 Hits in 7.4 sec

Definite-clause set grammars: a formalism for problem solving

Takushi Tanaka
1991 The Journal of Logic Programming  
D First, we present definite-clause set grammars (DCSG), a DCG-like formalism for free-word-order languages. The DCSG formalism is well suited for problem solving.  ...  The difference set method can be viewed as a definite-clause grammar for free-word-order languages. Here, we first formalize the previously developed method as definite-clause set grammars (DCSGs).  ...  These different kinds of rules are consolidated into the same set-conversion syntax, and translated into definite clauses.  ... 
doi:10.1016/0743-1066(91)90002-7 fatcat:62yzwpqbtfaenbn65vl3ckfxxy

Search for Minimal and Semi-Minimal Rule Sets in Incremental Learning of Context-Free and Definite Clause Grammars

Keita IMADA, Katsuhiko NAKAMURA
2010 IEICE transactions on information and systems  
Keita IMADA †a) , Nonmember and Katsuhiko NAKAMURA †b) , Member SUMMARY This paper describes recent improvements to Synapse system for incremental learning of general context-free grammars (CFGs) and definite  ...  clause grammars (DCGs) from positive and negative sample strings.  ...  This work is partially supported by KAKENHI 21500148 and the Research Institute for Technology of Tokyo Denki University, Q09J-06.  ... 
doi:10.1587/transinf.e93.d.1197 fatcat:2374p2s63vbl5ddfoo5zrwtvvq

Grammar Testing [chapter]

Ralf Lämmel
2001 Lecture Notes in Computer Science  
Grammar recovery is concerned with the derivation of a language's grammar from some available resource such as a semi-formal language reference.  ...  We propose a generalisation of the known rule coverage for grammars, that is, contextdependent branch coverage.  ...  The described sensitivity problem is solved if N B(G) is chosen for M . Example 6. Recall the problem from Example 5.  ... 
doi:10.1007/3-540-45314-8_15 fatcat:7e4yfeogsbfibeltgogkbmb7i4

Universal Grammar is a universal grammar

Ramón Casares
2017 Figshare  
We answer the first showing that the syntax of a complete language can be decidable, and blaming functional semantics for the undecidability, where functional semantics is the semantics of syntax.  ...  This thesis makes evolutionary sense, and natural languages are expressive enough, but two issues against it remain: natural language syntax is decidable, and not every possible language can be a natural  ...  solves a problem implies that there is no way of solving it.  ... 
doi:10.6084/m9.figshare.4956764.v1 fatcat:ricybalftbhafhm4535e73dypy

D-Tree Grammars [article]

Owen Rambow, K. Vijay-Shanker, David Weir
1995 arXiv   pre-print
Furthermore, DTG, unlike TAG, can provide a uniform analysis for em wh-movement in English and Kashmiri, despite the fact that the em wh element in Kashmiri appears in sentence-second position, and not  ...  Acknowledgements We would like to thank Rakesh Bhatt for help with the Kashmiri data.  ...  Rambow was supported by the North Atlantic Treaty Organization under a Grant awarded in 1993, while at TALANA, Université Paris 7.  ... 
arXiv:cmp-lg/9505028v1 fatcat:fesry2uq5nhjtjwssfy6k4jmfm

CHR Grammars [article]

Henning Christiansen
2004 arXiv   pre-print
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog.  ...  CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.  ...  discussion and providing a stimulating environment.  ... 
arXiv:cs/0408027v1 fatcat:shdar77jqfbn5pq4d7pv4w34p4

Interaction Grammars [article]

Bruno Guillaume, Guy Perrier (INRIA Lorraine - LORIA)
2008 arXiv   pre-print
Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity.  ...  It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying  ...  proposal for the extension of IG to the semantic level but we can envisage other approaches using existing semantic formalisms such as MRS [12] or CLLS [16] .  ... 
arXiv:0809.0494v1 fatcat:6d2k7rzpxbd4dlsmi74m63c2ua

Feature-constraint logics for unification grammars

Gert Smolka
1992 The Journal of Logic Programming  
For quantifier-free constraints we give a constraint solving method and show the NP-completeness of satisfiability checking.  ...  Moreover, we investigate an extension of the logic with sort predicates and set-denoting expressions called feature terms. a  ...  The word problem of a grammar is to decide for a given sequence of words whether it is a sentence of the grammar.  ... 
doi:10.1016/0743-1066(92)90039-6 fatcat:5zgeh7rcvnggfeldaxwq4qlkcm

D-tree grammars

Owen Rambow, K. Vijay-Shanker, David Weir
1995 Proceedings of the 33rd annual meeting on Association for Computational Linguistics -  
Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial  ...  Acknowledgements We would like to thank Rakesh Bhatt for help with the Kashmiri data.  ...  R, ambow was supported by the North Atlantic Treaty Organization under a Grant awarded in 1993, while at TALANA, Universitd Paris 7.  ... 
doi:10.3115/981658.981679 dblp:conf/acl/RambowVW95 fatcat:q2p6asth4zau7hyoszc3mij2tu

Relating logic programs and attribute grammars

Pierre Deransart, Jan Małuszynski
1985 The Journal of Logic Programming  
This opens for application in logic programming of some methods developed for attribute grammars.  ...  These results are used to find a sufficient condition under which no infinite term can be created during a computation of a logic program, and to define a nontrivial class of logic programs which can be  ...  Our approach to the occur-check problem makes it possible to relate formally the well-formedness problem for FAGS to the occur-check problem for a class of DCPs.  ... 
doi:10.1016/0743-1066(85)90015-9 fatcat:y27xqktfq5g5hmrmsgdmlk5exe

Quantitative Constraint Logic Programming for Weighted Grammar Applications [article]

Stefan Riezler
1997 arXiv   pre-print
the parsing problem for such weighted grammars.  ...  Constraint logic grammars provide a powerful formalism for expressing complex logical descriptions of natural language phenomena in exact terms.  ...  This problem can be illustrated for formal grammars describing a nontrivial domain of natural language as follows: For such grammars every input of reasonable length may receive a large number of different  ... 
arXiv:cmp-lg/9705006v1 fatcat:3bzkk5e4vve3tfhfmiwrg6aftu

The relationship between Tree Adjoining Grammars and Head Grammars

D. J. Weir, K. Vijay-Shanker, A. K. Joshi
1986 Proceedings of the 24th annual meeting on Association for Computational Linguistics -  
Pollard [5] has suggested that HG can be used to provide an appropriate analysis for easy problems to solve. He does not provide a detailed analysis but it is roughly as follows. NP LL2 J AP NP /\ I  ...  67 We examine the relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammars. We briefly investigate the weak equivalence of the two formalisms.  ...  obtain easy to solve and problems as intermediate phrases. by splitting about the head and the foot node in both the grammars.  ... 
doi:10.3115/981131.981142 dblp:conf/acl/WeirVJ86 fatcat:7pbvoluokfaqpffdtcwc5gjknu

Distributed Authorization with Distributed Grammars [chapter]

Martín Abadi, Mike Burrows, Himabindu Pucha, Adam Sadovsky, Asim Shankar, Ankur Taly
2015 Lecture Notes in Computer Science  
This paper describes a design for authorization in distributed systems that treats groups as formal languages. The design supports forms of delegation and negative clauses in authorization policies.  ...  While groups are generally helpful for the definition of authorization policies, their use in distributed systems is not straightforward.  ...  Acknowledgments We are grateful to Cosmos Nicolaou and to JiříŠimša for helpful comments on drafts of this paper.  ... 
doi:10.1007/978-3-319-25527-9_3 fatcat:uncsjojjfjektagqmvxlldkvlm

E-generalization using grammars

Jochen Burghardt
2005 Artificial Intelligence  
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets.  ...  We demonstrate the potential power of E-generalization by three example applications: computation of suggestions for auxiliary lemmas in equational inductive proofs, computation of construction laws for  ...  Such a set cannot be represented by any grammar formalism that is closed wrt language intersection and allows testing for emptiness. Proof.  ... 
doi:10.1016/j.artint.2005.01.008 fatcat:jookh6gakje45ljufuzytgczom

A meta-level grammar

Mark Dras
1999 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -  
This paper shows how a meta-grammar, defining structure at the meta level, is useful in the case of such operations; in particular, how it solves problems in the current definition of Synchronous TAG (  ...  Shieber, 1994) caused by ignoring such structure in mapping between grammars, for applications such as translation.  ...  In a practical application, it solves problems in one such formalism, S-TAG, when used for paraphrase or translation, as outlined by Shieber (1994) .  ... 
doi:10.3115/1034678.1034700 dblp:conf/acl/Dras99 fatcat:62qesx5yjjhvrmncr2myntmkbe
« Previous Showing results 1 — 15 out of 15,419 results