Learning Dependencies between Case Frame Slots
| dc.creator | Li, Hang | |
| dc.creator | Abe, Naoki | |
| dc.date | 1996-05-12 | |
| dc.date | 1996-09-26 | |
| dc.date.accessioned | 2026-07-07T09:02:20Z | |
| dc.date.available | 2026-07-07T09:02:20Z | |
| dc.description | We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we propose a method of learning dependencies between case frame slots. We view the problem of learning case frame patterns as that of learning multi-dimensional discrete joint distributions, where random variables represent case slots. We then formalize the dependencies between case slots as the probabilistic dependencies between these random variables. Since the number of parameters in a multi-dimensional joint distribution is exponential, it is infeasible to accurately estimate them in practice. To overcome this difficulty, we settle with approximating the target joint distribution by the product of low order component distributions, based on corpus data. In particular we propose to employ an efficient learning algorithm based on the MDL principle to realize this task. Our experimental results indicate that for certain classes of verbs, the accuracy achieved in a disambiguation experiment is improved by using the acquired knowledge of dependencies. | |
| dc.description | 12 pages, LaTex source, 2 eps figures, uses colap.sty and epsf.sty ; an extended abstract of this paper appeared in Proc. of COLING'96, page 10-15 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605013 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/148597 | |
| dc.subject | Computation and Language | |
| dc.title | Learning Dependencies between Case Frame Slots | |
| dc.type | text |