Sciweavers

12 search results - page 2 / 3
» Underspecification in Type-Logical Grammars
Sort
View
ACL
1998
13 years 8 months ago
HPSG-Style Underspecified Japanese Grammar with Wide Coverage
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
Yutaka Mitsuishi, Kentaro Torisawa, Jun-ichi Tsuji...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
ACL
1997
13 years 8 months ago
Interleaving Universal Principles and Relational Constraints over Typed Feature Logic
We introduce a typed feature logic system providing both universal implicational principles as well as definite clauses over feature terms. We show that such an architecture suppo...
Thilo Götz, Detmar Meurers
LACL
1998
Springer
13 years 11 months ago
Anaphora and Quantification in Categorial Grammar
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Gerhard Jäger
ACL
1998
13 years 8 months ago
Compacting the Penn Treebank Grammar
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
Alexander Krotov, Mark Hepple, Robert J. Gaizauska...