Sciweavers

675 search results - page 81 / 135
» On Compression of Parse Trees
Sort
View
DLT
2003
13 years 10 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
IJCAI
2003
13 years 10 months ago
Evaluating Coverage for Large Symbolic NLG Grammars
After many successes, statistical approaches that have been popular in the parsing community are now making headway into Natural Language Generation (NLG). These systems are aimed...
Charles B. Callaway
ACL
1996
13 years 10 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
CSL
2007
Springer
13 years 8 months ago
Stochastic and syntactic techniques for predicting phrase breaks
Determining the position of breaks in a sentence is a key task for a text-to-speech (TTS) system. We describe some methods for phrase break prediction in which the whole sentence ...
Ian Read, Stephen Cox
COLING
2002
13 years 8 months ago
Can Subcategorization Help a Statistical Dependency Parser?
Today there is a relatively large body of work on automatic acquisition of lexicosyntactical preferences (subcategorization) from corpora. Various techniques have been developed t...
Daniel Zeman