Sciweavers

    15 search results - page 2 / 3
    » Parsing Free Word Order Languages in the Paninian Framework
    Sort
    View
    ANLP
    2000
    124views more  ANLP 2000»
    A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
    13 years 7 months ago
    A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
    Download  www.coli.uni-saarland.de
    We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
    Günter Neumann, Christian Braun, Jakub Piskor...
    claim paper
    Read More »
    ACL
    2012
    215views Computational Linguistics» more  ACL 2012»
    Post-ordering by Parsing for Japanese-English Statistical Machine Translation
    11 years 8 months ago
    Post-ordering by Parsing for Japanese-English Statistical Machine Translation
    Download  aclweb.org
    Reordering is a difficult task in translating between widely different languages such as Japanese and English. We employ the postordering framework proposed by (Sudoh et al., 201...
    Isao Goto, Masao Utiyama, Eiichiro Sumita
    claim paper
    Read More »
    ACL
    2009
    134views Computational Linguistics» more  ACL 2009»
    Quadratic-Time Dependency Parsing for Machine Translation
    13 years 3 months ago
    Quadratic-Time Dependency Parsing for Machine Translation
    Download  nlp.stanford.edu
    Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
    Michel Galley, Christopher D. Manning
    claim paper
    Read More »
    ACL
    2004
    125views Computational Linguistics» more  ACL 2004»
    Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
    13 years 7 months ago
    Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
    Download  idiom.ucsd.edu
    We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
    Roger Levy, Christopher D. Manning
    claim paper
    Read More »
    NLP
    2000
    174views Natural Language Processing» more  NLP 2000»
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    13 years 9 months ago
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    Download  liawww.epfl.ch
    Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
    Jean-Cédric Chappelier, Martin Rajman
    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.