Predictive, Earley-style parsing for unrestricted relational grammars faces a number of problems not present in a context-free string grammar counterpart. Here a subclass of unrestricted relational grammars called fringe relational grammars is proposed along with an Earley-style recognition algorithm. The grammar makes use of fringe elements (the minimal and maximal elements of partially ordered sets) in defining its productions. The parsing algorithm uses indexing methods based on fringe elements in order to take advantage of equivalence relations on parse table entries, thus avoiding redundant processing.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Earley-style parsing for relational grammars


    Contributors:


    Publication date :

    1992-01-01


    Size :

    781350 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Learning Grammars for Architecture-Specific Facade Parsing

    Gadde, R. / Marlet, R. / Paragios, N. | British Library Online Contents | 2016




    Parsing Orion

    Craig Covault | Online Contents | 2015


    Learning daily activity patterns with probabilistic grammars

    Li, Siyu / Lee, Der-Horng | Online Contents | 2015