Gerald Gazdar

dblp:43/801 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Artificial intelligence and machine learning · 8 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 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.

Theoretical computer science
3 papers
Automata and formal languages · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
lexical knowledge representation
0.011995
Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy · ACL 1995
Automata and formal languages
tree adjoining grammar
0.011995
Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy · ACL 1995
Automata and formal languages
grammar formalisms
0.011987
The New Grammar Formalisms - A Tutorial Survey (Abstract) · IJCAI 1987
Automata and formal languages › formal grammars
phrase structure grammars
0.011983
Phrase Structure Grammars and Natural Languages · IJCAI 1983

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

nonmonotonic inheritance · 0.0DATR · 0.0
YearPublicationVenuePosition
1996 DATR: A Language for Lexical Knowledge Representation
Roger Evans, Gerald Gazdar
Comput. Linguistics2
1995 Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy
abstract
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an I_TAG lexicon as an inheritance hierarchy with internal lexical rules.A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures.Such an approach eliminates the considerable redundancy otherwise associated with an LTAG lexicon.
Roger Evans, Gerald Gazdar, David J. Weir
ACL2
1992 Inheritance in Natural Language Processing
Walter Daelemans, Koenraad De Smedt, Gerald Gazdar
Comput. Linguistics3
1990 The Semantics of MOLUSC
Lynne J. Cahill, Gerald Gazdar
ECAI2
1989 Inference in DATR
Roger Evans, Gerald Gazdar
EACL2
1988 Category Structures
Gerald Gazdar, Geoffrey K. Pullum, Robert Carpenter, Ewan Klein, Thomas E. Hukari, Robert D. Levine
Comput. Linguistics1
1987 The New Grammar Formalisms - A Tutorial Survey (Abstract)
Gerald Gazdar
IJCAI1
1983 Phrase Structure Grammars and Natural Languages
Gerald Gazdar
IJCAI1