Fig 2 - uploaded by João Paulo Fernandes
Content may be subject to copyright.
Source publication
Abstract Parser combinators elegantly and concisely model generalised LL parsers in a purely functional language. They nicely illustrate the concepts of higher-order functions, polymorphic functions and lazy evaluation. Indeed, parser combinators are often presented as a motivating example for functional programming. Generalised LL, however, has an...
Contexts in source publication
Context 1
... are well-known techniques to construct such a LR parser. In Figure 2 we show the architecture of an LR parser (taken from [1]). ...
Context 2
... acceptance of the sentence is performed by function glr. As shown in Figure 2, this function is parameterised with the goto and action tables (i.e., their lookup functions), the parser stack (starting the parsing pro- cess with the initial state of LR(0) on the stack) and the input sentence. Here we see the distinctive behaviour of the GLR algorithm. ...
Context 3
... grammar interpreter follows the architecture shown in figure 2, and is based on the function glraccept of page 12. Thus, given a grammar and a sentence, it computes the parsing tables and only after computing these tables the acceptance of the sentence (i.e., the parsing process) is performed. ...
Similar publications
Nuclear Magnetic Resonance (NMR) spectroscopy is a technique for acquiring protein data at atomic resolution and determining the three-dimensional structure of large protein molecules. A typical structure determination process results in the deposition of a large data sets to the BMRB (Bio-Magnetic Resonance Data Bank). This data is stored and shar...
Citations
The construction of natural language interfaces to computers continues to be a major challenge. The need for such interfaces is growing now that speech recognition technology is becoming more readily available, and people cannot speak those computer-oriented formal languages that are frequently used to interact with computer applications. Much of the research related to the design and implementation of natural language interfaces has involved the use of high-level declarative programming languages. This is to be expected as the task is extremely difficult, involving syntactic and semantic analysis of potentially ambiguous input. The use of LISP and Prolog in this area is well documented. However, research involving the relatively new lazy functional programming paradigm is less well known. This paper provides a comprehensive survey of that research.
A Speech Web architecture, called Local Recognition Remote Processing (LRRP), for distributed speech processing is presented. Speech applications can be currently distributed through speech interfaces to HTML pages, networks of hyperlinked VXML pages, and call centers containing speech applications. LRRP architecture uses the grammar-based speech recognition software that are readily available, and the speech applications and their associated recognition grammars are stored on regular Web servers. Some of the advantages of LRRP are applicability on conventional Web servers, availability to non-experts, improvement in client-side speech-recognition accuracy, and communicability through text.
