Thomas Wasow

dblp:95/7013 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none

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

Artificial intelligence and machine learning · 2

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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Compilers and program optimization · 50%
Artificial intelligence
1 paper
Information extraction and text analysis · 50% Knowledge representation and reasoning · 50%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%

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

TopicWeightPapersLastEvidence papers
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
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
logical form
0.011982
Processing English with a Generalized Phrase Structure Grammar · ACL 1982
Natural language and speech › Information extraction and text analysis
semantic parsing
0.011982
Processing English with a Generalized Phrase Structure Grammar · ACL 1982

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

montague semantics · 0.0generalized phrase structure grammar · 0.0lexical rules · 0.0inheritance mechanisms · 0.0
YearPublicationVenuePosition
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
ACL3
1982 Processing English with a Generalized Phrase Structure Grammar
abstract
This paper describes a natural language processing system implemented at Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic transducer that outputs a first-order logical representation; and a "disambiguator" that uses sortal information to convert "normal-form" first-order logical expressions into the query language for HIRE, a relational database hosted in the SPHERE system. We argue that theoretical developments in GPSG syntax and in Montague semantics have specific advantages to bring to this domain of computational linguistics. The syntax and semantics of the system are totally domain-independent, and thus, in principle, highly portable. We discuss the prospects for extending domain-independence to the lexical semantics as well, and thus to the logical semantic representations.
Jean Mark Gawron, Jonathan King, John Lamping, Egon E. Loebner, E. Anne Paulson, Geoffrey K. Pullum, Ivan A. Sag, Thomas Wasow
ACL8