675 search results - page 28 / 135 » On Compression of Parse Trees |
COLING
2008
13 years 9 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
EMNLP
2010
13 years 5 months ago
2010
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
SCAM
2003
IEEE
14 years 24 days ago
2003
IEEE
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...
ICDT
2010
ACM
13 years 11 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
NAACL
2001
13 years 9 months ago
2001
We present a simple architecture for parsing transcribed speech in which an edited-word detector first removes such words from the sentence string, and then a standard statistical...