Browse

Problems with Parsing Free Ordered, Elliptic Languages

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
Oh, Jonathan C.; Graham, Steven
Issue Date
1989
Publisher
서울대학교 언어교육원
Citation
어학연구, Vol.25 No.4, pp. 793-801
Abstract
Parsing free ordered, elliptic languages raises interesting problems. Korean is a free ordered, verb-final, highly elliptic language, and we will use it for illustration in this paper. We develop some formalism to represent various phenomena that arise in parsing such a language. We will also make suggestions for the implementation of our formalism.
Parsing a free ordered language presents different problems from those found in a language like English. In Korean, components are free ordered within a given clause but only within THAT clause. Components from a higher level clause may not interleave those of a lower level clause, such as a relative clause or a complementation. The free ordered clausal structure of Korean reminds one of the block structures of programming languages such as Pascal. Unfortunately, Korean provides no explicit end markers for its "blocks", allowing multiple parses and resultant ambiguity.
ISSN
0254-4474
Language
English
URI
https://hdl.handle.net/10371/85846
Files in This Item:
Appears in Collections:
Language Education Institute (언어교육원)Language Research (어학연구)Language Research (어학연구) Volume 25 Number 1/4 (1989)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse