Sciweavers

367 search results - page 61 / 74
» Lexicalized Context-Free Grammars
Sort
View
COLING
2000
13 years 9 months ago
Structural disambiguation of morpho-syntactic categorial parsing for Korean
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
Jeongwon Cha, Gary Geunbae Lee
CC
2002
Springer
100views System Software» more  CC 2002»
13 years 8 months ago
Disambiguation Filters for Scannerless Generalized LR Parsers
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
Mark van den Brand, Jeroen Scheerder, Jurgen J. Vi...
CORR
1998
Springer
79views Education» more  CORR 1998»
13 years 8 months ago
Can Subcategorisation Probabilities Help a Statistical Parser?
Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies o...
John Carroll, Guido Minnen, Ted Briscoe
ACL
2010
13 years 6 months ago
Hard Constraints for Grammatical Function Labelling
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
Wolfgang Seeker, Ines Rehbein, Jonas Kuhn, Josef v...
NAACL
2003
13 years 9 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani