• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.351-357
• /
• 1994

At least two projects for English-to-Korean translation have been already in action for the last few years, but so far no attention has been paid to the problem of resolving pronominal reference and a default pronoun translation has been considered instead. In this paper we argue that pronous cannot be handled trivially in an English-to-Korean translation and one cannot bypass the task of resolving anaphoric reference if aiming at good and natural translation. In addition, we propose lexical transfer rules for English-to-Korean anaphor translation and outline an anaphora resolution model for an English-to-Korean MT system in operation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.32.3-32
• /
• 2001

This paper proposes a layered protocol to interpret voice commands of the user´s own language to a machine, to control it in real time. The layers consist of speech signal capturing layer, lexical analysis layer, interpretation layer and finally activation layer, where each layer tries to mimic the human counterparts in command following. The contents of a continuous voice command are captured by using Hidden Markov Model based speech recognizer. Then the concepts of Artificial Neural Network are devised to classify the contents of the recognized voice command ...

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.1082-1087
• /
• 1994

A set of text database is indispensable to the probabilistic models for speech recognition, linguistic model, and machine translation. We introduce an environment to canstruct text databases : an automatic tagging system and a set of tools for lexical knowledge acquisition, which provides the facilities of automatic part of speech recognition and guessing.

• Asia Pacific Journal of Corpus Research
• /
• v.5 no.1
• /
• pp.23-36
• /
• 2024

This research centers on the Taiwan Eye-Movement Corpus of Spanish (TECS), a specially created corpus comprising eye-tracking data from Chinese-speaking learners of Spanish as a third language in Taiwan. Its primary purpose is to explore the broad utility of TECS in understanding language learning processes, particularly the initial stages of language learning. Constructing this corpus involves gathering data on eye-tracking, reading comprehension, and language proficiency to develop a machine-learning model that predicts learner behaviors, and subsequently undergoes a predictability test for validation. The focus is on examining attention in input processing and their relationship to language learning outcomes. The TECS eye-tracking data consists of indicators derived from eye movement recordings while reading Spanish sentences with temporal references. These indicators are obtained from eye movement experiments focusing on tense verbal inflections and temporal adverbs. Chinese expresses tense using aspect markers, lexical references, and contextual cues, differing significantly from inflectional languages like Spanish. Chinese-speaking learners of Spanish face particular challenges in learning verbal morphology and tenses. The data from eye movement experiments were structured into feature vectors, with learner behaviors serving as class labels. After categorizing the collected data, we used two types of machine learning methods for classification and regression: Random Forests and the k-nearest neighbors algorithm (KNN). By leveraging these algorithms, we predicted learner behaviors and conducted performance evaluations to enhance our understanding of the nexus between learner behaviors and language learning process. Future research may further enrich TECS by gathering data from subsequent eye-movement experiments, specifically targeting various Spanish tenses and temporal lexical references during text reading. These endeavors promise to broaden and refine the corpus, advancing our understanding of language processing.

• MALSORI
• /
• no.51
• /
• pp.151-165
• /
• 2004

For educational and research purposes, a Korean speech recognition platform is designed. It is based on an object-oriented architecture and can be easily modified so that researchers can readily evaluate the performance of a recognition algorithm of interest. This platform will save development time for many who are interested in speech recognition. The platform includes the following modules: Noise reduction, end-point detection, met-frequency cepstral coefficient (MFCC) and perceptually linear prediction (PLP)-based feature extraction, hidden Markov model (HMM)-based acoustic modeling, n-gram language modeling, n-best search, and Korean language processing. The decoder of the platform can handle both lexical search trees for large vocabulary speech recognition and finite-state networks for small-to-medium vocabulary speech recognition. It performs word-dependent n-best search algorithm with a bigram language model in the first forward search stage and then extracts a word lattice and restores each lattice path with a trigram language model in the second stage.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.639-649
• /
• 2010

In this paper, a definition of interval-valued fuzzy regular language (IVFRL) is proposed and their related properties studied. A model of finite automaton (DFA and NDFA) with interval-valued fuzzy transitions is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy transitions are examined. Moreover, a definition of finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states are also discussed. It is observed that, the model finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is more suitable than the model finite automaton (DFA and NDFA) with interval-valued fuzzy transitions for recognizing the interval-valued fuzzy regular language. In the end, interval-valued fuzzy regular expressions are defined. We can use the proposed interval-valued fuzzy regular expressions in lexical analysis.

• Journal of Information Processing Systems
• /
• v.8 no.2
• /
• pp.301-314
• /
• 2012

In this paper, two new approaches to align English-Arabic sentences in bilingual parallel corpora based on the Multi-Class Support Vector Machine (MSVM) and the Hidden Markov Model (HMM) classifiers are presented. A feature vector is extracted from the text pair that is under consideration. This vector contains text features such as length, punctuation score, and cognate score values. A set of manually prepared training data was assigned to train the Multi-Class Support Vector Machine and Hidden Markov Model. Another set of data was used for testing. The results of the MSVM and HMM outperform the results of the length based approach. Moreover these new approaches are valid for any language pairs and are quite flexible since the feature vector may contain less, more, or different features, such as a lexical matching feature and Hanzi characters in Japanese-Chinese texts, than the ones used in the current research.

• Journal of Computing Science and Engineering
• /
• v.11 no.1
• /
• pp.32-38
• /
• 2017

Determining the correct word sense among ambiguous senses is essential for semantic analysis. One of the models for word sense disambiguation is the word space model which is very simple in the structure and effective. However, when the context word vectors in the word space model are merged into sense vectors in a sense inventory, they become typically very large but still suffer from the lexical scarcity. In this paper, we propose a word sense disambiguation method using word embedding that makes the sense inventory vectors compact and efficient due to its additive compositionality. Results of experiments with a Korean sense-tagged corpus show that our method is very effective.

• Journal of Multimedia Information System
• /
• v.5 no.3
• /
• pp.147-154
• /
• 2018

Natural language processing (NLP) is an emerging research area in which we study how machines can be used to perceive and alter the text written in natural languages. We can perform different tasks on natural languages by analyzing them through various annotational tasks like parsing, chunking, part-of-speech tagging and lexical analysis etc. These annotational tasks depend on morphological structure of a particular natural language. The focus of this work is part-of-speech tagging (POS tagging) on Hindi language. Part-of-speech tagging also known as grammatical tagging is a process of assigning different grammatical categories to each word of a given text. These grammatical categories can be noun, verb, time, date, number etc. Hindi is the most widely used and official language of India. It is also among the top five most spoken languages of the world. For English and other languages, a diverse range of POS taggers are available, but these POS taggers can not be applied on the Hindi language as Hindi is one of the most morphologically rich language. Furthermore there is a significant difference between the morphological structures of these languages. Thus in this work, a POS tagger system is presented for the Hindi language. For Hindi POS tagging a hybrid approach is presented in this paper which combines "Probability-based and Rule-based" approaches. For known word tagging a Unigram model of probability class is used, whereas for tagging unknown words various lexical and contextual features are used. Various finite state machine automata are constructed for demonstrating different rules and then regular expressions are used to implement these rules. A tagset is also prepared for this task, which contains 29 standard part-of-speech tags. The tagset also includes two unique tags, i.e., date tag and time tag. These date and time tags support all possible formats. Regular expressions are used to implement all pattern based tags like time, date, number and special symbols. The aim of the presented approach is to increase the correctness of an automatic Hindi POS tagging while bounding the requirement of a large human-made corpus. This hybrid approach uses a probability-based model to increase automatic tagging and a rule-based model to bound the requirement of an already trained corpus. This approach is based on very small labeled training set (around 9,000 words) and yields 96.54% of best precision and 95.08% of average precision. The approach also yields best accuracy of 91.39% and an average accuracy of 88.15%.

• Korean Journal of Cognitive Science
• /
• v.2 no.2
• /
• pp.487-513
• /
• 1990

The present paper reviews experimental finding such as kanji stroop effect, kana superiority effect in naming task, kanji superiority effect in lexical devision task, and the different pattern of facilitatory priming effect in repetition priming task. Most of the experimental findings indicate that kana script and kanji script are processed independently and modularly. These indications are also consistent with the basic observations on Japanese dyslexics. A connectionist model named JIA(Japanese Interactive Activation)is proposed which is a revision of interactive activation model proposed by McClelland & Rumelhart(1981). The differences between the two models are as follows. Firstly, JIA has a kana module and kanji module at letter level. Secondly, JIA adopts script-specific interconnections between letter-level nodes and word-level nodes:word nodes receive larger activation from the script consistent letter-level nodes. JIA successfully explains all the experimental findings and many cases of Japanese dyslexia. A computer program which simulates JIA model was written and run.