Sciweavers

    81
    Voted
    COLING
    2002
    95views Computational Linguistics» more  COLING 2002»
    Guaranteeing Parsing Termination of Unification Grammars
    15 years 29 days ago
    Guaranteeing Parsing Termination of Unification Grammars
    Download  acl.ldc.upenn.edu
    Unification grammars are known to be Turingequivalent; given a grammar and a word
    Efrat Jaeger, Nissim Francez, Shuly Wintner
    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-2026, USA.