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-interpretive approach. We find deep structures indispensable for projection into a semantic network. In conjunction with a reference architecture based on constraint-posting, they minimize referential non-determinisms. We extend Marcus' Determinism Hypothesis to include immediate reference, a foundational subclass of reference. This Referential Determinism Hypothesis, constitutes a semantic constraint on theories of syntactic analysis, arguing 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 constraint-posting, deep-structure parsers satisfy the referential determinism hypothesis.
Cite
Text
Duffy and Mallery. "Referential Determinism and Computational Efficiency: Posting Constraints from Deep Structure." AAAI Conference on Artificial Intelligence, 1984.Markdown
[Duffy and Mallery. "Referential Determinism and Computational Efficiency: Posting Constraints from Deep Structure." AAAI Conference on Artificial Intelligence, 1984.](https://mlanthology.org/aaai/1984/duffy1984aaai-referential/)BibTeX
@inproceedings{duffy1984aaai-referential,
title = {{Referential Determinism and Computational Efficiency: Posting Constraints from Deep Structure}},
author = {Duffy, Gavan and Mallery, John C.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1984},
pages = {101-105},
url = {https://mlanthology.org/aaai/1984/duffy1984aaai-referential/}
}