Sciweavers

57 search results - page 6 / 12
» Adaptive star grammars and their languages
Sort
View
ICSE
2000
IEEE-ACM
13 years 11 months ago
Component design of retargetable program analysis tools that reuse intermediate representations
Interactive program analysis tools are often tailored to one particular representation of programs, making adaptation to a new language costly. One way to ease adaptability is to ...
James Hayes, William G. Griswold, Stuart Moskovics
ACL
1998
13 years 9 months ago
An Efficient Kernel for Multilingual Generation in Speech-to-Speech Dialogue Translation
We present core aspects of a fully implemented generation component in a multilingual speechto-speech dialogue translation system. Its design was particularly influenced by the ne...
Tilman Becker, Wolfgang Finkler, Anne Kilger, Pete...
LATA
2010
Springer
14 years 2 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
FPL
2001
Springer
101views Hardware» more  FPL 2001»
14 years 1 days ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
EMNLP
2010
13 years 5 months ago
Modeling Perspective Using Adaptor Grammars
Strong indications of perspective can often come from collocations of arbitrary length; for example, someone writing get the government out of my X is typically expressing a conse...
Eric Hardisty, Jordan L. Boyd-Graber, Philip Resni...