• English Language & Literature Teaching
• /
• v.10 no.1
• /
• pp.179-200
• /
• 2004

The purpose of this study is to investigate the adequacy of derivational approach and representational approach to syntactic theories in generative grammar. As the generative grammar is based on the derivational process of syntactic theories, it is suggested that derivational approach is more valid than representational approach. Move, Economy Principle, Local Economy and Label-free Phrase Structure in Minimalist framework support the preference of derivational approach to representational approach with the elimination of computational complexity, minimality, and label-free phrase structure. Syntactic structure is considered as the result of the interaction of the properties of lexical items containing probe and economy conditions constrained by bare output conditions. On the other hand, Pseudogapping in Lasnik(1999) is analyzed in terms of Object Shift, that is, overt raising to Spec of $Agr_o$ and the PF deletion of VP in representational approach. Hence, it is suggested that the combination of derivational and representational approaches to syntactic theories can be admitted in generative grammar.

• Language and Information
• /
• v.20 no.1
• /
• pp.25-49
• /
• 2016

Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 1983.02b
• /
• pp.143-166
• /
• 1983

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.688-702
• /
• 1998

In this paper, we propose sign language morpheme generation rule corresponding to morpheme analysis for each part of speech. Korean natural sign language has extremely limited vocabulary, and the number of grammatical components eing currently used are limited, too. In this paper, therefore, we define natural sign language grammar corresponding to Korean language grammar in order to translate natural Korean language sentences to the corresponding sign language. Each phrase should define sign language morpheme generation grammar which is different from Korean language analysis grammar. Then, this grammar is applied to morpheme analysis/combination rule and sentence structure analysis rule. It will make us generate most natural sign language by definition of this grammar.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.67-75
• /
• 2007

This paper presents the architectural aspects of the phrase analyzer that attempts to recognize phrases and identify the functional roles in the sentences in formal Japanese documents. Since the object of interest is a phrase, the current system, designed in an object-oriented architecture, contains the Phrase class, and makes use of the linguistic generalization about languages with Case markers that a phrase, whether a noun phrase, a verb phrase, a postposition (or preposition) phrase or a clause phrase, can be separated into the content and the function components. Without a dictionary, and drawing on the orthographic information on the words to parse, it also contains a class that identifies the types of characters, a class representing grammar, and a class playing the role of a controller. The system has a simple and intuitive structure, externally and internally, and therefore is easy to modify and extend.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.529-535
• /
• 2014

This study is to establish the consistency of Subject-Verb agreement in quantifier phrase. Absence of consistency in English grammar is critical to the grammaticality. We focused on the grammar part, specifically, S-V agreement rule in quantifier phrase. We believe the existence of exceptional rules in quantifier S-V structure is not necessary as the basic grammar rule on S-V agreement is sufficient enough and adding exceptional rules just make it more difficult and confusing. We argue specific features indwelt in each quantifier are linked when quantifiers are used pronominally and the ${\pm}$feature plays an important role in quantifier S-V agreement structure. This study shows the solution to eliminate the ungrammaticality in typical English text books by simplifying quantifier S-V agreement to make it solid and systematic.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.235-244
• /
• 2004

We propose a format of a binary phrase structure grammar with composite labels. The grammar adopts binary rules so that the dependency between two sub-trees can be represented in the label of the tree. The label of a tree is composed of two attributes, each of which is extracted from each sub-tree so that it can represent the compositional information of the tree. The composite label is generated from part-of-speech tags using an automatic labeling algorithm. Since the proposed rule description scheme is binary and uses only part-of-speech information, it can readily be used in dependency grammar and be applied to other languages as well. In the best-1 context-free cross validation on 31,080 tree-tagged corpus, the labeled precision is 79.30%, which outperforms phrase structure grammar and dependency grammar by 5% and by 4%, respectively. It shows that the proposed rule description scheme is effective for parsing Korean.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1418-1429
• /
• 2004

This paper presents GrammE, a grammar development environment for feature-based APSG. At the stage of a grammar development, analysis are be done by interpreting the grammar under development, given in a text format, it is relatively easy to diagnose the grammar. Once developed, the grammar is compiled, by using the embedded grammar compiler, into a parser program written in $C^{++}$. The parser program can be used in various types of natural language processing systems requiring syntactic analysis. GrammE is language-independent, and so far has been used for the development of Korean and Chinese grammars.

• Language and Information
• /
• v.18 no.2
• /
• pp.1-29
• /
• 2014

Relativization is one of the common syntactic operations to merge two different clauses into a single information unit. This operation plays a pivotal role to structuralize multiple clauses cohesively as well as serves to specify the property an individual has within the context. That implies that relativization contributes to information structure of multiclausal sentences. In this context, this paper delves into information structure of relative clauses in English with an eye toward creation of a computational model from a standpoint of machine translation. The current work employs Head-driven Phrase Structure Grammar (HPSG, Pollard and Sag (1994)) as a theory of grammar and Minimal Recursion Semantics (MRS, Copestake et al. (2005) as a meaning representation system. Building upon these formalisms, this paper addresses how information structure of relative clauses can be represented and constrained. The current work makes use of Individual CONStraints (ICONS) for modeling relative clauses with respect to information structure. The current work also investigates which relative clause involves which information structure constraint. The present study argues that non-restrictive relative clauses impose a more specific constraint on information structure than restrictive relative clauses.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.411-420
• /
• 2002

The left-associative grammar model (LAG) has been applied successfully to the morphologic and syntactic analysis of various european and asian languages. The algebraic definition of the LAG is very well suited for the application to natural language processing as it inherently obeys de Saussure's second law (de Saussure, 1913, p. 103) on the linear nature of language, which phrase-structure grammar (PSG) and categorial grammar (CG) do not. This paper describes the so-called Loom-LAGs (LLAG) -a specialization of LAGs for the analysis of natural language. Whereas the only means of language-independent abstraction in ordinary LAG is the principle of possible continuations, LLAGs introduce a set of more detailed language-independent generalizations that form the so-called loom of a Loom-LAG. Every LLAG uses the very smut loom and adds the language-specific information in the form of a declarative description of the language -much like an ancient mechanised Jacquard-loom would take a program-card providing the specific pattern for the cloth to be woven. The linguistic information is formulated declaratively in so-called syntax plans that describe the sequential structure of clauses and phrases. This approach introduces the explicit notion of phrases and sentence structure to LAG without violating de Saussure's second law iud without leaving the ground of the original algebraic definition of LAG, LLAGS can in fact be shown to be just a notational variant of LAG -but one that is much better suited for the manual development of syntax grammars for the robust analysis of free texts.