Back to Results
First PageMeta Content
Applied mathematics / Models of computation / Finite state transducer / Semiring / Shortest path problem / Algorithm / Floyd–Warshall algorithm / Powerset construction / Theoretical computer science / Automata theory / Mathematics


The Design Principles of a Weighted Finite-State Transducer Library Mehryar Mohri, Fernando Pereira and Michael Riley AT&T Labs — Research 180 Park Avenue, Florham Park, NJ[removed]
Add to Reading List

Document Date: 2006-02-09 10:43:25


Open Document

File Size: 234,87 KB

Share Result on Facebook

Company

Michael Riley AT&T Labs / Ford / /

Facility

Software Design Our library / /

IndustryTerm

speech recognition algorithms / cross product / all-pairs shortest distance algorithm / typical speech-processing task / removal algorithm / linear time topological-sort algorithm / Library algorithms / finite-state tools / speech-processing applications / speech processing applications / speech processing / natural-language processing applications / generic algorithm / shortest-paths algorithms / power-series determinization algorithm / classical algorithms / possible solutions / generic algorithms / acyclic algorithm / /

Person

Fernando Pereira / /

Product

T10 / /

ProvinceOrState

New Jersey / T2 / T1 / /

Technology

object-oriented programming / 3 Algorithms / FloydWarshall algorithm / speech recognition / same power-series determinization algorithm / desired algorithms / corresponding classical algorithms / acyclic algorithm / 3.1 Weighted Automata Algorithms Although algorithms / 9 4.1 Finite-state Objects Requiring algorithms / Floyd-Warshall algorithm / generic algorithm / removal algorithm / linear time topological-sort algorithm / same algorithm / Previous speech recognition algorithms / Library algorithms / Shortest-paths algorithms / same generic algorithm / 3.3 Lazy Algorithms / all-pairs shortest distance algorithm / /

SocialTag