Sciweavers

71 search results - page 6 / 15
» A Programming Language for Finite State Transducers
Sort
View
CICLING
2003
Springer
14 years 21 days ago
Per-node Optimization of Finite-State Mechanisms for Natural Language Processing
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
Alexander Troussov, Brian O'Donovan, Seppo Koskenn...
COLING
2008
13 years 9 months ago
Phrasal Segmentation Models for Statistical Machine Translation
Phrasal segmentation models define a mapping from the words of a sentence to sequences of translatable phrases. We discuss the estimation of these models from large quantities of ...
Graeme W. Blackwood, Adrià de Gispert, Will...
ICALP
2000
Springer
13 years 11 months ago
The Many Faces of a Translation
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this ch...
Pierre McKenzie, Thomas Schwentick, Denis Th&eacut...
SFP
2003
13 years 8 months ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
COLING
1992
13 years 8 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson