Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Carl Pollard

dblp:68/5826 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6Theory of computation · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Information extraction and text analysis · 78% Knowledge representation and reasoning · 20% Language models and text generation · 3%
Theoretical computer science
3 papers
Logic in computer science · 52% Automata and formal languages · 48%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Compilers and program optimization · 50%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.021995
Extraposition via Complex Domain Formation · ACL 1995
Parsing Head-Driven Phrase Structure Grammar · ACL 1985
Automata and formal languages
grammar formalisms
0.011995
Extraposition via Complex Domain Formation · ACL 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology reasoning
0.011991
Inclusion, Disjointness and Choice: The Logic of Linguistic Classification · ACL 1991
Logic in computer science › knowledge representation and reasoning
description logic
0.011991
Inclusion, Disjointness and Choice: The Logic of Linguistic Classification · ACL 1991
Natural language and speech › Information extraction and text analysis › discourse analysis › discourse processing
centering theory
0.011987
A Centering Approach to Pronouns · ACL 1987
Natural language and speech › Information extraction and text analysis
discourse analysis
0.011987
A Centering Approach to Pronouns · ACL 1987
Natural language and speech › Information extraction and text analysis › coreference resolution
pronoun resolution
0.011987
A Centering Approach to Pronouns · ACL 1987
Programming languages and type systems
grammar engineering
0.011985
Structure-Sharing in Lexical Representation · ACL 1985
Compilers and program optimization
structure sharing
0.011985
Structure-Sharing in Lexical Representation · ACL 1985
Logic in computer science › semantics
computational semantics
0.011985
A Computational Semantics for Natural Language · ACL 1985
Logic in computer science › formal semantics
natural language semantics
0.011985
A Computational Semantics for Natural Language · ACL 1985
Natural language and speech › Language models and text generation
grammar formalisms
0.011985
Parsing Head-Driven Phrase Structure Grammar · ACL 1985

Methods — techniques the papers use, named apart from their topics

domain formation · 0.0multiple inheritance network · 0.0closed-world reasoning · 0.0HPSG · 0.0unification-based parsing · 0.0lexical rules · 0.0inheritance mechanisms · 0.0HPSG formalism · 0.0
YearPublicationVenuePosition
2011 About Parallel and Syntactocentric Formalisms: A Perspective from the Encoding of Convergent Grammar into Abstract Categorial Grammar
abstract
Recent discussions of grammatical architectures have distinguished two competing approaches to the syntax-semantics interface: syntactocentrism, wherein syntactic structures are mapped or transduced to semantics (and phonology), vs. parallelism, wher
Philippe de Groote, Sylvain Pogodalla, Carl Pollard
Fundam. Informaticae3
2009 On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar
Philippe de Groote, Sylvain Pogodalla, Carl Pollard
WoLLIC3
2008 Hyperintensional Questions
Carl Pollard
WoLLIC1
2008 Hyperintensions
abstract
Standard possible worlds semantics has been known from the start to have a problem with granularity: for a wide range of natural-language (NL) entailment patterns, not enough meaning distinctions are available to make predictions consistent with robust intuitions. Though numerous solutions have been proposed, often of great ingenuity and technical sophistication, none of these has gained widespread acceptance. As a result, most semanticists have made a practical decision to work in a framework known to have dubious foundations and leave the foundational problems to mathematical logicians. Here, a new approach is proposed which may be simple enough and conservative enough to be practical for working empirical and computational semanticists. More specifically, I show how the use of a higher-order logic with definable subtypes leads to a novel and surprisingly straightforward solution of the granularity problem. I also call attention to a hitherto unnoticed problem in standard approaches to NL semantics having to do with non-principal ultrafilters and show why it does not arise under my proposal. The two main technical innovations that drive the proposal are (i) axiomatizing NL entailment as a preorder (as opposed to an order) on the set of (primitive) propositions, and (ii) defining worlds as certain sets of propositions (viz. ultrafilters). These innovations provide just the tools we need to develop a formally explicit theory of hyperintensions, 1 mathematical models of Fregean senses of a finer granularity than the familiar intensions (functions to extensions from worlds, where the worlds in turn are theoretical primitives) of mainstream Kripke/Montague-inspired NL semantics.
Carl Pollard
J. Log. Comput.1
1995 Extraposition via Complex Domain Formation
abstract
We propose a novel approach to extraposition in German within an alternative conception of syntax in which syntactic structure and linear order are mediated not via encodings of hierarchical relations but instead via order domains. At the heart of our proposal is a new kind of domain formation which affords analyses of extraposition constructions that are linguistically more adequate than those previously suggested in the literature.
Andreas Kathol, Carl Pollard
ACL2
1991 Inclusion, Disjointness and Choice: The Logic of Linguistic Classification
abstract
We investigate the logical structure of concepts generated by conjunction and disjunction over a monotonic multiple inheritance network where concept nodes represent linguistic categories and links indicate basic inclusion (ISA) and disjointness (ISNOTA) relations. We model the distinction between primitive and defined concepts as well as between closed-and open-world reasoning. We apply our logical analysis to the sort inheritance and unification system of HPSG and also to classification in systemic choice systems.
Bob Carpenter, Carl Pollard
ACL2
1987 A Centering Approach to Pronouns
abstract
In this paper we present a formalization of the centering approach to modeling attentional structure in discourse and use it as the basis for an algorithm to track discourse context and bind pronouns. As described in [GJW86], the process of centering attention on entities in the discourse gives rise to the intersentential transitional states of continuing, retaining and shifting. We propose an extension to these states which handles some additional cases of multiple ambiguous pronouns. The algorithm has been implemented in an HPSG natural language system which serves as the interface to a database query application.
Susan Brennan, Marilyn W. Friedman, Carl Pollard
ACL3
1985 A Computational Semantics for Natural Language
abstract
In the new Head-driven Phrase Structure Grammar (HPSG) language processing system that is currently under development at Hewlett-Packard Laboratories, the Montagovian semantics of the earlier GPSG system (see [Gawron et al. 1982]) is replaced by a radically different approach with a number of distinct advantages. In place of the lambda calculus and standard first-order logic, our medium of conceptual representation is a new logical formalism called NFLT (Neo-Fregean Language of Thought); compositional semantics is effected, not by schematic lambda expressions, but by LISP procedures that operate on NFLT expressions to produce new expressions. NFLT has a number of features that make it well-suited for natural language translations, including predicates of variable arity in which explicitly marked situational roles supercede order-coded argument positions, sortally restricted quantification, a compositional (but nonextensional) semantics that handles causal contexts, and a principled conceptual raising mechanism that we expect to lead to a computationally tractable account of propositional attitudes. The use of semantically compositional LISP procedures in place of lambda-schemas allows us to produce fully reduced translations on the fly, with no need for post-processing. This approach should simplify the task of using semantic information (such as sortal incompatibilities) to eliminate bad parse paths.
Lewis G. Creary, Carl Pollard
ACL2
1985 Structure-Sharing in Lexical Representation
abstract
The lexicon now plays a central role in our implementation of a Head-driven Phrase Structure Grammar (HPSG), given the massive relocation into the lexicon of linguistic information that was carried by the phrase structure rules in the old GPSG system. HPSG's grammar contains fewer than twenty (very general) rules; its predecessor required over 350 to achieve roughly the same coverage. This simplification of the grammar is made possible by an enrichment of the structure and content of lexical entries, using both inheritance mechanisms and lexical rules to represent the linguistic information in a general and efficient form. We will argue that our mechanisms for structure-sharing not only provide the ability to express important linguistic generalization about the lexicon, but also make possible an efficient, readily modifiable implementation that we find quite adequate for continuing development of a large natural language system.
Dan Flickinger, Carl Pollard, Thomas Wasow
ACL2
1985 Parsing Head-Driven Phrase Structure Grammar
abstract
The Head-driven Phrase Structure Grammar project (HPSG) is an English language database query system under development at Hewlett-Packard Laboratories. Unlike other product-oriented efforts in the natural language understanding field, the HPSG system was designed and implemented by linguists on the basis of recent theoretical developments. But, unlike other implementations of linguistic theories, this system is not a toy, as it deals with a variety of practical problems not covered in the theoretical literature. We believe that this makes the HPSG system unique in its combination of linguistic theory and practical application.The HPSG system differs from its predecessor GPSG, reported on at the 1982 ACL meeting (Gawron et al. ([1982]), in four significant respects: syntax, lexical representation, parsing, and semantics. The paper focuses on parsing issues, but also gives a synopsis of the underlying syntactic formalism.
Derek Proudian, Carl Pollard
ACL2