Sciweavers

    ACL
    1997
    87views Computational Linguistics» more  ACL 1997»
    A Uniform Approach to Underspecification and Parallelism
    14 years 6 days ago
    A Uniform Approach to Underspecification and Parallelism
    Download  www.aclweb.org
    We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
    Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
    claim paper
    Read More »
    ACL
    1997
    83views Computational Linguistics» more  ACL 1997»
    Applying Explanation-based Learning to Control and Speeding-up Natural Language Generation
    14 years 6 days ago
    Applying Explanation-based Learning to Control and Speeding-up Natural Language Generation
    Download  www.aclweb.org
    This paper presents a method for the automatic extraction of subgrammars to control and speeding-up natural language generation NLG. The method is based on explanation-based learn...
    Günter Neumann
    claim paper
    Read More »
    ACL
    1997
    88views Computational Linguistics» more  ACL 1997»
    A Flexible POS Tagger Using an Automatically Acquired Language Model
    14 years 6 days ago
    A Flexible POS Tagger Using an Automatically Acquired Language Model
    Download  www.lsi.upc.edu
    Lluís Màrquez, Lluís Padr&oac...
    claim paper
    Read More »
    ACL
    1997
    103views Computational Linguistics» more  ACL 1997»
    A Word-to-Word Model of Translational Equivalence
    14 years 6 days ago
    A Word-to-Word Model of Translational Equivalence
    Download  www.aclweb.org
    Many multilingual NLP applications need to translate words between different languages, but cannot afford the computational expense of inducing or applying a full translation mode...
    I. Dan Melamed
    claim paper
    Read More »
    ACL
    1997
    76views Computational Linguistics» more  ACL 1997»
    A Portable Algorithm for Mapping Bitext Correspondence
    14 years 6 days ago
    A Portable Algorithm for Mapping Bitext Correspondence
    Download  www.aclweb.org
    The first step in most empirical work in multilingual NLP is to construct maps of the correspondence between texts and their translations (bitext maps). The Smooth Injective Map R...
    I. Dan Melamed
    claim paper
    Read More »
    ACL
    1997
    128views Computational Linguistics» more  ACL 1997»
    Using Syntactic Dependency as Local Context to Resolve Word Sense Ambiguity
    14 years 6 days ago
    Using Syntactic Dependency as Local Context to Resolve Word Sense Ambiguity
    Download  www.aclweb.org
    Most previous corpus-based algorithms disambiguate a word with a classifier trained from previous usages of the same word. Separate classifiers have to be trained for different wo...
    Dekang Lin
    claim paper
    Read More »
    ACL
    1997
    81views Computational Linguistics» more  ACL 1997»
    Generative Power of CCGs with Generalized Type-Raised Categories
    14 years 6 days ago
    Generative Power of CCGs with Generalized Type-Raised Categories
    Download  www.aclweb.org
    This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to ...
    Nobo Komagata
    claim paper
    Read More »
    ACL
    1997
    135views Computational Linguistics» more  ACL 1997»
    Ambiguity Resolution for Machine Translation of Telegraphic Messages
    14 years 6 days ago
    Ambiguity Resolution for Machine Translation of Telegraphic Messages
    Download  www.aclweb.org
    Telegraphic messages with numerous instances of omission pose a new challenge to parsing in that a sentence with omission causes a higher degree of ambi6uity than a sentence witho...
    Young-Suk Lee, Clifford J. Weinstein, Stephanie Se...
    claim paper
    Read More »
    ACL
    1997
    79views Computational Linguistics» more  ACL 1997»
    Machine Transliteration
    14 years 6 days ago
    Machine Transliteration
    Download  reference.kfupm.edu.sa
    Kevin Knight, Jonathan Graehl
    claim paper
    Read More »
    ACL
    1997
    103views Computational Linguistics» more  ACL 1997»
    Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
    14 years 6 days ago
    Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
    Download  www.aclweb.org
    Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
    Lillian Lee
    claim paper
    Read More »
    « first‹ previous1234567next ›last »
    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.