Sciweavers

    347 search results - page 61 / 70
    » The ACL Anthology Searchbench
    Sort
    View
    EACL
    1989
    ACL Anthology
    121views Natural Language Processing» more  EACL 1989»
    It Would Be Much Easier If WENT Were GOED
    14 years 10 months ago
    It Would Be Much Easier If WENT Were GOED
    Download  acl.ldc.upenn.edu
    The paper proposes a paradigmatic approach to morphological knowledge acquisition. It addresses the problem of learning from examples rules for word-forms analysis and synthesis. ...
    Dan Tufis
    claim paper
    Read More »
    EACL
    1989
    ACL Anthology
    102views Natural Language Processing» more  EACL 1989»
    The Syntactic Regularity Of English Noun Phrases
    14 years 10 months ago
    The Syntactic Regularity Of English Noun Phrases
    Download  acl.ldc.upenn.edu
    Approximately, 10,000 naturally occurring noun phrases taken from the LOB corpus were used firstly, to evaluate the NP component of the Alvey ANLT grammar (Grover et al., 1987, 19...
    Lita Taylor, Claire Grover, Ted Briscoe
    claim paper
    Read More »
    EACL
    2009
    ACL Anthology
    122views Natural Language Processing» more  EACL 2009»
    Who is "You"? Combining Linguistic and Gaze Features to Resolve Second-Person References in Dialogue
    14 years 7 months ago
    Who is "You"? Combining Linguistic and Gaze Features to Resolve Second-Person References in Dialogue
    Download  www.stanford.edu
    We explore the problem of resolving the second person English pronoun you in multi-party dialogue, using a combination of linguistic and visual features. First, we distinguish gen...
    Matthew Frampton, Raquel Fernández, Patrick...
    claim paper
    Read More »
    EACL
    2009
    ACL Anthology
    126views Natural Language Processing» more  EACL 2009»
    Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
    14 years 7 months ago
    Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
    Download  www.ling.uni-potsdam.de
    We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
    Manfred Klenner, Étienne Ailloud
    claim paper
    Read More »
    EACL
    2009
    ACL Anthology
    109views Natural Language Processing» more  EACL 2009»
    MINT: A Method for Effective and Scalable Mining of Named Entity Transliterations from Large Comparable Corpora
    14 years 7 months ago
    MINT: A Method for Effective and Scalable Mining of Named Entity Transliterations from Large Comparable Corpora
    Download  research.microsoft.com
    In this paper, we address the problem of mining transliterations of Named Entities (NEs) from large comparable corpora. We leverage the empirical fact that multilingual news artic...
    Raghavendra Udupa, K. Saravanan, A. Kumaran, Jagad...
    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-2025, USA.