A dependency parsing method for head-final languages

Author

Kang, Seung-Shik

Author_Institution

Sch. of Comput. Sci., Kookmin Univ., Seoul, South Korea

Volume

1

fYear

2001

fDate

2001

Firstpage

696

Abstract

In this paper, the authors show that dependency theory is easily applied to a syntactic analyzer for head-final languages like Korean in that the governor of a word is located on the right side of the dependant and the sentence-head is determined to be the last word of a sentence. These limitations of governor locations are a great help to implement a dependency parser for head-final languages. The authors propose a dependency parsing model using a 2-dimensional matrix (governor-dependency relation matrix). The absolute and relative scoring method is used to select one of the most likely governor

Keywords

grammars; matrix algebra; natural languages; optical character recognition; program compilers; trees (mathematics); 2-dimensional matrix; Korea; absolute scoring method; dependency parsing method; dependency theory; governor-dependency relation matrix; head-final languages; most likely governor selection; relative scoring method; sentence-head; syntactic analyzer; word governor; Computer science; Context modeling; Information analysis; Natural languages; Parallel algorithms; Production;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Electronics, 2001. Proceedings. ISIE 2001. IEEE International Symposium on

Conference_Location

Pusan

Print_ISBN

0-7803-7090-2

Type

conf

DOI

10.1109/ISIE.2001.931881

Filename

931881