A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
In this paper, we propose stochastic finite-state models for these two subproblems. ... Stochastic finite-state models are efficiently learnable from data, effective for decoding and are associated with a calculus for composing models which allows for tight integration of constraints from ... Acknowledgements We would like to thank Richard Cox and Mazin Rahim for their continued support for the work reported in this paper. ...doi:10.1023/b:coat.0000010804.12581.96 fatcat:665cnydxrvc4hmknngcxiwdovm
ANLP-NAACL 2000 Workshop: Embedded Machine Translation Systems on - EmbedMT '00
In this paper, we propose stochastic finite-state models for these two subproblems. ... Stochastic finite-state models are efficiently learnable from data, effective for decoding and are associated with a calculus for composing models which allows for tight integration of constraints from ... Acknowledgements We would like to thank Richard Cox and Mazin Rahim for their continued support for the work reported in this paper. ...doi:10.3115/1610243.1610251 fatcat:3bu75gsbwnealdugu4iq5rwtla
NAACL-ANLP 2000 Workshop on Embedded machine translation systems -
In this paper, we propose stochastic finite-state models for these two subproblems. ... Stochastic finite-state models are efficiently learnable from data, effective for decoding and are associated with a calculus for composing models which allows for tight integration of constraints from ... Acknowledgements We would like to thank Richard Cox and Mazin Rahim for their continued support for the work reported in this paper. ...doi:10.3115/1117586.1117594 fatcat:dascykrihjgqdosvpinrsstw3y
Stochastic finite automata are well adapted for the constrained inte-gration of pairs of sentences for language processing. ... Stochastic finite automata have been applied to a variety of fields, machine trans-lation is one of them. It can learn from data and build model automatically from training sets. ... Method Based on Stochastic Finite Automata Model for Spoken… iJET -Vol. 14, No. 6, 2019 https://www.i-jet.orgPaper-A Novel Machine Translation Method Based on Stochastic Finite Automata Model ...doi:10.3991/ijet.v14i06.10161 fatcat:4osgsbior5fyhfbeod7anrvfuu
Stochastic finite-state models for spoken language machine translation. ... Finite-state models for lexical reordering in spoken language translation. In Proceedings of the International Conference on Speech and Language Processing, Beijing, China, October. ...
Off-line adaptation of stochastic language models that interpolate dialogue state specific and general application-level language models is proposed. ... Word and dialogue-state n-grams are used for building categorical understanding and dialogue models, respectively. Acoustic confidence scores are incorporated in the understanding formulation. ... Rose for his help with the utterance verification algorithms, and to the anonymous reviewers for many useful comments. ...doi:10.1109/tsa.2005.845836 fatcat:yh7l2tkap5ddfpswahv44jrite
; 9405845 stochastic language models, probabilistic structuring, German/English corpora data; 9405872 sublanguage, J. ... cryptic communication means, “Howdyuh-Dooah Syndrome”; 9406275 English-French machine vision terminology, Ma-Ze entries; 9404910 finite state automata adaptations, natural language processing tools; 9405884 ...
tagger, optimal time operation, deterministic finite-state machine; 9511612 infrequent French words’ frequency, acceptability degree relation, sta- tistical validation; 9511590 isolated-word speech recognition ... problems, social studies; 511 sentence alignment method/program, simple statistical model basis, bilingual corpora study, machine translation research/bilingual lexi- cography; 9511574 speaker verification ...
These methods include classical, well-known generative and discriminative methods like Finite State Transducers (FSTs), Statistical Machine Translation (SMT), Maximum Entropy Markov Models (MEMMs), or ... One of the first steps in building a spoken language understanding (SLU) module for dialogue systems is the extraction of flat concepts out of a given word sequence, usually provided by an automatic speech ... His research on learning finite state automata and transducers has lead to the creation of the first large-scale finite state chain decoding for machine translation (Anuvaad). ...doi:10.1109/tasl.2010.2093520 fatcat:ibtf5zvxxncvldslohguwmn7tm
ICIC Express Letters
In this paper, this spoken dialog problem is treated as a partially observable Markov decision process (POMDP). ... and the result will be compared with simple vocabulary in Indonesian language. ... Spoken Dialog Systems and POMDP Spoken dialog systems are machines which interact with people using spoken language. ...doi:10.24507/icicel.11.04.757 fatcat:44nc6mhcvrffjjsjd34hd4uicu
This grammar is finally converted into a finite-state transducer. The proposed methods are assessed through a series of machine translation experiments within the framework of the EuTrans project. ... One of these areas is machine translation, in which the approaches that are based on building models automatically from training examples are becoming more and more attractive. ... The authors wish to thank the anonymous reviewers for their criticisms and suggestions. ...doi:10.1162/089120104323093294 fatcat:iqli5nbt4zfzpak5qoltb7ucb4
for each language. ... The experimental results confirm the good behavior of this approach using French and English as input languages in a spoken language understanding task that was developed for Spanish. ... For our semantic decoding algorithm, we have represented these LMs as stochastic finite state automata. ...doi:10.1016/j.csl.2016.01.002 fatcat:x5ejm4avm5hrfndlbswehbju7m
Under the statistical statement of machine translation, we overview here how modeling, learning and search problems can be solved by using stochastic finite-state transducers. ... In formal language theory, finite-state transducers are well-know models for simple "input-output" mappings between two languages. ... Acknowledgments The authors wish to thank the anonymous reviewers for their criticisms and suggestions. ...doi:10.1007/s10994-006-9612-9 fatcat:2brzvkrv4jg7dhivheufceltya
Index Terms-Acoustic modeling, active learning, language modeling, large vocabulary continuous speech recognition, machine learning. ... The goal of Active Learning is to minimize the human supervision for training acoustic and language models and to maximize the performance given the transcribed and untranscribed data. ... Cox for their continued support on this research topic. They would also like to thank G. Tur and M. Saraclar for their technical help and useful discussions. ...doi:10.1109/tsa.2005.848882 fatcat:qa5d6rsrtjafvc6j4ub6uvje74
In this paper, we tried to perform a study of available research studies from 2001 to 2020 for sign language generation systems for various public domains using different machine translation approaches ... A hybrid approach based announcement system prototype is developed for deaf people. The proposed system prototype produced 82% accuracy on translation of announcements into sign language. ... In statistical translation, a Phrase-based Translator and a Stochastic Finite State Transducer (SFST) are used for translation following steps of word alignment computation, phase extraction and phase ...doi:10.37398/jsr.2021.650528 fatcat:l5vyyyjcbjcjfmxamqf2kahbwi
« Previous Showing results 1 — 15 out of 1,743 results