Sciweavers

621 search results - page 27 / 125
» Parsing As Tree Traversal
Sort
View
EMNLP
2010
13 years 7 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
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...
Phil Blunsom, Trevor Cohn
SCAM
2003
IEEE
14 years 3 months ago
Parse-Tree Annotations Meet Re-Engineering Concerns
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...
Jan Kort, Ralf Lämmel
ICDT
2010
ACM
147views Database» more  ICDT 2010»
14 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
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...
Sara Cohen, Benny Kimelfeld
NAACL
2001
13 years 11 months ago
Edit Detection and Parsing for Transcribed Speech
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...
Eugene Charniak, Mark Johnson
EDO
2005
Springer
14 years 3 months ago
Using parse tree validation to prevent SQL injection attacks
An SQL injection attack targets interactive web applications that employ database services. Such applications accept user input, such as form fields, and then include this input ...
Gregory Buehrer, Bruce W. Weide, Paolo A. G. Sivil...