Sciweavers

    78 search results - page 2 / 16
    » One parser to rule them all
    Sort
    View
    COLING
    2000
    130views Computational Linguistics» more  COLING 2000»
    Robust German Noun Chunking With a Probabilistic Context-Free Grammar
    13 years 6 months ago
    Robust German Noun Chunking With a Probabilistic Context-Free Grammar
    Download  www.aclweb.org
    We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...
    Helmut Schmid, Sabine Schulte im Walde
    claim paper
    Read More »
    JAC
    2008
    209views Artificial Intelligence» more  JAC 2008»
    Sofic one head machines
    13 years 6 months ago
    Sofic one head machines
    Download  www.lif.univ-mrs.fr
    There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
    Anahí Gajardo
    claim paper
    Read More »
    ACL
    1996
    122views Computational Linguistics» more  ACL 1996»
    Efficient Normal-Form Parsing for Combinatory Categorial Grammar
    13 years 6 months ago
    Efficient Normal-Form Parsing for Combinatory Categorial Grammar
    Download  www.aclweb.org
    Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
    Jason Eisner
    claim paper
    Read More »
    ICC
    2007
    IEEE
    74views Communications» more  ICC 2007»
    Reducing the Size of Rule Set in a Firewall
    13 years 11 months ago
    Reducing the Size of Rule Set in a Firewall
    Download  www.prism.uvsq.fr
    — A firewall’s complexity is known to increase with the size of its rule set. Complex firewalls are more likely to have configuration errors which cause security loopholes. ...
    MyungKeun Yoon, Shigang Chen, Zhan Zhang
    claim paper
    Read More »
    ACL
    2009
    102views Computational Linguistics» more  ACL 2009»
    Paraphrase Recognition Using Machine Learning to Combine Similarity Measures
    13 years 3 months ago
    Paraphrase Recognition Using Machine Learning to Combine Similarity Measures
    Download  www.aclweb.org
    This paper presents three methods that can be used to recognize paraphrases. They all employ string similarity measures apshallow abstractions of the input sentences, and a Maximu...
    Prodromos Malakasiotis
    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.