Sciweavers

    COLING
    2000
    80views Computational Linguistics» more  COLING 2000»
    Text Genre Detection Using Common Word Frequencies
    14 years 27 days ago
    Text Genre Detection Using Common Word Frequencies
    Download  acl.ldc.upenn.edu
    In this paper we present a method for detecting the text genre quickly and easily following an approach originally proposed in authorship attribution studies which uses as style m...
    Efstathios Stamatatos, Nikos Fakotakis, George K. ...
    claim paper
    Read More »
    COLING
    2000
    88views Computational Linguistics» more  COLING 2000»
    An empirical method for identifying and translating technical terminology
    14 years 27 days ago
    An empirical method for identifying and translating technical terminology
    Download  acl.ldc.upenn.edu
    Sayori Shimohata
    claim paper
    Read More »
    COLING
    2000
    151views Computational Linguistics» more  COLING 2000»
    Automatic Corpus-Based Thai Word Extraction with the C4.5 Learning Algorithm
    14 years 27 days ago
    Automatic Corpus-Based Thai Word Extraction with the C4.5 Learning Algorithm
    Download  acl.ldc.upenn.edu
    "Word" is difficult to define in the languages that do not exhibit explicit word boundary, such as Thai. Traditional methods on defining words for this kind of languages...
    Virach Sornlertlamvanich, Tanapong Potipiti, Thats...
    claim paper
    Read More »
    COLING
    2000
    78views Computational Linguistics» more  COLING 2000»
    Making Sense of Reference to the Unfamiliar?
    14 years 27 days ago
    Making Sense of Reference to the Unfamiliar?
    Download  acl.ldc.upenn.edu
    Helen Seville, Allan Ramsay
    claim paper
    Read More »
    COLING
    2000
    115views Computational Linguistics» more  COLING 2000»
    Backward Beam Search Algorithm for Dependency Analysis of Japanese
    14 years 27 days ago
    Backward Beam Search Algorithm for Dependency Analysis of Japanese
    Download  cs.nyu.edu
    Backward beam search for dependency analysis of Japanese is proposed. As dependencies normally go from left to right in Japanese, it is effective to analyze sentences backwards (f...
    Satoshi Sekine, Kiyotaka Uchimoto, Hitoshi Isahara
    claim paper
    Read More »
    COLING
    2000
    115views Computational Linguistics» more  COLING 2000»
    Japanese Named Entity Extraction Evaluation - Analysis of Results
    14 years 27 days ago
    Japanese Named Entity Extraction Evaluation - Analysis of Results
    Download  cs.nyu.edu
    We will report on one of the two tasks in the IREX (Information Retrieval and Extraction Exercise) project, an evaluation-based project for Information Retrieval and Information E...
    Satoshi Sekine, Yoshio Eriguchi
    claim paper
    Read More »
    COLING
    2000
    86views Computational Linguistics» more  COLING 2000»
    Japanese Dependency Analysis using a Deterministic Finite State Transducer
    14 years 27 days ago
    Japanese Dependency Analysis using a Deterministic Finite State Transducer
    Download  cs.nyu.edu
    A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
    Satoshi Sekine
    claim paper
    Read More »
    COLING
    2000
    92views Computational Linguistics» more  COLING 2000»
    Realizing Expressions of Doubt in Collaborative Dialogue
    14 years 27 days ago
    Realizing Expressions of Doubt in Collaborative Dialogue
    Download  acl.ldc.upenn.edu
    One way to 1)egin a negotiation subdialogue is to express doubt at a proposition. However, expressions of doubt occur in a variety of forms, each of which conveys information abou...
    Leah Schroeder, Sandra Carberry
    claim paper
    Read More »
    COLING
    2000
    74views Computational Linguistics» more  COLING 2000»
    Parsing Schemata for Grammars with Variable Number and Order of Constituents
    14 years 27 days ago
    Parsing Schemata for Grammars with Variable Number and Order of Constituents
    Download  acl.ldc.upenn.edu
    We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
    Karl-Michael Schneider
    claim paper
    Read More »
    COLING
    2000
    130views Computational Linguistics» more  COLING 2000»
    Robust German Noun Chunking With a Probabilistic Context-Free Grammar
    14 years 27 days 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 »
    « first‹ previous…100101102103104105106107108…next ›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.