Hyuk-Chul Kwon

Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here

2011

pdf bib
Consistency Maintenance in Prosodic Labeling for Reliable Prediction of Prosodic Breaks
Youngim Jung | Hyuk-Chul Kwon
Proceedings of the 5th Linguistic Annotation Workshop

2010

pdf bib
Considerations on Automatic Mapping Large-Scale Heterogeneous Language Resources: Sejong Semantic Classes and KorLex
Heum Park | Ae sun Yoon | Woo Chul Park | Hyuk-Chul Kwon
Proceedings of the Eighth Workshop on Asian Language Resouces

1996

pdf bib
Rule-based Approach to Korean Morphological Disambiguation Supported by Statistical Method
Min-Jung Kim | Hyuk-Chul Kwon | Ae-Sun Yoon
Proceedings of the 11th Pacific Asia Conference on Language, Information and Computation

1995

pdf bib
A Network-Based Writing System for French
Aesun Yoon | Hyuk-Chul Kwon
Proceedings of the 10th Pacific Asia Conference on Language, Information and Computation

1994

pdf bib
Incremental Construction of a Lexical Transducer for Korean
Hyuk-Chul Kwon | Lauri Karttunen
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics

1991

pdf bib
Unification-Based Dependency Parsing of Governor-Final Languages
Hyuk-Chul Kwon | Aesun Yoon
Proceedings of the Second International Workshop on Parsing Technologies

This paper describes a unification-based dependency parsing method for governor-final languages. Our method can parse not only projective sentences but also non-projective sentences. The feature structures in the tradition of the unification-based formalism are used for writing dependency relations. We use a structure sharing and a local ambiguity packing to save storage.
Search
Co-authors
Venues
Fix data