Sciweavers

    421 search results - page 1 / 85
    » A Computational Model Of Language Performance: Data Oriented...
    Sort
    View
    COLING
    1992
    85views Computational Linguistics» more  COLING 1992»
    A Computational Model Of Language Performance: Data Oriented Parsing
    13 years 5 months ago
    A Computational Model Of Language Performance: Data Oriented Parsing
    Download  acl.ldc.upenn.edu
    Rens Bod
    claim paper
    Read More »
    COLING
    1996
    90views Computational Linguistics» more  COLING 1996»
    Restricted Parallelism in Object-Oriented Lexical Parsing
    13 years 6 months ago
    Restricted Parallelism in Object-Oriented Lexical Parsing
    Download  acl.ldc.upenn.edu
    We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...
    Peter Neuhaus, Udo Hahn
    claim paper
    Read More »
    EDOC
    2004
    IEEE
    128views Distributed And Parallel Com...» more  EDOC 2004»
    Write Once, Deploy N: A Performance Oriented MDA Case Study
    13 years 8 months ago
    Write Once, Deploy N: A Performance Oriented MDA Case Study
    Download  drops.dagstuhl.de
    To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, ...
    Pieter Van Gorp, Dirk Janssens, Tracy Gardner
    claim paper
    Read More »
    ACL
    2010
    149views Computational Linguistics» more  ACL 2010»
    Hierarchical Joint Learning: Improving Joint Parsing and Named Entity Recognition with Non-Jointly Labeled Data
    13 years 2 months ago
    Hierarchical Joint Learning: Improving Joint Parsing and Named Entity Recognition with Non-Jointly Labeled Data
    Download  www-nlp.stanford.edu
    One of the main obstacles to producing high quality joint models is the lack of jointly annotated data. Joint modeling of multiple natural language processing tasks outperforms si...
    Jenny Rose Finkel, Christopher D. Manning
    claim paper
    Read More »
    COLING
    1996
    131views Computational Linguistics» more  COLING 1996»
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    13 years 6 months ago
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    Download  staff.science.uva.nl
    This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
    Khalil Sima'an
    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.