Sciweavers

94 search results - page 6 / 19
» grammars 1998
Sort
View
TAPD
1998
81views more  TAPD 1998»
13 years 11 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
ACL
2000
13 years 11 months ago
Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
David Chiang
ACL
1998
13 years 11 months ago
Know When to Hold 'Em: Shuffling Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than Engl...
Robert T. Kasper, Mike Calcagno, Paul C. Davis
CORR
1998
Springer
127views Education» more  CORR 1998»
13 years 9 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen
SCM
1998
13 years 11 months ago
Product Configuration Using Object Oriented Grammars
This paper presents a technique for product configuration modelling based on object-orientation and attribute grammars. The technique allows efficient interactive configurator tool...
Görel Hedin, Lennart Ohlsson, John McKenna