Sciweavers

    2 search results - page 1 / 1
    » On Parsing and Condensing Substrings of LR Languages in Line...
    Sort
    View
    WIA
    1998
    Springer
    110views Artificial Intelligence» more  WIA 1998»
    On Parsing and Condensing Substrings of LR Languages in Linear Time
    15 years 7 months ago
    On Parsing and Condensing Substrings of LR Languages in Linear Time
    Download  www-mmdb.iai.uni-bonn.de
    Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
    Heiko Goeman
    claim paper
    Read More »
    LACL
    2005
    Springer
    102views Automated Reasoning» more  LACL 2005»
    Strict Deterministic Aspects of Minimalist Grammars
    15 years 8 months ago
    Strict Deterministic Aspects of Minimalist Grammars
    Download  www.linguistics.ucla.edu
    The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
    John T. Hale, Edward P. Stabler
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.