MIT Press / XFST / Princeton University Press / Symbols / Xerox / 1N O1! / O1! / /
Country
Luxembourg / /
Facility
University of Helsinki / Computer Science University of Haifa / Computer Science University / Grenoble laboratory / Ohio State University / /
IndustryTerm
theoretical algorithms / Hebrew adjectives network / Finite state technology / network nouns network adjectives network complete network / modest networks / words nouns network / final network / software packages / finite state networks / phonological rule systems / equivalent operator / larger network / Hebrew nouns network / basic operators / natural language processing / nouns adjectives network / larger systems / translated operator / /
Organization
Department of General Linguistics / Israel Science Foundation / European Chapter / MIT / Computer Science University / Princeton University / University of Haifa / Shuly Wintner Department / Two Finite-State Toolboxes Yael Cohen-Sygal Department / FSA / Ohio State University / University of Helsinki / Association for Computational Linguistics / /
Person
Richard Sproat / Shlomo Yona / Mehryar Mohri / Fernando Pereira / Lauri Karttunen / Dale Gerdemann / Yael Cohen-Sygal / Computational Model / Anne Schiller / Gregory Grefenstette / Gertjan van Noord / Andre Kempe / Ronald M. Kaplan / Nathan Vaillette / Yves Schabes / Kenneth R. Beesley / Martin Kay / Michael Riley / Jean-Pierre Chanod / Shuly Wintner / /
Position
General / /
ProgrammingLanguage
Prolog / Java / C / C++ / /
PublishedMedium
Computational Linguistics / Lecture Notes in Computer Science / /
Technology
1 Introduction Finite-state technology / Speech recognition / published algorithms / theoretical algorithms / published algorithm / natural language processing / Java / finite state machine / Finite state technology / 3G / GUI / /
XFST2FSA: Comparing Two Finite-State Toolboxes Yael Cohen-Sygal Department of Computer Science University of Haifa