글로버메뉴 바로가기 본문 바로가기 하단메뉴 바로가기

논문검색은 역시 페이퍼서치

국제 워크샵검색

N/A


  • - 주제 : 어문학분야 > 언어학
  • - 성격 : 학술지
  • - 간기: 기타
  • - 국내 등재 : -
  • - 해외 등재 : -
  • - ISSN :
  • - 간행물명 변경 사항 :
논문제목
수록 범위 : 1995권 0호 (1995)

A Network-Base Writing System for French

( Aesun Yoon ) , ( Hyuk Chul Kwon )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 243-247 ( 총 5 pages)
4,500
키워드보기
초록보기
is a French learning software program using network. This paper presents its implemented prototype version, Emile 1.1. It is based on the client/server model connected by a dial-up modem. The data structure, the tutoring tools and the user interface of Emile 1.1 are described in this paper. It mentions what should be added and improved in the next versions and further studies.

Web Access to a Lexical Database using VB/Access CGI Programming

( Jonathan J Webster )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 249-253 ( 총 5 pages)
4,500
키워드보기
초록보기
In this paper I report on the development of an application in which HTML forms serve as a front-end to a lexical database. Lexical information and data retrieval strategies are based on the Longman Language Activator. A Visual Basic CGI application connects a front end HTIvll. form with the back-end relational database implemented usmg Microsoft Access. Three aspects of the applcation are discussed in this paper: (1) the lexical database: (2) the HTIvll. front end: and (3) the Visual Basic CGI programming necessary to connect (l) and (2)

Document Ranking Method for High Precision Rate

( Mee Sun Eon ) , ( Se Young Park )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 255-259 ( 총 5 pages)
4,500
키워드보기
초록보기
Many information retrieval(IR) systems retrieve relevant documents based on exact matching of keywords between a query and documents. This method degrades precision rate. In order to solve the problem, we collected semantically related words and assigned semantic relationships used in general thesaurus and a special relationship called keyfact term(FT) manually. In addition to the semantic knowledge, we automatically constructed statistic knowledge based on the concept of mutual information. Keyfact is an extended concept of keyword represented by noun and compound noun. Keyfact can be a verb and an adjective including subject or object term. We first retrieved relevant documents with original query using if * idf weighting formula and then an expanded query including key facts is used in both second document ranking and word sense disambiguating. So we made an improvement in precision rate using keyfact network.

Natural Languages Analysis in Machine Translation (MT) based on the STCG (STRING-TREE CORRESPONDENCE GRAMMAR)

( Tang Enya Kong ) , ( Zaharin Yusoff )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 261-265 ( 총 5 pages)
4,500
키워드보기
초록보기

An Implementation of a Multilingual Regular Expression Segmentor for Ordinary and Morphologically Rich Lexical Tokens

( Paul Wu Hrng Jyh ) , ( Kevin Cheong )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 267-271 ( 총 5 pages)
4,500
키워드보기
초록보기
Lexical pattern matching and text extraction is an essential component of many Natural Language Processing applications. Following the language hierarchy first conceived hy Chomsky, it is commonly accepted that simple phrasal patterns should be categorised under the class of Regular Language (RL). There are :3 operations in RL - Union, Concatenation and Kleene Closure - which are applied to a finite lexicon. The machinery that recognises RL is the Finite State Machine (FSM). This paper discusses and postulates that the degree with which a class of patterns exercise the aspects of RL operators, is directly proportional to the richness inll1orphology of lexical tokens.

Sorting by Sound-Arbitrary Lexical Ordering for Transcribed Thai Text

( Doung Cooper )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 273-279 ( 총 7 pages)
4,500
키워드보기
초록보기
When either Thai or transcribed (RomanizedJ Thai is sorted alphabetically, words that sound very much alike usually end up far apart. maay and may are thrown to opposite ends of the letter m entries, even though mistaking one for the other causes problems for both foreign students who cannot speak clearly, and Thais who can``t spell. This paper explains how and why the difficulty occurs, and shows why both Thai and transcription are inherently difficult to sort by sound. It introduces a method of preprocessing - deriving phonemic signatures - that lets us define improved lexical or dictionary orders, yet does not require anything but standard sorting code. The method can be applied to other languages - Lno, Khmer, and Burmese - that, like Thai, distinguish words on the basis of vowel length and/or tone.

A UNIFIED ACCOUNT OF POLARITY PHENOMENA

( Chungmin Lee )
한국언어정보학회|국제 워크샵  1995권 0호, 1995 pp. 281-291 ( 총 11 pages)
5,100
키워드보기
초록보기
This paper argues, in an attempt at a unified account of negative polarity and free choice phenomena expressed by amu lany or wh-indefinites in Korean, English, Chinese, and Japanese that the notion of concession by arbitrary or disjunctive choice (based on indefiniteness) is crucial. With this central notion all the apparently diverse polarity-related phenomena can be explained consistently, not just described in terms of distribution. With strong negatives and affective licensors, their negative force is so substantial that concessive force need not be reinforced and the licensed NPIs reveal existential force. With free choice and generic-like items, licensed by modals, weakly negative in their natrue of uncertainty/irrealis, concessive force is reinforced and emphasized and the whole category denoted by the given Noun is reached in the process of concession by arbitrariy choice of its members on quantificational scale, giving the impression of universal force. The logical consequences of monotone decreasingness are transparent with strong negatives but less so with weaker ones. Negative polarity, free choice, genericity, concession, arbitrary choice, indefiniteness, scale, Korean, English.
<< 1 2 3 4