Sciweavers

    26 search results - page 6 / 6
    » Strong Lexicalization of Tree Adjoining Grammars
    Sort
    View
    COLING
    2002
    153views Computational Linguistics» more  COLING 2002»
    Creating a Finite-State Parser with Application Semantics
    13 years 4 months ago
    Creating a Finite-State Parser with Application Semantics
    Download  acl.ldc.upenn.edu
    Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
    Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
    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.