Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,822 papers from all fields of science
Search
Sign In
Create Free Account
Parse tree
Known as:
Concrete syntax tree
, Parse graph
, Phrase marker
Expand
A parse tree or parsing tree or derivation tree or (concrete) syntax tree is an ordered, rooted tree that represents the syntactic structure of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ANTLR
Abstract syntax
Ambiguous grammar
Atari BASIC
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Drain: An Online Log Parsing Approach with Fixed Depth Tree
Pinjia He
,
Jieming Zhu
,
Zibin Zheng
,
Michael R. Lyu
IEEE International Conference on Web Services…
2017
Corpus ID: 4776668
Logs, which record valuable system runtime information, have been widely employed in Web service management by service providers…
Expand
Highly Cited
2015
Highly Cited
2015
An Improved Non-monotonic Transition System for Dependency Parsing
Matthew Honnibal
,
Mark Johnson
Conference on Empirical Methods in Natural…
2015
Corpus ID: 1267472
Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they…
Expand
Highly Cited
2011
Highly Cited
2011
Parsing Natural Scenes and Natural Language with Recursive Neural Networks
R. Socher
,
Cliff Chiung-Yu Lin
,
A. Ng
,
Christopher D. Manning
International Conference on Machine Learning
2011
Corpus ID: 18690358
Recursive structure is commonly found in the inputs of different modalities such as natural scene images or natural language…
Expand
Highly Cited
2007
Highly Cited
2007
Data and text mining RelEx — Relation extraction using dependency parse trees
Katrin Fundel
,
R. Küffner
,
R. Zimmer
2007
Corpus ID: 7626307
Motivation: The discovery of regulatory pathways, signal cascades, metabolic processes or diseasemodels requires knowledge on…
Expand
Highly Cited
2005
Highly Cited
2005
Using parse tree validation to prevent SQL injection attacks
G. Buehrer
,
B. Weide
,
P. Sivilotti
Joint Conference on Lexical and Computational…
2005
Corpus ID: 5064763
An SQL injection attack targets interactive web applications that employ database services. Such applications accept user input…
Expand
Highly Cited
2005
Highly Cited
2005
The Proposition Bank: An Annotated Corpus of Semantic Roles
Martha Palmer
,
Paul R. Kingsbury
,
D. Gildea
International Conference on Computational Logic
2005
Corpus ID: 2486369
The Proposition Bank project takes a practical approach to semantic representation, adding a layer of predicate-argument…
Expand
Highly Cited
2003
Highly Cited
2003
Head-Driven Statistical Models for Natural Language Parsing
M. Collins
International Conference on Computational Logic
2003
Corpus ID: 7901127
This article describes three statistical models for natural language parsing. The models extend methods from probabilistic…
Expand
Highly Cited
2003
Highly Cited
2003
Sentence Level Discourse Parsing using Syntactic and Lexical Information
Radu Soricut
,
D. Marcu
North American Chapter of the Association for…
2003
Corpus ID: 5187426
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse…
Expand
Highly Cited
2002
Highly Cited
2002
New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron
M. Collins
,
Nigel P. Duffy
Annual Meeting of the Association for…
2002
Corpus ID: 7506864
This paper introduces new learning algorithms for natural language processing based on the perceptron algorithm. We show how the…
Expand
Highly Cited
1978
Highly Cited
1978
The sausage machine: A new two-stage parsing model
L. Frazier
,
Janet D. Fodor
Cognition
1978
Corpus ID: 53188302
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE