Name
Title | ||
|---|---|---|
Referential Determinism and Computational Efficiency: Posting Constraints from Deep Structure |
Abstract | ||
|---|---|---|
Most transformational linguists would no longer create explicit deep structures. Instead they adopt a surface-tnterpretlve approach. We find deep structures indIspensable for projection into a semantic network. In conjunction wrth a reference architecture based on constraint-posting, they mlnlmlze referential non-determinism% We extend Marcus' Determm~sm Hypothesis to include rmmed/ate reference, a foundational subc!ass of reference. This Referential Determinism Hypothesis, ccnstitutes a semantic constraint on theories of syntactic analysis, argumg for theories that minimize referential non-determinism. We show that our combination of deep structures and constraint-posting eliminates non-determinism in immediate reference. We conclude that constramt-posting, deep-structure parsers satisfy the referential determinism hypothesis. |
Year | Venue | Keywords |
|---|---|---|
1984 | AAAI | reference architecture,semantic network,syntactic analysis,satisfiability |
Field | DocType | Citations |
Argument,Computer science,Determinism,Theoretical computer science,Semantic network,Transformational leadership,Artificial intelligence,Parsing,Reference architecture | Conference | 1 |
PageRank | References | Authors |
0.41 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gavan Duffy | 1 | 2 | 1.60 |
| John C. Mallery | 2 | 18 | 2.85 |