finite state
-structures Applied to Finite State Machines
... fuzzy finite state machine, retrievable, separated and connected fuzzy finite state machines and discussed their basic ...fuzzy finite state machiness in terms of primary ...
5
Bayesian Inference for Finite State Transducers
... We describe a Bayesian inference algorithm that can be used to train any cascade of weighted finite-state transducers on end-to- end data. We also investigate the problem of automatically selecting from ...
9
Finite state Multimodal Parsing and Understanding
... single finite-state ...weighted finite-state automa- ton (FSA) running on three tapes which represent speech input (words), gesture input (gesture sym- bols and reference markers), and their ...
7
Finite State Reasoning for Presupposition Satisfaction
... However, there is additional evidence against a context-free or recursively enumerable semantics, namely that context-free languages are not closed under intersection and recursively enumerable lan- guages are not closed ...
10
Finite State Processing of Tone Systems
... sion treats phonological features as I / O tapes for Finite State Transducers in a parallel sequential incrementation PSI architecture; phonological.. phonological rules or metrical syst[r] ...
7
Decoding with Finite State Transducers on GPUs
... ever, such libraries do not allow redefinition of the addition and multiplication operations, making it difficult to implement the Viterbi algorithm or use log-probabilities. Also, parallelization of sparse matrix/vector ...
9
Finite State Automata for Topological Sorting
... The loop graph generated by any MSC always satisfies the properties of this proposition, so A is always finite. The exception being when there are gates present within a loop construct. In this case there are ...
8
Finite state Scriptural Translation
... a finite set of conversion relations when applied to each other’s output in a specific order, also defines a regular expression (Kaplan and Kay, ...as finite-state ...
10
A Constrained Finite-State Morphotactics for Korean
... constraint-based finite-state model named cfsm for Korean ...Xerox’s finite-state development tools, namely xfst for creating finite-state networks and lexc specifying natural ...
8
Finite State Morphology Tool for Latvian
... Stuttgart Finite-State Transducer Toolkit (SFST) as its extended regular expressions based transducer specification language allows to clearly describe the lexicon, to define variables, to apply ...
5
Accounting for Allomorphy in Finite state Transducers
... ing finite state toolkits can result in some- thing of a mis-match between the program- ming language of the toolkit and the lin- guistic concepts familiar to the average lin- ...nite State tools ...
8
On the structure of free finite state machines
... fon'!KrX to be isomorphic with UtrrrM for some finite state machine M, it is necessary and sufficient that for each nelation.. If this condition is satisfied then Ul,nmK,X =mK,X' For Ur,[r] ...
20
A finite-state morphological transducer for Kyrgyz
... free/open-source finite-state morphological transducer for ...The finite-state toolkit used for the work was the Helsinki Finite-State Toolkit ...
7
A Finite State Morphological Analyser for Sindhi
... Morphological analysis is a fundamental task in natural-language processing, which is used in other NLP applications such as part-of-speech tagging, syntactic parsing, information retrieval, machine translation, etc. In ...
6
A Finite state Morphological Analyser for Tuvan
... The transducer is designed based on the Helsinki Finite State Toolkit (Linden et al., 2011) which is popular in the field of morphological analysis. It implements both the lexc formalism for defining ...
6
Finite state morphological analysis for Gagauz
... a finite-state approach to morphological analysis and generation of Gagauz, a Turkic language spoken in the Republic of ...Moldova. Finite-state approaches are commonly used in morphological ...
5
A Finite State Morphological Processor for Spanish
... A FINITE STATE MORPHOLOGICAL PROCESSOR FOR SPANISH A i I N I I L"S [A,I E MORPHOLOGICAL PROCESSOR FOI SPANISH Evelyne Tzoukermann and Mark Y Liberman AT&T Bell Laboratories 600 Mountain Avenue Murray[.] ...
6
Parallel Replacement in Finite State Calculus
... Parallel Replacement in Finite State Calculus P a r a l l e l R e p l a c e m e n t in F i n i t e S t a t e C a l c u l u s A n d r 6 K e m p e a n d L a u r i K a r t t u n e n R a n k X e r o x R e[.] ...
6
Finite State Applications with Javascript
... When dealing with online and mobile applications, memory restrictions tend to be more severe than under other environments. This calls for compression of finite-state networks during transmission and ...
6
Finite State Machines
... a finite range of possible values, does not increase the computational power of finite state machines with bounded FIFO ...a finite range can be simulated trivially by a finite ...
8