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.
? Tutorial for this page

George E. Heidorn

dblp:29/6070 · DBLP profile ↗
← Back
4ranked-venue papers
2as 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 · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers
Information extraction and text analysis · 46% Knowledge representation and reasoning · 36% Language models and text generation · 18%

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 › ontology
ontology construction
0.011985
Extracting Semantic Hierarchies from a Large On-Line Dictionary · ACL 1985
Natural language and speech › Language models and text generation › reranking
parse reranking
0.011982
Experience with an Easily Computed Metric for Ranking Alternative Parses · ACL 1982
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.011982
Experience with an Easily Computed Metric for Ranking Alternative Parses · ACL 1982
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
semantic networks
0.011977
Generating Noun Phrases to Identify Nodes in a Semantic Network · IJCAI 1977

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

head-finding heuristics · 0.0parse tree metric · 0.0
YearPublicationVenuePosition
1985 Extracting Semantic Hierarchies from a Large On-Line Dictionary
abstract
Dictionaries are rich sources of detailed semantic information, but in order to use the information for natural language processing, it must be organized systematically. This paper describes automatic and semi-automatic procedures for extracting and organizing semantic feature information implicit in dictionary definitions. Two head-finding heuristics are described for locating the genus terms in noun and verb definitions. The assumption is that the genus term represents inherent features of the word it defines. The two heuristics have been used to process definitions of 40,000 nouns and 8,000 verbs, producing indexes in which each genus term is associated with the words it defined. The Sprout program interactively grows a taxonomic "tree" from any specified root feature by consulting the genus index. Its output is a tree in which all of the nodes have the root feature for at least one of their senses. The Filter program uses an inverted form of the genus index. Filtering begins with an initial filter file consisting of words that have a given feature (e.g. [+human]) in all of their senses. The program then locates, in the index, words whose genus terms all appear in the filter file. The output is a list of new words that have the given feature in all of their senses.
Martin Chodorow, Roy J. Byrd, George E. Heidorn
ACL3
1983 Parse Fitting and Prose Fixing: Getting a Hold on III-Formedness
Karen Jensen, George E. Heidorn, Lance A. Miller, Yael Ravin
Am. J. Comput. Linguistics2
1982 Experience with an Easily Computed Metric for Ranking Alternative Parses
abstract
This brief paper, which is itself an extended abstract for a forthcoming paper, describes a metric that can be easily computed during either bottom-up or top-down construction of a parse tree for ranking the desirability of alternative parses.In its simplest form, the metric tends to prefer trees in which constituents are pushed as far down as possible, but by appropriate modification of a constant in the formula other behavior can be obtained also.This paper includes an introduction to the EPISTLE system being developed at IBM Research and a discussion of the results of using this metric with that system.
George E. Heidorn
ACL1
1977 Generating Noun Phrases to Identify Nodes in a Semantic Network
George E. Heidorn
IJCAI1