Finite State Automata
Text Disambiguation by Finite State Automata, An Algorithm and Experiments on Corpora
... TEXT DISAMBIGUATION BY FINITE STATE AUTOMATA, AN ALGORITHM AND EXPERIMENTS ON CORPORA T E X T D I S A M B I G U A T I O N BY F I N I T E S T A T E A U T O M A T A , AN A L G O R I T H M AND E X P E R[.] ...
5
Family of lattice valued Aleshin type finite state automata
... fuzzy automata was introduced in the very early age of fuzzy set theory ...Since finite automata constitute a mathematical model of computation, fuzzy finite automata may be considered ...
6
Mining Multiple Web Sources Using Non-Deterministic Finite State Automata
... deterministic finite state automata based algorithm for extraction and mining structured web content ...generates finite state automata automatically for content mining and it ...
133
Incremental Construction and Maintenance of Minimal Finite State Automata
... acyclic finite-state automata (dictionaries) from sets of ...acyclic finite-state automata have limitations: For instance, if one wants a linguistic application to accept all ...
10
PAC-learnability of Probabilistic Deterministic Finite State Automata
... (non-deterministic) finite state au- tomata is ...Residual Finite State Automata (Esposito et ...of automata that have a certain distinguishability criterion between the states, ...
25
Language Independent Text Correction using Finite State Automata
... from finite state automata have been recently ...a finite state machine ...deterministic finite state au- ...a finite state acceptor is constructed for each ...
6
1 Way Multihead Quantum Finite State Automata
... quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state ...
18
E Dictionaries and Finite State Automata for the Recognition of Named Entities
... and finite-state ...expressions. Finite-state automata are used to describe the context of named enti- ties, thus improving the precision of recog- ...
9
On the Derivational Entropy of Left to Right Probabilistic Finite State Automata and Hidden Markov Models
... Probabilistic Finite-State Automata (PFA) and hidden Markov models (HMM) are well-known formalisms that have been widely used in automatic speech recognition (Ortmanns and Ney 1997), machine ...
21
Integration of Speech to Computer Assisted Translation Using Finite State Automata
... State-of-the-art computer-assisted transla- tion engines are based on a statistical pre- diction engine, which interactively pro- vides completions to what a human trans- lator types. The integration of human ...
8
A Practical Algorithm for Intersecting Weighted Context free Grammars with Finite State Automata
... pushdown automata is closed under intersec- tion with finite-state automata (henceforth FSA) ...both automata in parallel: When- ever the PDA makes a move on a certain input sym- bol a, ...
8
Learning Corpus Patterns Using Finite State Automata
... The CPA is a resource that creates links between word senses and word usage. A mutual sense depen- dency relationship acts between the slots of a pattern. We presented a methodology for pattern learning and recognition ...
12
Using Vectors of Features for Finite State Automata Dataset Reduction
... A finite state automata is the most important type of graphs ,which is called conceptual graphs, while the expansion of using the graphs in the process of data mining, the use of FSM is still limited ...
5
Multi threaded composition of finite state automata
... (weighted) finite-state automata have been successfully used in language processing (Mohri et ...on finite-state transducers (FSTs) which creates tran- sitions for matching output- and ...
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
Simpler and More General Minimization for Weighted Finite State Automata
... NLP automata use the real semiring ( R , +, ×), or its log equivalent, to compute unnormalized probabilities or other scores outside the range [0, 1] (Laf- ferty et ...
8
Language Independent Transliteration Mining System Using Finite State Automata Framework
... probabilistic finite state machines for machine transliteration of names in Arabic ...using finite state ...created finite state transducers to represent ...
5
Compiling Regular Formalisms with Rule Features into Finite State Automata
... R5 is the gemination rule; it is only triggered if the given rule features are satisfied: [cat=verb] for the first lexical element i.e., the pattern and [measure=pa"el] for the second el[r] ...
8
The intersection of Finite State Automata and Definite Clause Grammars
... Most existing constraint-based parsing algorithms will terminate for grammars that exhibit the property that for each string there is only a finite number of possible derivations.. Note [r] ...
7
Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution
... The SCSF test suite contains 6635 unit tests covering the concrete solver, the four automata models, the WFSA implementation, and the symbolic string algorithms created for the SCSF tool. The test suite does not ...
182