THE POWER OF EXTENDED TOP-DOWN TREE TRANSDUCERS∗ ANDREAS MALETTI† , JONATHAN GRAEHL‡ , MARK HOPKINS§ , AND KEVIN KNIGHT¶ Abstract. Extended top-down tree transducers (transducteurs g´ en´ eralis´ es descendant

Source URL: www.isi.edu

• Mathematical logic
• Automata theory
• Finite state transducer
• Admissible rule
• Symbol
• Structure
• String
• Model theory
• Normal distribution
• Mathematics
• Formal languages
• Logic

Capturing Practical Natural Language Transformations Kevin Knight Information Sciences Institute and Computer Science Department University of Southern California [removed]

Source URL: www.isi.edu

• Theoretical computer science
• Computer science
• Finite state transducer
• Computational linguistics
• Finite-state machine
• Applied mathematics
• Formal grammar
• Tree automaton
• Speech recognition
• Automata theory
• Models of computation
• Formal languages

Training Tree Transducers Jonathan Graehl∗ University of Southern California Kevin Knight∗∗ University of Southern California

Source URL: www.aclweb.org

• Mathematics
• Tree traversal
• Context-free grammar
• Regular tree grammar
• String
• Finite state transducer
• Formal languages
• Combinatorics
• Computing

Towards Probabilistic Acceptors and Transducers for Feature Structures Daniel Quernheim Institute for Natural Language Processing Universit¨at Stuttgart, Germany Pfaffenwaldring 5b, 70569 Stuttgart [removed]-stuttg

Source URL: www.aclweb.org

• Models of computation
• Directed acyclic graph
• Finite-state machine
• Finite state transducer
• Graph
• Directed graph
• Tree
• Trie
• Graph theory
• Theoretical computer science
• Automata theory

DAGGER: A Toolkit for Automata on Directed Acyclic Graphs Kevin Knight University of Southern California Information Sciences Institute Marina del Rey, California[removed]removed]

Source URL: www.isi.edu

• Applied mathematics
• Computer science
• Finite state transducer
• Finite-state machine
• Directed acyclic graph
• Mehryar Mohri
• DAG
• Tree automaton
• Algorithm
• Automata theory
• Models of computation
• Theoretical computer science

Training Finite-State Transducer Cascades with Carmel Kevin Knight, October 2009 Summary This document describes how to train arbitrary cascades of finite-state machines on end-to-end data. The Carmel toolkit implements

Source URL: www.isi.edu

In Proc. of the Eleventh International Conference on Implementation and Application of Automata (CIAA), Lecture Notes in Computer Science, c Springer Verlag, 2006. Tiburon: A Weighted Tree Automata Toolkit Jonathan May a

Source URL: www.isi.edu

• Models of computation
• Computer science
• Software engineering
• Finite state transducer
• FSA Utilities
• Finite-state machine
• Tree automaton
• Formal grammar
• Context-free grammar
• Formal languages
• Automata theory
• Theoretical computer science

Efficient Inference Through Cascades of Weighted Tree Transducers Jonathan May and Kevin Knight Information Sciences Institute University of Southern California Marina del Rey, CA 90292 {jonmay,knight}@isi.edu

Source URL: www.aclweb.org

• Statistics
• Automata theory
• Finite state transducer
• Symbol
• Expectation–maximization algorithm
• String
• Model theory
• Lp space
• Structure
• Mathematics
• Formal languages
• Mathematical analysis

TML Application Notes No. 6 – How Does TML Keep Track Of Data Streams? Transducer Markup Language (TML) standardizes data from any source and allows the integration of multiple data sources into a single data stream.

Source URL: www.ogcnetwork.net

• Identifier
• Information
• Unique identifier
• Data
• Computing
• Open Geospatial Consortium
• TransducerML
• Universal identifiers

06-010r2 Transducer Markup Language[removed]010r2 Transducer Ma

Source URL: www.ogcnetwork.net

• Computing
• GPS
• TransducerML
• Cartography
• Measurement
• Surveying
• SensorML
• IEEE
• Geography Markup Language
• Open Geospatial Consortium
• Markup languages
• Transducers