Sciweavers

595 search results - page 61 / 119
» Languages Of Analogical Strings
Sort
View
FSMNLP
2009
Springer
14 years 7 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
MST
2011
208views Hardware» more  MST 2011»
14 years 4 months ago
Weighted Picture Automata and Weighted Logics
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
Ina Fichtner
ICFP
2008
ACM
15 years 9 months ago
Quotient lenses
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C...
IWINAC
2005
Springer
15 years 3 months ago
Network of Evolutionary Processors with Splicing Rules
In this paper we consider networks of evolutionary processors with splicing rules and permitting context (NEPPS) as language generating and computational devices. Such a network c...
Ashish Choudhary, Kamala Krithivasan
ACL
2007
14 years 11 months ago
Bootstrapping a Stochastic Transducer for Arabic-English Transliteration Extraction
We propose a bootstrapping approach to training a memoriless stochastic transducer for the task of extracting transliterations from an English-Arabic bitext. The transducer learns...
Tarek Sherif, Grzegorz Kondrak