DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5 6 7...9
Hits 41 – 60 of 168

41
GE-CMU: Description of the Shogun System Used for MUC-5
In: DTIC (1993)
BASE
Show details
42
Applications of Sheaf Theory in Algorithm Design
In: DTIC AND NTIS (1993)
BASE
Show details
43
Deterministic Parsing of Languages with Dynamic Operators
In: http://www.irstamek.com/iWeb/Papers/parse.pdf (1991)
BASE
Show details
44
Grammar Rewriting
In: DTIC AND NTIS (1991)
Abstract: The author presents a term rewriting procedure based on congruence closure that can be used with arbitrary equational theories. This procedure is motivated by the pragmatic need to prove equations in equational theories where confluence cannot be achieved. The procedure uses context-free grammars to represent equivalence classes of terms. The procedure rewrites grammars rather than terms and uses congruence closure to maintain certain congruence properties of the grammar. Grammars provide concise representations of large term sets. Infinite term sets can be represented with finite grammars and exponentially large term sets can be represented with linear sized grammars. Although the procedure is primarily intended for use in nonconfluent theories, it also provides a new kind of confluence that can be used to give canonical rewriting systems for theories that are difficult to handle in other ways. For example, under grammar rewriting there is a finite canonical rewrite system for idempotent semigroups, a theory which has been shown not to have any finite canonical system under traditional notions of rewriting.
Keyword: *ALGORITHMS; *CONGRUENCE CLOSURE; *CONTEXT FREE GRAMMARS; *EQUATIONS; *GRAMMAR REWRITING; *REASONING; *THEORY; ARTIFICIAL INTELLIGENCE; AUTOMATED REASONING; AUTOMATION; CONGRUENCE GRAMMARS; Cybernetics; EQUATIONAL REASONING; EQUIVALENCE CLASSES; GROUND EQUATIONS; KNUTH BENDIX COMPLETION; Linguistics; NATURAL LANGUAGE; NONCONFLUENT THEORIES; TERM REWRITING; THEOREM PROVING; THEOREMS; Theoretical Mathematics
URL: http://www.dtic.mil/docs/citations/ADA259675
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA259675
BASE
Hide details
45
On Deftly Introducing Procedural Elements into Unification Parsing
In: DTIC (1990)
BASE
Show details
46
TINA: A Probabilistic Syntactic Parser for Speech Understanding Systems
In: DTIC (1989)
BASE
Show details
47
The Inside-Outside Algorithm: Further Experiments on Three and Four Letter Word Spelling and Implementation on an Array Processor.
In: DTIC AND NTIS (1989)
BASE
Show details
48
A Pumping Lemma Scheme for the Control Language Hierarchy
In: Technical Reports (CIS) (1989)
BASE
Show details
49
Analysis of a Table-Driven Algorithm for Fast Context-Free Parsing
In: DTIC AND NTIS (1988)
BASE
Show details
50
A Table-Driven Approach to Fast Context-Free Parsing
In: DTIC AND NTIS (1988)
BASE
Show details
51
The Inside/Outside Algorithm: Grammatical Inference Applied to Stochastic Context-Free Grammars
In: DTIC AND NTIS (1988)
BASE
Show details
52
Formal Grammars and Markov Models
In: DTIC AND NTIS (1987)
BASE
Show details
53
A W-Grammar Description for ADA.
In: DTIC AND NTIS (1986)
BASE
Show details
54
Model-Based Analysis of Messages about Equipment.
In: DTIC AND NTIS (1986)
BASE
Show details
55
Defining Natural Language in GPSG (Generalized Phrase Structure Grammar's)
In: DTIC AND NTIS (1986)
BASE
Show details
56
A Version Space Approach to Learning Context-Free Grammars
In: DTIC AND NTIS (1986)
BASE
Show details
57
On the Complexity of ID/LP Parsing
In: DTIC AND NTIS (1984)
BASE
Show details
58
Information-Theoretic Properties of Languages and Their Grammars.
In: DTIC AND NTIS (1984)
BASE
Show details
59
Parsing as Deduction
In: DTIC (1983)
BASE
Show details
60
A New Characterization of Attachment Preferences
In: DTIC (1983)
BASE
Show details

Page: 1 2 3 4 5 6 7...9

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
168
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern