Korean Parsing based on Conditional Unification Using Extended Sentence Patterns Information 


Vol. 35,  No. 12, pp. 247-256, Dec.  2010


PDF
  Abstract

English is a more or less fixed word order language, while Korean is a partially free word order language. And it controls sentences by limiting the meanings of the predicate. In addition, Most of Korean sentences are complex sentences which are consisted of embedded clause. Therefore it is difficult to describe appropriate grammar or syntactic constraint for the Korean. So, Korean parsing has a lot of syntactic ambiguity. In this paper, we extend a Sentence Patterns Information(SPI) to include structure of complex sentences. And, we propose Korean parsing method using conditional unification based Context Free Grammar(CFG) that is easy to describe extend SPI as syntactic constraint conditions. By empirical results of parsing 2,641 sentences, we found that our method decreases 84.81% of syntactic ambiguities.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Kim, "Korean Parsing based on Conditional Unification Using Extended Sentence Patterns Information," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 247-256, 2010. DOI: .

[ACM Style]

Ki-cheol Kim. 2010. Korean Parsing based on Conditional Unification Using Extended Sentence Patterns Information. The Journal of Korean Institute of Communications and Information Sciences, 35, 12, (2010), 247-256. DOI: .

[KICS Style]

Ki-cheol Kim, "Korean Parsing based on Conditional Unification Using Extended Sentence Patterns Information," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 247-256, 12. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880