Sciweavers

    16 search results - page 1 / 4
    » The Complexity Of Parsing With Extended Categorial Grammars
    Sort
    View
    COLING
    1990
    76views Computational Linguistics» more  COLING 1990»
    The Complexity Of Parsing With Extended Categorial Grammars
    13 years 5 months ago
    The Complexity Of Parsing With Extended Categorial Grammars
    Download  acl.ldc.upenn.edu
    Esther König
    claim paper
    Read More »
    IPL
    2008
    99views more  IPL 2008»
    A CKY parser for picture grammars
    13 years 4 months ago
    A CKY parser for picture grammars
    Download  home.dei.polimi.it
    We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
    Stefano Crespi-Reghizzi, Matteo Pradella
    claim paper
    Read More »
    ACL
    1990
    147views Computational Linguistics» more  ACL 1990»
    Polynomial Time Parsing of Combinatory Categorial Grammars
    13 years 5 months ago
    Polynomial Time Parsing of Combinatory Categorial Grammars
    Download  www.aclweb.org
    In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
    K. Vijay-Shanker, David J. Weir
    claim paper
    Read More »
    COLING
    2000
    98views Computational Linguistics» more  COLING 2000»
    Structural disambiguation of morpho-syntactic categorial parsing for Korean
    13 years 5 months ago
    Structural disambiguation of morpho-syntactic categorial parsing for Korean
    Download  acl.ldc.upenn.edu
    The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
    Jeongwon Cha, Gary Geunbae Lee
    claim paper
    Read More »
    ACTA
    2007
    114views more  ACTA 2007»
    Recursive descent parsing for Boolean grammars
    13 years 4 months ago
    Recursive descent parsing for Boolean grammars
    Download  users.utu.fi
    The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
    Alexander Okhotin
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.