Articolul precedent |
Articolul urmator |
680 6 |
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 | ||||||
|
||||||
Pag. 89-93 | ||||||
|
||||||
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 |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Curteanu, N.</creatorName> <affiliation>Institute for Computer Science, Romanian Academy, Iasi Branch, România</affiliation> </creator> <creator> <creatorName>Moruz, M.</creatorName> <affiliation>Institute for Computer Science, Romanian Academy, Iasi Branch, România</affiliation> </creator> <creator> <creatorName>Cojocaru, S.C.</creatorName> <affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Formalization of a General SCD-based Parser for Dictionaries Using Parametrized Grammars</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2013</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'></relatedIdentifier> <subjects> <subject>SCD parsing method for dictionaries</subject> <subject>new DTD for dictionaries</subject> <subject>least upper bounds on sense dependency hypergraphs</subject> <subject>architecture of a general SCD-based parser for dictionaries</subject> </subjects> <dates> <date dateType='Issued'>2013</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>