Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Finite state transducer


Related Topics

In the News (Wed 24 Apr 19)

  
  LDC Catalog
Klex is a finite-state lexical transducer for the Korean language, with the lexical string on the upper side and the inflected surface string on the lower side.
A transducer network as a whole consists of all such possible morpheme sequence / word pairs in the language.
Given the lower lexicalized form, the transducer can produce the analyzed morpheme sequence (the process of "looking-up"); conversely, the transducer can be used in producing the fully inflected surface form of grammatical sequence of morphemes (opposite of "looking-up," hence Xerox's terminology of "looking-down").
www.ldc.upenn.edu /Catalog/CatalogEntry.jsp?catalogId=LDC2004L01   (444 words)

  
  Finite state transducer - Wikipedia, the free encyclopedia
The class of languages generated by finite automata is known as the class of regular languages.
On this view, a transducer is said to transduce (i.e., translate) the contents of its input tape to its output tape, by accepting a string on its input tape and generating another string on its output tape.
The class of relations computed by finite state transducers is known as the class of rational relations.
en.wikipedia.org /wiki/Finite_state_transducer   (723 words)

  
 Finite state machine - Wikipedia, the free encyclopedia
In addition to their use in modeling reactive systems presented here, finite state automata are significant in many different areas, including linguistics, computer science, philosophy, biology, mathematics, and logic.
Finite state machines are one type of the automata studied in automata theory and the theory of computation.
Transducers generate output based on a given input and/or a state using actions.
en.wikipedia.org /wiki/Finite_state_automaton   (1471 words)

  
 Method and apparatus for extracting short runs of ambiguity from finite state transducers - Patent 6760636
This transducer reduces any sequence of "a"s that is preceded by a "b" to an epsilon or copies it to the output unchanged depending on whether the sequence of as is followed by a "c".
13 or unambiguous FST, having arcs 200-209 and states 0-9;
An input prefix of a state q of an FST (Finite State Transducer) or transducer is the part of an input string on a particular path that ranges from the initial state to the state q.
www.freepatentsonline.com /6760636.html   (16767 words)

  
 AT&T Labs Research
An "f" finite-state transducer is generated from the rewritten portion.phi.
A "Replace" finite-state transducer is generated from the rewritten and replacement portions.phi.
The "r" and "f" finite-state transducer generators of the compiler and the transducer generating steps of the compiling method introduce the context marking symbols "<.sub.1 ", "<.sub.2 " and ">" in the various finite-state transducers only when and where they are needed.
public.research.att.com /viewPatent.cfm?Number=6032111   (222 words)

  
 [No title]   (Site not responding. Last check: 2007-10-21)
Part 2 — Implementing the Finite state transducer The lexical parser is made up of two components, (i) the transducer description and (ii) a program for processing an input and traversing through the states of the transducer.
FST description The description of the finite state transducer is a simplified version of the table format in Jurafsky and Martin (2000).
The path from a state has the format x:y:n, where x is the accepted input, y the output and n the new state.
www.ida.liu.se /~marho/words/Fst-report.doc   (526 words)

  
 Finite-State Networks
A transducer that is epsilonfree in the sense of Figure 12 may have 'one-sided' epsilon arcs, that is, arcs labeled with a symbol pair that contains an epsilon as the upper or the lower symbol.
The resulting transducer in Figure 14 is sequential when applied downwards, but only in that direction because there are two arcs with "a" as the lower side label in state 5.
It is not sequential in the downward direction either because states 0 and 1 both have two arcs on with "a" on the upper side of the arc label.
www.cis.upenn.edu /~cis639/docs/fsnetwork.html   (2255 words)

  
 SEM1A5 - Part 2 - Finite State Transducers
A transducer is a piece of software that maps one stream of symbols on to another stream of symbols.
A conventional view of a FST is of a machine that has two tapes which pass under a reading head.
FSTs have been widely used to implement morphological analysers, but we use a more mundane example of a spelling checker/corrector.
www.cs.bham.ac.uk /~pjh/sem1a5/pt2/pt2_fst.html   (1037 words)

  
 A compiler for morphological analysers and generators based on finite-state transducers 1
FST may be used used as one-pass morphological analysers and generators and may be very efficiently implemented.
The general definition of letter transducers is completely parallel to that of non-deterministic finite automata (NFA) and that of deterministic letter transducers, parallel to that of DFA; accordingly, letter transducers may be determinized and minimized (with respect to the alphabet L) using the existing algorithms for NFA and DFA [Hopcroft Ullman1979,Salomaa1973,van de Snepscheut1993].
The back-end minimizes the resulting transducer (as described in section 2) and combines the resulting code with a standard skeleton to produce a C program which is ready to be used on its own or included in a larger application such as a machine translation system.
www.internostrum.com /docum/morphgen   (1624 words)

  
 Method and apparatus for compiling context-dependent rewrite rules and input strings (US6032111)   (Site not responding. Last check: 2007-10-21)
An "f" finite-state transducer is generated from the rewritten portion phi of the weighted context-dependent rewrite rule.
A "Replace" finite-state transducer is generated from the rewritten and replacement portions phi and psi of the weighted context-dependent rewrite rule.
forming a left context absence verifying finite-state transducer based on the left context portion, the left context absence verifying finite-state transducer capable of rejecting the input string containing the replacement portion in place of the replaced portion when a second left marker symbol is not preceded by the left context portion in the input string.
www.delphion.com /details?pn10=US06032111   (607 words)

  
 Finite state morphology
To combine these 5 transducers into one, the simple procedure used here, was to include all states and transitions in a large transducer for all noun declensions by giving every FST the same start and end state.
The lexical parser is made up of two components, (i) the transducer description and (ii) a program for processing an input and traversing through the states of the transducer.
The description of the finite state transducer is a simplified version of the table format in Jurafsky and Martin (2000).
www.ida.liu.se /~marho/words/Fst-report.htm   (640 words)

  
 Tenjinno Machine Translation Competition
For the problems in the Tenjinno competition, the transducers to be inferred are either Finite State Transducers (FST's) or Syntax Directed Translation Schema (SDTS).
In the Tenjinno competition the transducers to be inferred are either Finite State Transducers (FST’s) or Syntax Directed Translation Schema (SDTS).
Finite State Transducers were chosen as one of the formalisms to be used in the Tenjinno competition mainly because there has been a history of research into the inference of FST’s published at previous ICGI’s.
www.ics.mq.edu.au /~tenjinno/formal_models.html   (1066 words)

  
 Cascaded Finite-State Transducers
A finite-state automaton reads one element at a time of a sequence of elements; each element transitions the automaton into a new state, based on the type of element it is, e.g., the part of speech of a word.
Some states are designated as final, and a final state is reached when the sequence of elements matches a valid pattern.
In a finite-state transducer, an output entity is constructed when final states are reached, e.g., a representation of the information in a phrase.
www.isi.edu /~hobbs/biomed/node2.html   (1345 words)

  
 Deterministic finite state transducer, transducer - MSO definable string transductions and two-way finite-state
Transducers are used to generate an output from a given input.
A finite state transducer is is a finite state automaton in which the members of A deterministic finite state transducer (DFST) is defined as a septuple
Notice that the FST given is deterministic when we use it to map from Swahili into In a network for a finite state transducer, a label on an arc will be
transducer.yoursuperengine.com /q/transducer-deterministic-finite-state-transducer.htm   (651 words)

  
 11 Finite State   (Site not responding. Last check: 2007-10-21)
Fortunately, the output function is simply a combinational function of the state (in the case of a classifier or acceptor) or of the state and input (in the case of a transducer).
Explore the state transition behavior for states not shown in the diagram, in particular from the state 1100.
Not only is the number of states too big to fit in the memory of a computer that would be usable as a tool for analyzing such finite-state machines, it is also impossible for a human to understand the workings of a machine based on explicit representation of its states.
www.cs.hmc.edu /claremont/keller/webBook/ch12   (10653 words)

  
 Finite State Technology
A finite-state machine (fsm) consists of a finite number of states and a function that determines transitions from one state to another as symbols are read from an input tape.
A transducer is a simple extension of a basic finite-state machine: as it reads its input tape and makes a transition from one state to another, it can also write a corresponding symbol on a second tape.
When it reaches a final state and the end of the input, the string produced on the second tape is taken to be the output that the input string is mapped to.
cslu.cse.ogi.edu /HLTsurvey/ch11node8.html   (1512 words)

  
 Finite State Machine
The state machine can also be viewed as a function which maps an ordered sequence of input events into a corresponding sequence of (sets of) output events.
The next state of a nondeterministic FSM (NFA) depends not only on the current input event, but also on an arbitrary number of subsequent input events.
The terms "acceptor" and "transducer" are used particularly in language theory where automata are often considered as abstract machines capable of recognising a language (certain sequences of input events).
burks.brighton.ac.uk /burks/foldoc/65/42.htm   (334 words)

  
 [No title]
A finite-state automaton that corresponds to the finite-state transducer of Figure 
Since Q is finite, it follows that Q has only a finite number of subsets A, and consequently M' has also only a finite number of states.
M uses its states to keep track of the nonterminal symbols in use in the sentential forms of G. M uses its transition rules to consume the input symbols that G generates in the direct derivations that use the corresponding production rules.
www.cse.ohio-state.edu /~gurari/theory-bk/theory-bk-twose3.html   (2537 words)

  
 [No title]
Determine an upper bound on the number of states of P, and an upper bound on the number of possible transitions between these states.
Assume that the domain of the variables is {0, 1}, and that 0 is the initial value in the domain.
Show that the complementation of a relation computable by a deterministic finite-state transducer, is computable by a finite-state transducer.
www.cse.ohio-state.edu /~gurari/theory-bk/theory-bk-twoli1.html   (1055 words)

  
 finite state machine
Definition: A model of computation consisting of a set of states, a start state, an input alphabet, and a transition function that maps input symbols and current states to a next state.
There are many variants, for instance, machines having actions (outputs) associated with transitions (Mealy machine) or states (Moore machine), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state (nondeterministic finite state machine), one or more states designated as accepting states (recognizer), etc.
Jan Daciuk's Finite state utilities (C++) including many links to other code, papers, etc. Finite State Automata Utilities (Prolog), which generate C code, minimize, visualize, etc. Page has binaries, too.
www.nist.gov /dads/HTML/finiteStateMachine.html   (308 words)

  
 Simple finite state transducers
Transducers of various kinds form a core component of the lexical knowledge representation toolkit.
The simplest kind of transducer, and the most widely used, is the finite state transducer (
It is very easily and conveniently encoded as a finite state transducer:
www.cogs.susx.ac.uk /research/nlp/polylex/polynode82.html   (284 words)

  
 License Agreement
This Agreement shall be governed by and construed in accordance with the laws of the State of California, USA, applicable to agreements made and to be performed wholly therein without regard to its conflicts of law rules.
Any cause of action or claim Licensee may have with respect to the Software must be brought within one (1) year after the claim or cause of action arises or such claim or cause of action is barred.
The arbitration shall be governed by the United States Arbitration Act, shall be conducted in the County of Los Angeles, California, USA, and judgment on the award may be entered by any court having jurisdiction.
www.isi.edu /licensed-sw/carmel   (1383 words)

  
 Finite-State Transducer Decomposition for Natural Language Parsing   (Site not responding. Last check: 2007-10-21)
Finite-state devices such as finite-sate automata, graphs and finite-sate transducers have been known since the emergence of computer science and are extensively used in areas as various as program compilation, hardware modeling or database management.
However, recent mathematical and algorithmic results in the field of finite-state technology have had a great impact on the representation of electronic dictionaries and natural language processing.
Finite-state transducer determinization is more complex than the classical problem of determinizing finite-state automata and I will focus on the relation between determinization and factorization of finite-state functions through the little used concept of bimachine.
www.clsp.jhu.edu /seminars/abstracts/F1996/roche.html   (182 words)

  
 Juicer: A Weighted Finite-State Transducer speech decoder   (Site not responding. Last check: 2007-10-21)
As task complexities and, consequently, system complexities have continued to increase the decoding problem has become an increasingly significant component in the overall speech recognition system development effort, with efficient decoder design contributing to significantly improve the trade-off between decoding time and search errors.
We begin with a discussion of the need for open source, state-of-the-art decoding software in LVCSR research and how this lead to the development of Juicer, followed by a brief overview of decoding techniques and major issues in decoder design.
These benchmarking tests serve to not only demonstrate the utility of Juicer in its present state, but are also being used to guide future development, hence, we conclude with a brief discussion of some of the extensions that are currently under way or being considered for Juicer.
www.idiap.ch /publications/moore-idiap-rr-06-21.bib.abs.html   (263 words)

  
 Finite State Morphology of Finnish Numerals   (Site not responding. Last check: 2007-10-21)
That is, the mapping from an underlying lexical representation of a word to its inflected surface representation can be described formally by a system of regular expressions that in turn can be compiled into a single lexical transducer, a finite-state transducer for morphological analysis and generation.
The transducer encodes all the correct mapping from lemmas (lexical reprentations) to surface forms, and vice versa.
This talk describes a computational implementation of the Finnish numeral system as a single finite-state transducer that maps inflected numerals to the corresponding numbers with tags that indicate ordinality, number, and syntactic case.
www-linguistics.stanford.edu /linguistics/sssg/20051101.html   (336 words)

  
 Finite-state automata and directed acyclic graphs   (Site not responding. Last check: 2007-10-21)
Alternating finite automata (AFA) are an extension of NFA (nondeterministic finite automata).
A cover automaton for a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L.
During the number to word conversion, at each state, numbers stored at targets of transitions are added to the total as long as it does not become greater than the word number.
www.eti.pg.gda.pl /katedry/kiw/pracownicy/Jan.Daciuk/personal/fsm_algorithms   (6305 words)

  
 finite state transducer
Definition: A finite state machine specifically with a read-only input and a write-only output.
The input and output cannot be reread or changed.
Paul E. Black, "finite state transducer", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology.
www.nist.gov /dads/HTML/finiteStateTransducer.html   (91 words)

  
 Fixed lexicon transducer   (Site not responding. Last check: 2007-10-21)
Next: Lexicon transducer for morphological Up: Finite-state morphology and information Previous: Finite state representation
The morphological analyzer using a fixed lexicon can, thus, be expressed in terms of a finite-state transducer, or a regular relation R.
This relation is not one-to-one because word-forms may be ambiguous.
www.ling.helsinki.fi /~kkoskenn/ecai96-finite-state/node7.html   (99 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.