Search NASA⌕ Search

SEARCH · Search NASA

Results for “grammars”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

ANTLR Tree Grammar Generator and Extensions

A computer program implements two extensions of ANTLR (Another Tool for Language Recognition), which is a set of software tools for translating source codes between different computing languages. ANTLR supports predicated- LL(k) lexer and parser grammars, a notation for annotating parser grammars to direct tree construction, and predicated tree grammars. [ LL(k) signifies left-right, leftmost derivation with k tokens of look-ahead, referring to certain characteristics of a grammar.] One of the extensions is a syntax for tree transformations. The other extension is the generation of tree grammars from annotated parser or input tree grammars. These extensions can simplify the process of generating source-to-source language translators and they make possible an approach, called "polyphase parsing," to translation between computing languages. The typical approach to translator development is to identify high-level semantic constructs such as "expressions," "declarations," and "definitions" as fundamental building blocks in the grammar specification used for language recognition. The polyphase approach is to lump ambiguous syntactic constructs during parsing and then disambiguate the alternatives in subsequent tree transformation passes. Polyphase parsing is believed to be useful for generating efficient recognizers for C++ and other languages that, like C++, have significant ambiguities.

Craymer, Loring↗
NASA NTRS2005

Comparison of Grammar-Based and Statistical Language Models Trained on the Same Data

This paper presents a methodologically sound comparison of the performance of grammar-based (GLM) and statistical-based (SLM) recognizer architectures using data from the Clarissa procedure navigator domain. The Regulus open source packages make this possible with a method for constructing a grammar-based language model by training on a corpus. We construct grammar-based and statistical language models from the same corpus for comparison, and find that the grammar-based language models provide better performance in this domain. The best SLM version has a semantic error rate of 9.6%, while the best GLM version has an error rate of 6.0%. Part of this advantage is accounted for by the superior WER and Sentence Error Rate (SER) of the GLM (WER 7.42% versus 6.27%, and SER 12.41% versus 9.79%). The rest is most likely accounted for by the fact that the GLM architecture is able to use logical-form-based features, which permit tighter integration of recognition and semantic interpretation.

Hockey, Beth Ann↗
NASA NTRS1972

Terminal context in context-sensitive grammars.

Investigation of the conditions whereunder context-sensitive grammars generate context-free languages. The obtained results indicate that, if every noncontext-free rewriting rule of a context-sensitive grammar has as left context a string of terminal symbols and the left context is at least as long as the right context, then the language generated is context-free. Likewise, if every noncontext-free rewriting rule of a context-sensitive grammar has strings of terminal symbols as left and right contexts, then the language generated is also context-free.

Book, R. V.↗
NASA NTRS1973

On the structure of context-sensitive grammars

Consideration of the problem of explaining the use of context in generating noncontext-free languages. A number of existing results regarding the constraints placed on the form of the rules (i.e., on the context) of context-sensitive grammars are reviewed and interpreted. Three types of constraints are considered - namely, constraints which do not restrict the weak generative capacity of the class of grammars (i.e., all the context-sensitive languages are generated by grammars with these constraints), constraints which restrict the weak generative capacity to the extent that all context-sensitive languages are not generated but some noncontext-free languages are generated, and constraints which restrict the weak generative capacity to such an extent that only context-free languages are generated.

Book, R. V.↗
NASA NTRS2015

A Tool for Intersecting Context-Free Grammars and Its Applications

This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.

Context Free Grammar↗
NASA NTRS1988

A technique for solving constraint satisfaction problems using Prolog's definite clause grammars

A new technique for solving constraint satisfaction problems using Prolog's definite clause grammars is presented. It exploits the fact that the grammar rule notation can be viewed as a state exchange notation. The novel feature of the technique is that it can perform informed as well as blind search. It provides the Prolog programmer with a new technique for application to a wide range of design, scheduling, and planning problems.

Nachtsheim, Philip R.↗
NASA NTRS1990

Grammar, Punctuation, and Capitalization: a Handbook for Technical Writers and Editors

Writing problems are addressed which are often encountered in technical documents and preferences are indicated (Langley's) when authorities do not agree. It is directed toward professional writers, editors, and proofreaders. Those whose profession lies in other areas (for example, research or management), but who have occasion to write or review others' writing will also find this information useful. A functional attitude toward grammar and punctuation is presented. Chapter 1 on grammar presents grammatical problems related to each part of speech. Chapter 2 on sentence structure concerns syntax, that is, effective arrangement of words, with emphasis on methods of revision to improve writing effectiveness. Chapter 3 addresses punctuation marks, presenting their function, situations when they are required or incorrect, and situations when they are appropriate but optional. Chapter 4 presents capitalization, which is mostly a matter of editorial style and preference rather than a matter of generally accepted rules. An index and glossary are included.

Mary K. McCaskill↗
NASA NTRS1972

Arbitrary grammars generating context-free languages

If G is a grammar such that in each noncontext-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side; then the language generated by G is context-free. Six previous results follow as simple corollaries of this theorem.

Baker, B. S.↗
NASA NTRS1974

Non-context-free grammars generating context-free languages

If G is a grammar such that in each non-context-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side, then the language generated by G is context free. Six previous results follow as corollaries of this theorem.

Baker, B. S.↗
NASA NTRS2000

Corpus-Based Optimization of Language Models Derived from Unification Grammars

We describe a technique which makes it feasible to improve the performance of a language model derived from a manually constructed unification grammar, using low-quality untranscribed speech data and a minimum of human annotation. The method is on a medium-vocabulary spoken language command and control task.

Rayner, Manny↗