Sciweavers

    367 search results - page 40 / 74
    » Lexicalized Context-Free Grammars
    Sort
    View
    COGSCI
    2004
    92views more  COGSCI 2004»
    Varieties of crossing dependencies: structure dependence and mild context sensitivity
    13 years 8 months ago
    Varieties of crossing dependencies: structure dependence and mild context sensitivity
    Download  www.linguistics.ucla.edu
    Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
    Edward P. Stabler Jr.
    claim paper
    Read More »
    CVPR
    2006
    IEEE
    229views Computer Vision» more  CVPR 2006»
    Composite Templates for Cloth Modeling and Sketching
    14 years 10 months ago
    Composite Templates for Cloth Modeling and Sketching
    Download  www.stat.ucla.edu
    Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
    Hong Chen, Zijian Xu, Ziqiang Liu, Song Chun Zhu
    claim paper
    Read More »
    COLING
    2010
    119views Computational Linguistics» more  COLING 2010»
    A Learnable Constraint-based Grammar Formalism
    13 years 3 months ago
    A Learnable Constraint-based Grammar Formalism
    Download  acl.eldoc.ub.rug.nl
    Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
    Smaranda Muresan
    claim paper
    Read More »
    ISMB
    1994
    138views Computational Biology» more  ISMB 1994»
    Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
    13 years 9 months ago
    Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
    Download  www.bic.kyoto-u.ac.jp
    We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
    Hiroshi Mamitsuka, Naoki Abe
    claim paper
    Read More »
    COLING
    1994
    100views Computational Linguistics» more  COLING 1994»
    Two Parsing Algorithms by Means of Finite State Transducers
    13 years 9 months ago
    Two Parsing Algorithms by Means of Finite State Transducers
    Download  acl.ldc.upenn.edu
    We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
    Emmanuel Roche
    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.