Sciweavers

89 search results - page 8 / 18
» On the Translation of Procedures to Finite Machines
Sort
View
EMNLP
2007
13 years 9 months ago
Syntactic Re-Alignment Models for Machine Translation
We present a method for improving word alignment for statistical syntax-based machine translation that employs a syntactically informed alignment model closer to the translation m...
Jonathan May, Kevin Knight
AAAI
2008
13 years 10 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
13 years 12 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
COLING
2010
13 years 2 months ago
Finite-state Scriptural Translation
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
M. G. Abbas Malik, Christian Boitet, Pushpak Bhatt...
ISOLA
2004
Springer
14 years 1 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah