Categorial grammars determined from linguistic data by unification |
| |
Authors: | Wojciech BuszKowski Gerald Penn |
| |
Affiliation: | (1) Institute of Mathematics, Adam Mickiewic University, Matejki 48/49, 60-769 Pozna, Poland;(2) Department of Computer Science, The University of Chicago, Ryerson Hall 1100 East 58th Street, Chicago, ILL., USA |
| |
Abstract: | We provide an algorithm for determining a categorial grammar from linguistic data that essentially uses unification of type-schemes assigned to atoms. The algorithm presented here extends an earlier one restricted to rigid categorial grammars, introduced in [4] and [5], by admitting non-rigid outputs. The key innovation is the notion of an optimal unifier, a natural generalization of that of a most general unifier. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|