| Project/Area Number |
03610259
|
|---|
| Research Category |
Grant-in-Aid for General Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
言語学・音声学
|
|---|
| Research Institution | Hokkai-Gakuen University (1992-1993)
Tottori University (1991) |
|---|
Principal Investigator |
KIRIKAE Hideo Hokkai-Gakuen University Faculty of Liberal Arts Associate Proffesor, 教養部, 助教授 (20205040)
|
|---|
| Project Period (FY) |
1991 – 1993
|
| Project Status |
Completed (Fiscal Year 1993)
|
| Budget Amount *help |
¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 1993: ¥300,000 (Direct Cost: ¥300,000)
Fiscal Year 1992: ¥400,000 (Direct Cost: ¥400,000)
Fiscal Year 1991: ¥800,000 (Direct Cost: ¥800,000)
|
|---|
| Keywords | AINU / AINU EPIC LEXICON / Kyosuke KINDAICHI / Itsuhiko KUBODERA / INCORPORATION / POLYSYNTHETIC |
|---|
| Research Abstract |
It is the purpose of this prelinary project to compile Ainu Epic Lexicon in the future.
In the first year (1992) all the classical texts of the Ainu epic edited by Kyoosuke KINDAICHI and Itsuhiko KUBODERA were databanked (120,000 lines).
In the second year (1993) a program on UNIX was made, which picked up every word with its context from the inputted texts and arranged them in alphabetical order automatically. We got a concordance for every piece of epics with this program. In this year we chose one of these concordances as a sample and began to compile a lexicon to "Itadori-Maru", the most famous epic with 7000 lines.
Ainu is a incorporative and polysynthetic language. The investigator analyzed every word and got its constituents. These constituets should also be listed in the lexicon.
In the third year (1994) the investigator's work was concentrated on two subjects. The first was analyzeing all the contexts of every word and rearrangeing occurences of the words contextually. This work is still under way. The second was revisal of the program, for the old version ran too slow to analyze the 120,000 lines of epics (about 4,000 days). This problem was solved next year (about 10 hours).
|
