Sciweavers

110 search results - page 6 / 22
» Finite-State Registered Automata and Their Uses in Natural L...
Sort
View
CICLING
2008
Springer
13 years 9 months ago
Arabic Morphology Parsing Revisited
In this paper we propose a new approach to the description of Arabic morphology using 2-tape finite state transducers, based on a particular and systematic use of the operation of ...
Suhel Jaber, Rodolfo Delmonte
ICML
2005
IEEE
14 years 8 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard
BC
2008
134views more  BC 2008»
13 years 7 months ago
Interacting with an artificial partner: modeling the role of emotional aspects
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
Isabella Cattinelli, Massimiliano Goldwurm, N. Alb...
ACL
2004
13 years 9 months ago
Discriminative Language Modeling with Conditional Random Fields and the Perceptron Algorithm
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins, Mark...
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...