126 search results - page 3 / 26 » Learning Finite-State Models for Machine Translation |
ACL
2010
13 years 6 months ago
2010
In recent years, research in natural language processing has increasingly focused on normalizing SMS messages. Different well-defined approaches have been proposed, but the proble...
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 5 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
NEUROSCIENCE
2001
Springer
14 years 29 days ago
2001
Springer
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
ICVGIP
2004
13 years 10 months ago
2004
In this paper we present a simple framework for activity recognition based on a model of multi-layered finite state machines, built on top of a low level image processing module f...
COLING
2008
13 years 10 months ago
2008
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 ...