A Weighted Finite-State Transducer (WFST)-Based Language Model for Online Indic Script Handwriting Recognition

2011 ◽  
Author(s):  
Suhan Chowdhury ◽  
Utpal Garain ◽  
Tanushyam Chattopadhyay
Keyword(s):  
Handwriting Recognition ◽  
Language Model ◽  
Finite State ◽  
Finite State Transducer ◽  
Indic Script

Web Application for Romanian Language Phonetic Transcription

MACRo 2015 ◽  
2017 ◽  
Vol 2 (1) ◽  
pp. 1-10
Author(s):  
József Domokos ◽  
Zsolt Attila Szakács
Keyword(s):  
Web Service ◽  
Web Application ◽  
Language Model ◽  
Language Modeling ◽  
Phonetic Transcription ◽  
Finite State ◽  
Finite State Transducer ◽  
Model Training ◽  
N Gram ◽  
Pronunciation Dictionary

AbstractThis paper presents a Romanian language phonetic transcription web service and application built using Java technologies, on the top of the Phonetisaurus G2P, a Word Finite State Transducer (WFST)-driven Grapheme-to-Phoneme Conversion toolkit.We used NaviRO Romanian language pronunciation dictionary for WFST model training, and MIT Language Modeling (MITLM) toolkit to estimate the needed joint sequence n-gram language model.Dictionary evaluation tests are also included in the paper.The service can be accessed for educational, research and other non-commercial usage at http://users.utcluj.ro/~jdomokos/naviro/.

BORDERS AND FINITE AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 859-871
Author(s):  
MARTIN ŠIMŮNEK ◽  
BOŘIVOJ MELICHAR
Keyword(s):  
Pattern Matching ◽  
Hamming Distance ◽  
Finite Automata ◽  
Music Analysis ◽  
Theoretical Description ◽  
Specific Form ◽  
Distance Measures ◽  
Computer Assisted ◽  
Finite State ◽  
Finite State Transducer

A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is an implementation of a finite state transducer of specific form. We describe how such a transducer can be constructed and what should be the input string like. The described transducer finds a set of lengths of all borders. Last but not least, we define approximate borders and show how to find all approximate borders of a string when we concern Hamming distance definition. Our solution of this problem is based on transducers again. This allows us to use analogy with automata-based pattern matching methods. Finally we discuss conditions under which the same principle can be used for other distance measures.

scholarly journals Language Model Supervision for Handwriting Recognition Model Adaptation

2018 ◽  
Author(s):  
Christopher Tensmeyer ◽  
Curtis Wigington ◽  
Brian Davis ◽  
Seth Stewart ◽  
Tony Martinez ◽  
...  
Keyword(s):  
Handwriting Recognition ◽  
Language Model ◽  
Model Adaptation ◽  
Recognition Model

scholarly journals Bootstrapping a Neural Morphological Generator from Morphological Analyzer Output for Inuktitut

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
Jeffrey Micher
Keyword(s):  
Neural Network ◽  
Training Data ◽  
Data Set ◽  
Set Size ◽  
The Neural Network ◽  
Surface Character ◽  
Finite State ◽  
Character Sequences ◽  
Finite State Transducer

We present a method for building a morphological generator from the output of an existing analyzer for Inuktitut, in the absence of a two-way finite state transducer which would normally provide this functionality. We make use of a sequence to sequence neural network which “translates” underlying Inuktitut morpheme sequences into surface character sequences. The neural network uses only the previous and the following morphemes as context. We report a morpheme accuracy of approximately 86%. We are able to increase this accuracy slightly by passing deep morphemes directly to output for unknown morphemes. We do not see significant improvement when increasing training data set size, and postulate possible causes for this.

OpenFst: A General and Efficient Weighted Finite-State Transducer Library

2007 ◽  
pp. 11-23 ◽  
Author(s):  
Cyril Allauzen ◽  
Michael Riley ◽  
Johan Schalkwyk ◽  
Wojciech Skut ◽  
Mehryar Mohri
Keyword(s):  
Finite State ◽  
Finite State Transducer

A stochastic finite-state transducer approach to spoken dialog management

2010 ◽  
Author(s):  
Lluís-F. Hurtado ◽  
Joaquin Planells ◽  
Encarna Segarra ◽  
Emilio Sanchis ◽  
David Griol
Keyword(s):  
Dialog Management ◽  
Finite State ◽  
Finite State Transducer
Sign in / Sign up

Export Citation Format

Share Document