메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
저널정보
국제언어인문학회 인문언어 인문언어 제15권 제1호
발행연도
2013.1
수록면
125 - 151 (27page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

초록· 키워드

오류제보하기
This study introduces a language processing model of one of the most prominent French computational linguists, Maurice Gross (1934~2001), discussing its computational applications. The methodology he proposed for describing syntactic properties of French simple sentences presupposes the exhaustive examination of all predicative entries, which gave it the name Lexicon-Grammar. The results of this approach are presented under a form of binary matrix: about 75,000 French predicates have been described and classified in syntactic tables. However, Gross realized that there still existed tremendous size of non-regular expressions, called compound words, frozen phrases or multi-word expressions, which can hardly can be described under syntactic and formal devices. Thus, he suggested a more processing-oriented framework named Local Grammar (LGG) which is represented as a directed graph like RTN (Recursive Transition Network). The LGGs are transformed into finite-state automata or transducers by means of FSTgraphEditor in UNITEX system, which is implemented, on one hand, for this purpose and, on the other hand, for the automatic corpus processing based on these finite graphs as well as electronic dictionaries included in the system. In this paper, various areas of LGG applications are discussed, such as the construction of linguistic resources,information extraction/opinion mining or formalization of frozen expressions for machine translation.

목차

등록된 정보가 없습니다.

참고문헌 (21)

참고문헌 신청

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0