Back to Results
First PageMeta Content
Models of computation / Computer science / Applied mathematics / Finite state transducer / Regular language / Nondeterministic finite automaton / Finite-state machine / N-gram / Probabilistic automaton / Automata theory / Formal languages / Theoretical computer science


Weighted Rational Transductions and their Application to Human Language Processing
Add to Reading List

Document Date: 2006-03-24 09:49:11


Open Document

File Size: 669,75 KB

Share Result on Facebook

City

Berlin / Stuttgart / Austin / San Diego / Paris / /

Company

United Informaties Inc. / Behavior Design Corporation / Xerox / Richard Sproat A T & T Bell Laboratories / /

Country

Germany / Japan / Canada / /

Facility

University of Helsinki / University of Paris / /

IndustryTerm

finite-state morphological processor / natural solution / humanlanguage processing / e-transition / conventional integrated-search / finite-state device / context-dependent networks / human language processing / phonological rule systems / ill-formed input processing / uniform algorithms / phonetic networks / e-to / context-independent phonetic networks / generic best-path search algorithm / e-transitions / language processing / uniform algorithm / text processing / /

Organization

University of Paris / University of Helsinki / Helsinki / K. W. Church / /

Person

Computational Modelfor Word / Fernando Pereira Michael Riley / Jyun-Sheng Chang / /

/

Position

General / /

Product

Text Segmentation Our / /

ProgrammingLanguage

L / J / C / K / T / /

ProvinceOrState

Texas / California / /

PublishedMedium

Computational Linguistics / Theoretical Computer Science / Theory of Computing / /

Technology

finite-state morphological processor / speech recognition / search algorithm / T - 1 / uniform algorithm / /

SocialTag