Sciweavers

1999 search results - page 54 / 400
» Dependently Typed Grammars
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 1 months ago
Executable Grammars in Newspeak
We describe the design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family. Parsers written using our library are remarkably simi...
Gilad Bracha
FSMNLP
2009
Springer
14 years 11 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
LATA
2010
Springer
15 years 8 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
ECAL
2005
Springer
15 years 7 months ago
Grammar Structure and the Dynamics of Language Evolution
The complexity, variation, and change of human languages makes evident the importance of representation and learning in the acquisition and evolution of language. For example, anal...
Yoosook Lee, Travis C. Collier, Gregory M. Kobele,...
CHI
2009
ACM
16 years 2 months ago
TypeRight: a keyboard with tactile error prevention
TYPERIGHT is a new tactile input device for text entry. It combines the advantages of tactile feedback with error prevention methods of word processors. TYPERIGHT extends the stan...
Alexander Hoffmann, Daniel Spelmezan, Jan O. Borch...