Author name cluster

Gavan Duffy

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers

1 author row

AAAI Conference 1986 Conference Paper

Categorical Disambiguation

Gavan Duffy

This paper presents an implemented, computationally inexpensive technique for disambiguating categories (parts of speech) by exploiting constraints on possible category combinations. Early resolutions of category ambiguities provide a great deal of leverage, simplifying later resolutions of other types of lexical ambiguity. Prioritized pattern action rules (CONDS) are specified for each known categorial ambiguity. Approximately 40 such rules are currently in place. Each rule is passed lists of the words and categories preceding and succeeding a categorial ambiguity. Other categorial ambiguities are represented as lists embedded within these preceding and succeeding category lists. Unambiguous categories are represented as symbols in those lists. Additionally, each rule knows the current word and maintains a list of its possible category assignments, which had previously been extracted from a lexicon.

PDF Details

AAAI Conference 1984 Conference Paper

Referential Determinism and Computational Efficiency: Posting Constraints from Deep Structure

Gavan Duffy

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 subc!ass 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.

PDF Details