See this document in CiteSeerX!

Automatic Synthesis of Semantics for Context-free Grammars (1991)  (Make Corrections)  
Juergen Haas, Bharat Jayaraman



  Home/Search   Context   Related

 
View or download:
buffalo.edu/pub/techrepor...9109.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  buffalo.edu/pub/techrep...README (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We are investigating the mechanical transformation of an unambiguous context-free grammar (CFG) into a definite-clause grammar (DCG) using a finite set of examples, each of which is a pair hs; mi, where s is a sentence belonging to the language defined by the CFG and m is a semantic representation (meaning) of s. The resulting DCG would be such that it can be executed (by the interpreter of a logic programming language) to compute the semantics for every sentence of the original DCG. Three... (Update)

Active bibliography (related documents):   More   All
0.5:   From Context-Free To Definite-Clause Grammars: A.. - Juergen Haas (1993)   (Correct)
0.5:   Acquiring Recursive and Iterative Concepts with Explanation-Based .. - Shavlik (1989)   (Correct)
0.5:   Typology Study of French Technical Texts, with a View to.. - Roudaud   (Correct)

Similar documents based on text:   More   All
0.3:   Some extensions of Context-free Rewriting - Fioravanti, Gattari, Zilli   (Correct)
0.2:   Grammatiche Di Metamorfosi - Omodeo   (Correct)
0.2:   Logic Grammars and λProlog - Le Huitouze, Louvet, Ridoux (1993)   (Correct)

BibTeX entry:   (Update)

@techreport{ haas91automatic,
    author = "J. Haas and B. Jayaraman",
    title = "Automatic Synthesis of Semantics for Context-free Grammars",
    number = "91-09",
    year = "1991",
    url = "citeseer.ist.psu.edu/haas91automatic.html" }
Citations (may not include all citations):
634   A Machine-Oriented Logic Based on the Resolution Principle (context) - Robinson - 1965
267   A Note on Inductive Generalization (context) - Plotkin - 1970
174   A unification algorithm for typed -calculus (context) - Huet - 1975
166   An Overview of Prolog (context) - Nadathur, Miller - 1988
166   Unification Revisited (context) - Lassez, Maher et al. - 1988
145   Machine Learning: An Artificial Intelligence Approach (context) - Michalski, Carbonell et al. - 1983
135   Definite Clause Grammars for Language Analysis - A Survey of.. (context) - Pereira, Warren - 1980
121   Learning Structural Descriptions from Examples (context) - Winston - 1975
113   Toward a mathematical theory of inductive inference (context) - Blum, Blum - 1975
105   Introduction to Montague Semantics (context) - David, Wall et al. - 1981
104   Transition network grammars for natural language analysis (context) - Woods - 1970
76   Conceptual Information Processing (context) - Schank - 1975
69   A Further Note on Inductive Generalization (context) - Plotkin - 1971
68   Version Spaces: An Approach to Concept Learning (context) - Mitchell - 1978
53   Prolog and Natural-Language Analysis (context) - Pereira - 1987
50   Programming Language Theory and its Implementation (context) - Gordon - 1988
47   A methodology for LISP program construction from examples (context) - Summers - 1977
35   The SNePS Semantic Network Processing System (context) - Shapiro - 1979
30   A uniform architecture for parsing and generation (context) - Shieber - 1986
27   Metamorphosis Grammars (context) - Colmerauer - 1978
21   Induction of Concepts in the Predicate Calculus (context) - Vere - 1975
17   Induction of Augmented Transition Networks (context) - Anderson - 1977
16   Acquiring Recursive and Iterative Concepts with Explanation-.. - Shavlik - 1990
13   The Synthesis of LISP Programs from Examples: A Survey (context) - Smith - 1984
13   Semantic Interpretation as Higher-Order Deduction - Pereira - 1990
12   Machine translation: Theoretical and methodological issues (context) - Sergei - 1987
12   Logic Grammars (context) - Abramson, Dahl - 1989
11   Programming by Examples (context) - Bauer - 1979
10   Natural Language Understanding and Logic Programming II (context) - Dahl, Saint-Dizier - 1988
9   Polynomial Time Learnability of Simple Deterministic Languag.. (context) - Ishizaka - 1990
8   CRITTER: a translation system for agricultural market report.. (context) - Isabelle, Dymetman et al. - 1988
6   Towards a WAM Model for Lambda-Prolog (context) - Nadathur, Jayaraman - 1989
4   Montague Grammar and Machine Translation (context) - Landsbergen - 1987
3   Learning to Integrate Syntax and Semantics (context) - Lehnert - 1987
3   Communicating with Databases in Natural Language (context) - Wallace - 1984
3   A class of functions synthesized from a finite number of exa.. (context) - Kodratoff - 1979
2   Grammar bidirectionality through controlled backward deducti.. (context) - Dymetman, Isabelle - 1990
2   Machine translation: past, present, future (context) - Hutchins - 1986
1   Theorem Proving By The Study Of Example Proof Traces or Theo.. (context) - Castaing, Kodratoff - 1984
1   Mechanizing !-Order Type Theory through Unification (context) - Jensen, Pietrzykowski - 1976

Documents on the same site (http://www.cs.buffalo.edu/pub/tech-reports/README.html):   More
Information Capacity of Binary Weights Associative Memories - Jagota, Narasimhan, Regan (1996)   (Correct)
On Self-Testing without the Generator Bottleneck - Ravikumar, Sivakumar (1995)   (Correct)
The Design of Uncheatable Benchmarks Using Complexity Theory - Cai, Nerurkar, Wu (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC