Sciweavers

5 search results - page 1 / 1
» On Weakly Ambiguous Finite Transducers
Sort
View
DLT
2006
13 years 6 months ago
On Weakly Ambiguous Finite Transducers
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
Nicolae Santean, Sheng Yu
FUIN
2006
84views more  FUIN 2006»
13 years 5 months ago
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Bimachines are important conceptual tools used for the characterization of rational word functions (realized by single-valued transducers). Despite the attention received in the pa...
Nicolae Santean, Sheng Yu
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
13 years 11 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
ACL
1990
13 years 6 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
FSMNLP
2005
Springer
13 years 10 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller