Back
Learning categorial grammar by unification with negative constraints
Authors:
- Jacek Marciniec
Abstract
This paper presents the modification of the algorithm for determining categorial grammars from linguistic data, presented in [BP 90], in two directions: Enabling negative input and admitting more types than just the sentence type. The notion of restricted optimal unification is introduced-optimal unification sensitive to negative constraints. © 1994 Taylor & Francis Group, LLC.
- Record ID
- UAM989bdb04fd1146e29c43c38b4d5189a9
- Author
- Journal series
- Journal of Applied Non-Classical Logics, ISSN 1166-3081
- Issue year
- 1994
- Vol
- 4
- Pages
- 181-200
- ASJC Classification
- ;
- DOI
- DOI:10.1080/11663081.1994.10510831 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 9; : 1999 = 1.567
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM989bdb04fd1146e29c43c38b4d5189a9/
- URN
urn:amu-prod:UAM989bdb04fd1146e29c43c38b4d5189a9
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.