Báo cáo khoa học: "AN AUTOMATIC SPEECH RECOGNITION SYSTEM FOR ITALIAN LANGUAGE" doc
... AN AUTOMATIC SPEECH RECOGNITION SYSTEM FOR T! IE ITALIAN LANGUAGE Paolo D'Orta, Marco Ferretti, Alessandro Martelli, ... IBM Rome Scientific Center via Giorgione 159, ROME (Italy) ABSTRACT 4. An automatic speech recognition system for Italian language has been developed at IBM Italy Scientific Center in Rome. ... dependent on any W. Then, the recognition...
Ngày tải lên: 01/04/2014, 00:20
... 764–772, Suntec, Singapore, 2-7 August 2009. c 2009 ACL and AFNLP Improving Automatic Speech Recognition for Lectures through Transformation-based Rules Learned from Minimal Data Cosmin Munteanu ∗† ∗ National ... train an ASR system for the other half or for when the course is next offered, and still results in signifi- cant WER reductions. And yet even in this sce- nario, the b...
Ngày tải lên: 20/02/2014, 07:20
... grammar system of the tar- get. system is not restricted in any way; therefore, the annotated information to the target treebank can be anything inherent from the target system; the bracket information ... an old grammar system for a corpus-based system. In this paper, we therefore proposed a simple approach for converting one treebank into another across two different gra...
Ngày tải lên: 31/03/2014, 06:20
Báo cáo khoa học: "AN AUTOMATIC METHOD OF FINDING BOUNDARIES" pdf
... useful for several different tasks. Hearst and Plaunt (1993) demonstrated their usefulness for information retrieval by showing that segmenting documents and indexing the resulting subdocuments ... segmentation can be performed ei- ther manually, by examining a graph, or automatically, using an optimization algorithm. The results of two ex- periments involving automatically locating...
Ngày tải lên: 08/03/2014, 07:20
Báo cáo khoa học: "An Automatic Method for Summary Evaluation Using Multiple Evaluation Results by a Manual Method" pptx
... proposed an automatic method using multiple evaluation results from a manual method. First, n summaries for each document, m, were prepared. A summarization system generated summaries from m documents. ... from a document (or multiple documents) and if these are evaluated manually, then we can estimate a manual evaluation score for any summary to be evaluated with the evaluati...
Ngày tải lên: 17/03/2014, 04:20
Báo cáo khoa học: "An Automatic 3D Text-to-Scene Conversion System Applied to Road Accident Reports" doc
... explicit descriptions of objects and events for which we can form mental images. Animated 3D graphics have some advantages for the visualization of information. They can re- produce a real scene ... an automatic text-to-scene conversion system. It analyzes written descriptions of car accidents and synthe- sizes 3D scenes of them. The conver- sion process consists of two stages. An info...
Ngày tải lên: 17/03/2014, 22:20
Báo cáo khoa học: "An Automatic Inserter System for Hierarchical Lexica" pptx
Ngày tải lên: 18/03/2014, 02:20
Báo cáo khoa học: "An Automatic Generation System for Grammar Tests" pot
... 1–4, Sydney, July 2006. c 2006 Association for Computational Linguistics FAST – An Automatic Generation System for Grammar Tests Chia-Yin Chen Inst. of Info. Systems & Applications National ... data. Recently, Gao (2000) presented a system named AWETS that semi- automatically constructs vocabulary tests based on word frequency and part-of -speech information. Most r...
Ngày tải lên: 23/03/2014, 18:20
Báo cáo khoa học: "An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition" pdf
... Department Stanford University Stanford, CA 94305 vijayk@cs.stanford.edu Christopher D. Manning Computer Science Department Stanford University Stanford, CA 94305 manning@cs.stanford.edu Abstract This paper ... baseline CRF using local information alone, whose performance is close to the best published local CRF models, for Named Entity Recognition 3 Label Consistency The intuition for...
Ngày tải lên: 31/03/2014, 01:20
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
... 1 for the entire graph G. After this deletion, the splits for G with root fragments 2 and 3 are still eliminable; so we can e.g. delete the split for 3. At this point, only one split is left for ... by checking each split for eliminability before it is added to the chart. We compare the performance of this algorithm to the baseline of computing the complete chart. For comparison,...
Ngày tải lên: 20/02/2014, 12:20