Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,119,354 papers from all fields of science
Search
Sign In
Create Free Account
Parsing
Known as:
Parser (programming language)
, List of parser development software
, Parsable
Expand
Parsing or syntactic analysis is the process of analysing a string of symbols, either in natural language or in computer languages, conforming to the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Turing Award
ANTLR
CYK algorithm
Client–server model
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Tailoring Continuous Word Representations for Dependency Parsing
Mohit Bansal
,
Kevin Gimpel
,
Karen Livescu
Annual Meeting of the Association for…
2014
Corpus ID: 7803700
Word representations have proven useful for many NLP tasks, e.g., Brown clusters as features in dependency parsing (Koo et al…
Expand
Highly Cited
2008
Highly Cited
2008
ParsCit: an Open-source CRF Reference String Parsing Package
Isaac G. Councill
,
C. Lee Giles
,
Min-Yen Kan
International Conference on Language Resources…
2008
Corpus ID: 141747
We describe ParsCit, a freely available, open-source implementation of a reference string parsing package. At the core of ParsCit…
Expand
Highly Cited
2008
Highly Cited
2008
Parsing costs as predictors of reading difficulty: An evaluation using the Potsdam Sentence Corpus
Marisa Ferrara Boston
,
J. Hale
,
R. Kliegl
,
Umesh Patil
,
S. Vasishth
Journal of Eye Movement Research
2008
Corpus ID: 14265435
The surprisal of a word on a probabilistic grammar constitutes a promising complexity metric for human sentence comprehension…
Expand
Highly Cited
2007
Highly Cited
2007
The CoNLL 2007 Shared Task on Dependency Parsing
Joakim Nivre
,
Johan Hall
,
+4 authors
Deniz Yuret
Conference on Empirical Methods in Natural…
2007
Corpus ID: 1585700
The Conference on Computational Natural Language Learning features a shared task, in which participants train and test their…
Expand
Highly Cited
2005
Highly Cited
2005
Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking
Eugene Charniak
,
Mark Johnson
Annual Meeting of the Association for…
2005
Corpus ID: 11599080
Discriminative reranking is one method for constructing high-performance statistical parsers (Collins, 2000). A discriminative…
Expand
Highly Cited
2004
Highly Cited
2004
Project Lachesis: Parsing and Modeling Location Histories
Ramaswamy Hariharan
,
K. Toyama
International Conference Geographic Information…
2004
Corpus ID: 15319533
A datatype with increasing importance in GIS is what we call the location history–a record of an entity’s location in…
Expand
Highly Cited
2001
Highly Cited
2001
Generating robust parsers using island grammars
L. Moonen
Proceedings Eighth Working Conference on Reverse…
2001
Corpus ID: 5456487
Source model extraction, the automated extraction of information from system artifacts, is a common phase in reverse engineering…
Expand
Highly Cited
2000
Highly Cited
2000
Discriminative Reranking for Natural Language Parsing
M. Collins
,
Terry Koo
International Conference on Computational Logic
2000
Corpus ID: 405878
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of…
Expand
Highly Cited
1997
Highly Cited
1997
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
Dekai Wu
International Conference on Computational Logic
1997
Corpus ID: 912349
We introduce (1) a novel stochastic inversion transduction grammar formalism for bilingual language modeling of sentence-pairs…
Expand
Highly Cited
1996
Highly Cited
1996
Partial parsing via finite-state cascades
Steven P. Abney
Natural Language Engineering
1996
Corpus ID: 1127776
Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by…
Expand
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