In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within...
Compounded words are a challenge for NLP applications such as machine translation (MT). We introduce methods to learn splitting rules from monolingual and parallel corpora. We eva...
Perception based function (PBF) is given by the set of rules Ri:“If X is Ti then Y is Si”, where Ti is a linguistic term describing some fuzzy intervals Ai on the domain of re...
Abstract: Development of new text and graphical input devices is considered to be important part of humancomputer interaction by many researchers worldwide. Our paper presents our ...
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...