@inproceedings{chang-etal-1998-taxonomy,
title = "Taxonomy and lexical semantics{---}from the perspective of machine readable dictionary",
author = "Chang, Jason S. and
Ker, Sue J. and
Chen, Mathis H.",
editor = "Farwell, David and
Gerber, Laurie and
Hovy, Eduard",
booktitle = "Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers",
month = oct # " 28-31",
year = "1998",
address = "Langhorne, PA, USA",
publisher = "Springer",
url = "https://link.springer.com/chapter/10.1007/3-540-49478-2_19",
pages = "199--212",
abstract = "Machine-readable dictionaries have been regarded as a rich knowledge source from which various relations in lexical semantics can be effectively extracted. These semantic relations have been found useful for supporting a wide range of natural language processing tasks, from information retrieval to interpretation of noun sequences, and to resolution of prepositional phrase attachment. In this paper, we address issues related to problems in building a semantic hierarchy from machine-readable dictionaries: genus disambiguation, discovery of covert categories, and bilingual taxonomy. In addressing these issues, we will discuss the limiting factors in dictionary definitions and ways of eradicating these problems. We will also compare the taxonomy extracted in this way from a typical MRD and that of the WordNet. We argue that although the MRD-derived taxonomy is considerably flatter than the WordNet, it nevertheless provides a functional core for a variety of semantic relations and inferences which is vital in natural language processing.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="chang-etal-1998-taxonomy">
<titleInfo>
<title>Taxonomy and lexical semantics—from the perspective of machine readable dictionary</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jason</namePart>
<namePart type="given">S</namePart>
<namePart type="family">Chang</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Sue</namePart>
<namePart type="given">J</namePart>
<namePart type="family">Ker</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Mathis</namePart>
<namePart type="given">H</namePart>
<namePart type="family">Chen</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1998-oct 28-31</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers</title>
</titleInfo>
<name type="personal">
<namePart type="given">David</namePart>
<namePart type="family">Farwell</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Laurie</namePart>
<namePart type="family">Gerber</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Eduard</namePart>
<namePart type="family">Hovy</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Springer</publisher>
<place>
<placeTerm type="text">Langhorne, PA, USA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>Machine-readable dictionaries have been regarded as a rich knowledge source from which various relations in lexical semantics can be effectively extracted. These semantic relations have been found useful for supporting a wide range of natural language processing tasks, from information retrieval to interpretation of noun sequences, and to resolution of prepositional phrase attachment. In this paper, we address issues related to problems in building a semantic hierarchy from machine-readable dictionaries: genus disambiguation, discovery of covert categories, and bilingual taxonomy. In addressing these issues, we will discuss the limiting factors in dictionary definitions and ways of eradicating these problems. We will also compare the taxonomy extracted in this way from a typical MRD and that of the WordNet. We argue that although the MRD-derived taxonomy is considerably flatter than the WordNet, it nevertheless provides a functional core for a variety of semantic relations and inferences which is vital in natural language processing.</abstract>
<identifier type="citekey">chang-etal-1998-taxonomy</identifier>
<location>
<url>https://link.springer.com/chapter/10.1007/3-540-49478-2_19</url>
</location>
<part>
<date>1998-oct 28-31</date>
<extent unit="page">
<start>199</start>
<end>212</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Taxonomy and lexical semantics—from the perspective of machine readable dictionary
%A Chang, Jason S.
%A Ker, Sue J.
%A Chen, Mathis H.
%Y Farwell, David
%Y Gerber, Laurie
%Y Hovy, Eduard
%S Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers
%D 1998
%8 oct 28 31
%I Springer
%C Langhorne, PA, USA
%F chang-etal-1998-taxonomy
%X Machine-readable dictionaries have been regarded as a rich knowledge source from which various relations in lexical semantics can be effectively extracted. These semantic relations have been found useful for supporting a wide range of natural language processing tasks, from information retrieval to interpretation of noun sequences, and to resolution of prepositional phrase attachment. In this paper, we address issues related to problems in building a semantic hierarchy from machine-readable dictionaries: genus disambiguation, discovery of covert categories, and bilingual taxonomy. In addressing these issues, we will discuss the limiting factors in dictionary definitions and ways of eradicating these problems. We will also compare the taxonomy extracted in this way from a typical MRD and that of the WordNet. We argue that although the MRD-derived taxonomy is considerably flatter than the WordNet, it nevertheless provides a functional core for a variety of semantic relations and inferences which is vital in natural language processing.
%U https://link.springer.com/chapter/10.1007/3-540-49478-2_19
%P 199-212
Markdown (Informal)
[Taxonomy and lexical semantics—from the perspective of machine readable dictionary](https://link.springer.com/chapter/10.1007/3-540-49478-2_19) (Chang et al., AMTA 1998)
ACL