tailieunhanh - Báo cáo khoa học: "Parsing with Discontinuous Constituents"

By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages. are explicitly represented in the grammar formalism. Given this, it will be easy to generalize the notion of location so that it can describe the discontinuous constituents of non-configurational languages. . | Parsing with Discontinuous Constituents Mark Johnson Center for the Study of Language and Information and Department of Linguistics Stanford University. Abstract By generalizing the notion of ideation of a constituent to allow discontinuous loctaions one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages. 1. Introduction In this paper I discuss the problem of describing and computationally processing the discontinuous constituents of non-configurational languages. In these languages the grammatical function that an argument plays in the clause or the sentence is not determined by its position or configuration in the sentence as it is in configurational languages like English but rather by some kind of morphological marking on the argument or on the verb. Word order in non-configurational languages is often extremely free it has been claimed that if some string of words s is grammatical in one of these languages then the string S formed by any arbitrary permutation of the words in s is also grammatical. Most attempts to describe this word order freedom take mechanisms designed to handle fairly rigid word order systems and modify them in order to account for the greater word order freedom of non-configurational languages. Although it is doubtful whether any natural language ever exhibits such total scrambling it is interesting to investigate the computational and linguistic implications of systems that allow a high degree of word order freedom. So the approach here is the opposite to the usual one I start with a system which unconstrained allows for unrestricted permutation of the words of a sentence and capture any word order regularities the language may have by adding restrictions to the system. The extremely free word order of