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...
Richard Beaufort, Sophie Roekhaut, Louise-Am&eacut...
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...
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...
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...
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 ...