Sciweavers

367 search results - page 45 / 74
» Lexicalized Context-Free Grammars
Sort
View
ACL
2003
13 years 10 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
EACL
2003
ACL Anthology
13 years 10 months ago
Information Structure in Topological Dependency Grammar
Topological Dependency Grammar (TDG) is a lexicalized dependency grammar formalism, able to model languages with a relatively free word order. In such languages, word order variat...
Geert-Jan M. Kruijff, Denys Duchier
COLING
1994
13 years 9 months ago
Table-driven Neural Syntactic Analysis of Spoken Korean
A CYK-table-driven interactive relaxation parsing method of spoken Korean, integrated with the CYK-based morphological analysis is introduced. An extension of the Categorial Gramm...
Wonil Lee, Geunbae Lee, Jong-Hyeok Lee
ENTCS
2006
141views more  ENTCS 2006»
13 years 8 months ago
Abstract Families of Abstract Categorial Languages
Families of Categorial Languages Makoto Kanazawa 1 National Institute of Informatics Tokyo, Japan We show that the class of string languages generated by abstract categorial gramm...
Makoto Kanazawa
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 8 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker