Results 21 to 30 of about 168,331 (215)

Programmable Microwaveable Chemistry in the Chemputer

open access: yesAngewandte Chemie, EarlyView.
The Chemputer integrates complementary microwave modules under χDL control, enabling fully automated syntheses of O‐alkylation products, Suzuki–Miyaura cross‐couplings, ring‐closing metathesis, and peptide sequences via solid‐phase methods. This modular, programmable platform delivers flexible and scalable microwave‐assisted workflows, broadening ...
Jacopo Zero   +5 more
wiley   +2 more sources

Towards Efficient, Typed LR Parsers

open access: yesElectronic Notes in Theoretical Computer Science, 2006
AbstractThe LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient ...
Pottier, François, Régis-Gianas, Yann
openaire   +2 more sources

A grammatical specification of human-computer dialogue [PDF]

open access: yes, 1995
The Seeheim Model of human-computer interaction partitions an interactive application into a user-interface, a dialogue controller and the application itself.
Nymeyer, Albert
core   +2 more sources

An alternative method of training probabilistic LR parsers [PDF]

open access: yesProceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04, 2004
We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in ...
M. J. NEDERHOF, SATTA, GIORGIO
openaire   +2 more sources

LR-parser-driven Viterbi search with hypotheses merging mechanism using context-dependent phone models

open access: yesProceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 1996
Describes a Viterbi search algorithm for continuous speech recognition using context-dependent phone models under the constraint defined by a context-free grammar (CFG).
Tomokazu Yamada, S. Sagayama
semanticscholar   +1 more source

Incremental Parser Generation for Tree Adjoining Grammars

open access: yes, 1998
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core   +1 more source

An Efficient Implementation of the Head-Corner Parser [PDF]

open access: yes, 1996
This paper describes an efficient and robust implementation of a bi-directional, head-driven parser for constraint-based grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport ...
van Noord, Gertjan
core   +10 more sources

Research on Architectures for Integrated Speech/Language Systems in Verbmobil [PDF]

open access: yes, 1996
The German joint research project Verbmobil (VM) aims at the development of a speech to speech translation system. This paper reports on research done in our group which belongs to Verbmobil's subproject on system architectures (TP15).
Görz, Günther   +3 more
core   +5 more sources

A generalized LR parser for text-to-speech synthesis

open access: yesProceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 1996
The development of a parser for a Norwegian text-to-speech system is reported. The generalized left-right (GLR) algorithm is applied, which is a generalization of the well-known LR algorithm for parsing computer languages.
Per Olav Heggtveit
semanticscholar   +1 more source

Optimization of LR(k) parsers

open access: yesJournal of Computer and System Sciences, 1972
Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by Korenjak [2] and DeRemer [3, 4]. We show that the techniques of the latter can be characterized by two transformations on sets of tables. We then show that the “simple” LR(1) method of DeRemer [4] can be considered a special case of Korenjak's method [2].
Aho, A.V., Ullman, J.D.
openaire   +1 more source

Home - About - Disclaimer - Privacy