Sciweavers

314 search results - page 22 / 63
» Cubical token systems
Sort
View
ANLP
1994
104views more  ANLP 1994»
13 years 10 months ago
Language Determination: Natural Language Processing from Scanned Document Images
Many documents are available to a computer only as images from paper. However, most natural language processing systems expect their input as character-coded text, which may be di...
Penelope Sibun, A. Lawrence Spitz
APIN
2005
94views more  APIN 2005»
13 years 8 months ago
Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Stanislav Kurkovsky, Rasiah Loganantharaj
CORR
1998
Springer
99views Education» more  CORR 1998»
13 years 8 months ago
Models of Co-occurrence
A model of co-occurrence in bitext is a boolean predicate that indicates whether a given pair of word tokens co-occur in corresponding regions of the bitext space. Co-occurrence i...
I. Dan Melamed
COLING
2010
13 years 3 months ago
Unsupervised cleansing of noisy text
In this paper we look at the problem of cleansing noisy text using a statistical machine translation model. Noisy text is produced in informal communications such as Short Message...
Danish Contractor, Tanveer A. Faruquie, L. Venkata...
IJFCS
2008
102views more  IJFCS 2008»
13 years 8 months ago
On Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In ...
Linmin Yang, Zhe Dang, Oscar H. Ibarra