Sciweavers

7661 search results - page 436 / 1533
» Languages and the Computing Profession
Sort
View
APIN
2000
103views more  APIN 2000»
15 years 6 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
FUIN
2002
99views more  FUIN 2002»
15 years 6 months ago
On Interacting Automata with Limited Nondeterminism
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...
Thomas Buchholz, Andreas Klein, Martin Kutrib
ACL
2010
15 years 4 months ago
Learning to Translate with Source and Target Syntax
Statistical translation models that try to capture the recursive structure of language have been widely adopted over the last few years. These models make use of varying amounts o...
David Chiang
COLING
2010
15 years 1 months ago
Syntax Based Reordering with Automatically Derived Rules for Improved Statistical Machine Translation
Syntax based reordering has been shown to be an effective way of handling word order differences between source and target languages in Statistical Machine Translation (SMT) syste...
Karthik Visweswariah, Jiri Navratil, Jeffrey S. So...
SOFSEM
2012
Springer
14 years 2 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki