Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism

Alexander Gelbukh; Grigori Sidorov; San Yong Han; Erika Hernández-Rubio

doi:10.1007/978-3-540-24694-7_44

Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism

Alexander Gelbukh, Grigori Sidorov, San Yong Han, Erika Hernández-Rubio

Research output: Contribution to journal › Conference article › peer-review

11 Scopus citations

Abstract

The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sentences. The dependency formalism is used for representation of syntactic trees that allows for easier treatment of information about syntactic compatibility. Evaluation of the method is presented for the Spanish language based on comparison of the automatically generated results with manually marked word combinations.

Original language	English
Pages (from-to)	430-437
Number of pages	8
Journal	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume	2972
DOIs	https://doi.org/10.1007/978-3-540-24694-7_44
State	Published - 2004
Event	Third Mexican International Conferenceon Artificial Intelligence - Mexico City, Mexico Duration: 26 Apr 2004 → 30 Apr 2004

Keywords

Collocations
Dependency grammar
Parsing
Spanish

Access to Document

10.1007/978-3-540-24694-7_44

Cite this

@article{288374f74cf243a18733f1369b6c5469,

title = "Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism",

abstract = "The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sentences. The dependency formalism is used for representation of syntactic trees that allows for easier treatment of information about syntactic compatibility. Evaluation of the method is presented for the Spanish language based on comparison of the automatically generated results with manually marked word combinations.",

keywords = "Collocations, Dependency grammar, Parsing, Spanish",

author = "Alexander Gelbukh and Grigori Sidorov and Han, {San Yong} and Erika Hern{\'a}ndez-Rubio",

year = "2004",

doi = "10.1007/978-3-540-24694-7_44",

language = "Ingl{\'e}s",

volume = "2972",

pages = "430--437",

journal = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "Third Mexican International Conferenceon Artificial Intelligence ; Conference date: 26-04-2004 Through 30-04-2004",

}

Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism. / Gelbukh, Alexander ; Sidorov, Grigori; Han, San Yong et al.
In: Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), Vol. 2972, 2004, p. 430-437.

Research output: Contribution to journal › Conference article › peer-review

TY - JOUR

T1 - Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism

AU - Gelbukh, Alexander

AU - Sidorov, Grigori

AU - Han, San Yong

AU - Hernández-Rubio, Erika

PY - 2004

Y1 - 2004

N2 - The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sentences. The dependency formalism is used for representation of syntactic trees that allows for easier treatment of information about syntactic compatibility. Evaluation of the method is presented for the Spanish language based on comparison of the automatically generated results with manually marked word combinations.

AB - The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sentences. The dependency formalism is used for representation of syntactic trees that allows for easier treatment of information about syntactic compatibility. Evaluation of the method is presented for the Spanish language based on comparison of the automatically generated results with manually marked word combinations.

KW - Collocations

KW - Dependency grammar

KW - Parsing

KW - Spanish

UR - http://www.scopus.com/inward/record.url?scp=9444239780&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-24694-7_44

DO - 10.1007/978-3-540-24694-7_44

M3 - Artículo de la conferencia

AN - SCOPUS:9444239780

SN - 0302-9743

VL - 2972

SP - 430

EP - 437

JO - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

JF - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

T2 - Third Mexican International Conferenceon Artificial Intelligence

Y2 - 26 April 2004 through 30 April 2004

ER -

Automatic enrichment of a very large dictionary of word combinations on the basis of dependency formalism

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this