Outline of a model for lexical databases
Identifieur interne : 000485 ( Istex/Corpus ); précédent : 000484; suivant : 000486Outline of a model for lexical databases
Auteurs : Nancy Ide ; Jacques Le Maitre ; Jean VéronisSource :
- Information Processing and Management [ 0306-4573 ] ; 1992.
Abstract
In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.
Url:
DOI: 10.1016/0306-4573(93)90001-T
Links to Exploration step
ISTEX:DAA4D062569526E5FD243482E8CEEDF50482EECFLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Outline of a model for lexical databases</title><author><name sortKey="Ide, Nancy" sort="Ide, Nancy" uniqKey="Ide N" first="Nancy" last="Ide">Nancy Ide</name><affiliation><mods:affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</mods:affiliation></affiliation></author><author><name sortKey="Maitre, Jacques Le" sort="Maitre, Jacques Le" uniqKey="Maitre J" first="Jacques Le" last="Maitre">Jacques Le Maitre</name><affiliation><mods:affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</mods:affiliation></affiliation></author><author><name sortKey="Veronis, Jean" sort="Veronis, Jean" uniqKey="Veronis J" first="Jean" last="Véronis">Jean Véronis</name><affiliation><mods:affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</mods:affiliation></affiliation><affiliation><mods:affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DAA4D062569526E5FD243482E8CEEDF50482EECF</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1016/0306-4573(93)90001-T</idno><idno type="url">https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000485</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Outline of a model for lexical databases</title><author><name sortKey="Ide, Nancy" sort="Ide, Nancy" uniqKey="Ide N" first="Nancy" last="Ide">Nancy Ide</name><affiliation><mods:affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</mods:affiliation></affiliation></author><author><name sortKey="Maitre, Jacques Le" sort="Maitre, Jacques Le" uniqKey="Maitre J" first="Jacques Le" last="Maitre">Jacques Le Maitre</name><affiliation><mods:affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</mods:affiliation></affiliation></author><author><name sortKey="Veronis, Jean" sort="Veronis, Jean" uniqKey="Veronis J" first="Jean" last="Véronis">Jean Véronis</name><affiliation><mods:affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</mods:affiliation></affiliation><affiliation><mods:affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Information Processing and Management</title><title level="j" type="abbrev">IPM</title><idno type="ISSN">0306-4573</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1992">1992</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="159">159</biblScope><biblScope unit="page" to="186">186</biblScope></imprint><idno type="ISSN">0306-4573</idno></series><idno type="istex">DAA4D062569526E5FD243482E8CEEDF50482EECF</idno><idno type="DOI">10.1016/0306-4573(93)90001-T</idno><idno type="PII">0306-4573(93)90001-T</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0306-4573</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>Nancy Ide</name><affiliations><json:string>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</json:string></affiliations></json:item><json:item><name>Jacques Le Maitre</name><affiliations><json:string>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</json:string></affiliations></json:item><json:item><name>Jean Véronis</name><affiliations><json:string>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</json:string><json:string>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><abstract>In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.</abstract><qualityIndicators><score>6.116</score><pdfVersion>1.2</pdfVersion><pdfPageSize>504 x 756 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>635</abstractCharCount><pdfWordCount>9824</pdfWordCount><pdfCharCount>63625</pdfCharCount><pdfPageCount>28</pdfPageCount><abstractWordCount>93</abstractWordCount></qualityIndicators><title>Outline of a model for lexical databases</title><pii><json:string>0306-4573(93)90001-T</json:string></pii><genre><json:string>research-article</json:string></genre><serie><editor><json:item><name>C. Delobel</name></json:item><json:item><name>M. Kifer</name></json:item><json:item><name>Y. Masunaga</name></json:item></editor><language><json:string>unknown</json:string></language><title>Deductive and object-oriented databases</title></serie><host><volume>29</volume><pii><json:string>S0306-4573(00)X0049-0</json:string></pii><pages><last>186</last><first>159</first></pages><issn><json:string>0306-4573</json:string></issn><issue>2</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><title>Information Processing and Management</title><publicationDate>1993</publicationDate></host><categories><wos><json:string>COMPUTER SCIENCE, INFORMATION SYSTEMS</json:string><json:string>INFORMATION SCIENCE & LIBRARY SCIENCE</json:string></wos></categories><publicationDate>1993</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1016/0306-4573(93)90001-T</json:string></doi><id>DAA4D062569526E5FD243482E8CEEDF50482EECF</id><score>0.105228245</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">Outline of a model for lexical databases</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1993</date></publicationStmt><notesStmt><note>∗ The work described in this paper has been carried out in the context of a joint project of the Department of Computer Science at Vassar College and the Groupe Représentation et Traitement des Connaissances of the Centre National de la Recherche Scientifique (CNRS), which is concerned with the construction and exploitation of a large lexical database of English and French. An earlier version of this paper was presented at the conference “Intelligent Text and Image Handling” (RIAO 91) in Barcelona, Spain, April 1991.</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">Outline of a model for lexical databases</title><author><persName><forename type="first">Nancy</forename><surname>Ide</surname></persName><affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</affiliation></author><author><persName><forename type="first">Jacques Le</forename><surname>Maitre</surname></persName><affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</affiliation></author><author><persName><forename type="first">Jean</forename><surname>Véronis</surname></persName><affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</affiliation><affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</affiliation></author></analytic><monogr><title level="j">Information Processing and Management</title><title level="j" type="abbrev">IPM</title><idno type="pISSN">0306-4573</idno><idno type="PII">S0306-4573(00)X0049-0</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1992"></date><biblScope unit="volume">29</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="159">159</biblScope><biblScope unit="page" to="186">186</biblScope></imprint></monogr><idno type="istex">DAA4D062569526E5FD243482E8CEEDF50482EECF</idno><idno type="DOI">10.1016/0306-4573(93)90001-T</idno><idno type="PII">0306-4573(93)90001-T</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1993</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.</p></abstract></profileDesc><revisionDesc><change when="1992-04-07">Registration</change><change when="1992">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>IPM</jid><aid>9390001T</aid><ce:pii>0306-4573(93)90001-T</ce:pii><ce:doi>10.1016/0306-4573(93)90001-T</ce:doi><ce:copyright type="unknown" year="1993"></ce:copyright></item-info><head><ce:article-footnote><ce:label>☆</ce:label><ce:note-para>∗ The work described in this paper has been carried out in the context of a joint project of the Department of Computer Science at Vassar College and the Groupe Représentation et Traitement des Connaissances of the Centre National de la Recherche Scientifique (CNRS), which is concerned with the construction and exploitation of a large lexical database of English and French. An earlier version of this paper was presented at the conference “Intelligent Text and Image Handling” (RIAO 91) in Barcelona, Spain, April 1991.</ce:note-para></ce:article-footnote><ce:title>Outline of a model for lexical databases</ce:title><ce:author-group><ce:author><ce:given-name>Nancy</ce:given-name><ce:surname>Ide</ce:surname><ce:cross-ref refid="AFF1"><ce:sup>1</ce:sup></ce:cross-ref></ce:author><ce:author><ce:given-name>Jacques Le</ce:given-name><ce:surname>Maitre</ce:surname><ce:cross-ref refid="AFF2"><ce:sup>2</ce:sup></ce:cross-ref></ce:author><ce:author><ce:given-name>Jean</ce:given-name><ce:surname>Véronis</ce:surname><ce:cross-ref refid="AFF1"><ce:sup>1</ce:sup></ce:cross-ref><ce:cross-ref refid="AFF2"><ce:sup>2</ce:sup></ce:cross-ref></ce:author><ce:affiliation id="AFF1"><ce:label>a</ce:label><ce:textfn>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</ce:textfn></ce:affiliation><ce:affiliation id="AFF2"><ce:label>b</ce:label><ce:textfn>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</ce:textfn></ce:affiliation></ce:author-group><ce:date-received day="31" month="10" year="1991"></ce:date-received><ce:date-accepted day="7" month="4" year="1992"></ce:date-accepted><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.</ce:simple-para></ce:abstract-sec></ce:abstract></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>Outline of a model for lexical databases</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Outline of a model for lexical databases</title></titleInfo><name type="personal"><namePart type="given">Nancy</namePart><namePart type="family">Ide</namePart><affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jacques Le</namePart><namePart type="family">Maitre</namePart><affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jean</namePart><namePart type="family">Véronis</namePart><affiliation>Department of Computer Science, Vassar College, Poughkeepsie, New York 12601, U.S.A.</affiliation><affiliation>Groupe Représentation et Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402 Marseille Cedex 09, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1993</dateIssued><copyrightDate encoding="w3cdtf">1993</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">In this paper we show that previously applied data models are inadequate for lexical databases. In particular, we show that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. We propose an alternative feature-based model which allows for a full representation of sense nesting and defines a factoring mechanism that enables the elimination of redundant information. We then demonstrate that feature structures map readily to an object-oriented data model and show how our model can be implemented in an object-oriented DBMS.</abstract><note>∗ The work described in this paper has been carried out in the context of a joint project of the Department of Computer Science at Vassar College and the Groupe Représentation et Traitement des Connaissances of the Centre National de la Recherche Scientifique (CNRS), which is concerned with the construction and exploitation of a large lexical database of English and French. An earlier version of this paper was presented at the conference “Intelligent Text and Image Handling” (RIAO 91) in Barcelona, Spain, April 1991.</note><relatedItem type="host"><titleInfo><title>Information Processing and Management</title></titleInfo><titleInfo type="abbreviated"><title>IPM</title></titleInfo><genre type="journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">199303</dateIssued></originInfo><identifier type="ISSN">0306-4573</identifier><identifier type="PII">S0306-4573(00)X0049-0</identifier><part><date>199303</date><detail type="volume"><number>29</number><caption>vol.</caption></detail><detail type="issue"><number>2</number><caption>no.</caption></detail><extent unit="issue pages"><start>159</start><end>282</end></extent><extent unit="pages"><start>159</start><end>186</end></extent></part></relatedItem><identifier type="istex">DAA4D062569526E5FD243482E8CEEDF50482EECF</identifier><identifier type="DOI">10.1016/0306-4573(93)90001-T</identifier><identifier type="PII">0306-4573(93)90001-T</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata><enrichments><istex:catWosTEI uri="https://api.istex.fr/document/DAA4D062569526E5FD243482E8CEEDF50482EECF/enrichments/catWos"><teiHeader><profileDesc><textClass><classCode scheme="WOS">COMPUTER SCIENCE, INFORMATION SYSTEMS</classCode><classCode scheme="WOS">INFORMATION SCIENCE & LIBRARY SCIENCE</classCode></textClass></profileDesc></teiHeader></istex:catWosTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Ticri/explor/TeiVM2/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000485 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000485 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Ticri
|area= TeiVM2
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:DAA4D062569526E5FD243482E8CEEDF50482EECF
|texte= Outline of a model for lexical databases
}}
| This area was generated with Dilib version V0.6.31. |  |