Formalization of a General SCD-based Parser for Dictionaries Using Parametrized Grammars

Curteanu Neculai; Moruz Mihai-Alex; Cojocaru Svetlana

Articolul precedent

Articolul urmator

642

Ultima descărcare din IBN:
2018-09-19 13:28

SM ISO690:2012

CURTEANU, Neculai, MORUZ, Mihai-Alex, COJOCARU, Svetlana. Formalization of a General SCD-based Parser for Dictionaries Using Parametrized Grammars. In: International Conference on Intelligent Information Systems, 22-23 august 2013, Chișinău. Chișinău: "VALINEX" SRL, 2013, pp. 89-93.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

International Conference on Intelligent Information Systems 2013

Conferința "International Conference on Intelligent Information Systems"
Chișinău, Moldova, 22-23 august 2013

Formalization of a General SCD-based Parser for Dictionaries Using Parametrized Grammars

Pag. 89-93

Curteanu Neculai¹, Moruz Mihai-Alex¹², Cojocaru Svetlana³

¹ Institute for Computer Science, Romanian Academy, Iasi Branch,
² Alexandru Ioan Cuza University of Iaşi,
³ Institute of Mathematics and Computer Science ASM

Disponibil în IBN: 12 februarie 2018

Descarcă PDF

Rezumat

This paper relies on previous results concerning the parsing technology of SCD (Segmentation-Cohesion-Dependency) configurations applied to six largest thesaurus-dictionaries, presents the project of a new, procedural DTD (Document Type Description) that extends the currently existing DTD for dictionaries, and outlines the architecture of a general SCD-based parser for dictionaries by computing least upper bounds (LUBs) on sense Dependency Hypergraphs (DHs) and on their formal representation as parameterized grammars.

Cuvinte-cheie
SCD parsing method for dictionaries, new DTD for dictionaries, least upper bounds on sense dependency hypergraphs, architecture of a general SCD-based parser for dictionaries

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-59144</cfResPublId>
<cfResPublDate>2013</cfResPublDate>
<cfStartPage>89</cfStartPage>
<cfISBN></cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/59144</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Formalization of a General SCD-based Parser for Dictionaries Using Parametrized Grammars</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>SCD parsing method for dictionaries; new DTD for dictionaries; least upper bounds on sense dependency hypergraphs; architecture of a general SCD-based parser for dictionaries</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>This paper relies on previous results concerning the parsing technology of SCD (Segmentation-Cohesion-Dependency) <em>configurations </em>applied to six largest thesaurus-dictionaries, presents the project of a new, procedural DTD (Document Type Description) that extends the currently existing DTD for dictionaries, and outlines the architecture of a general SCD-based parser for dictionaries by computing <em>least upper bounds </em>(LUBs) on sense Dependency Hypergraphs (DHs) and on their formal representation as <em>parameterized grammars</em>.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-29456</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-29468</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-646</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-29456</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-29456-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
<cfFamilyNames>Curteanu</cfFamilyNames>
<cfFirstNames>Neculai</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-29468</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-29468-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
<cfFamilyNames>Moruz</cfFamilyNames>
<cfFirstNames>Mihai-Alex</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-646</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-646-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2013T24:00:00</cfStartDate>
<cfFamilyNames>Cojocaru</cfFamilyNames>
<cfFirstNames>Svetlana</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>