Carnegie Mellon University
Browse
file.pdf (1.27 MB)

An overview of parse completion

Download (1.27 MB)
journal contribution
posted on 2010-01-01, 00:00 authored by Steven J. Nowlan, Artificial Intelligence and Psychology Project.
Abstract: "Hierarchical knowledge structures are pervasive in Artificial Intelligence, yet very little is understood about how such structures may be effectively acquired. One way to represent the hierarchical component of knowledge structure is to use grammars. The grammar framework also provides a natural way to apply failure-driven learning to guide the induction of hierarchical structures. The conjunction of hierarchical knowledge structures and failure-driven learning defines a class of algorithms, which we call Parse Completion algorithms. This paper presents an overview of the results derived from a theoretical exploration of this class of algorithms."

History

Date

2010-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC