%0 
%0 Conference Proceedings
%A Miyao, Yusuke; Sagae, Kenji & Tsujii, Jun'ichi
%D 2007
%T Towards Framework-Independent Evaluation of Deep Linguistic Parsers
%E Copestake, Ann
%B Proceedings of the GEAF 2007 Workshop
%C 
%I CSLI Publications
%V 
%6
%N 
%P 21 pages
%& 
%Y 
%S CSLI Studies in Computational Linguistics Online
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Miyao:2007
%K parsers evaluation
%X This paper describes practical issues in the framework-independent evaluation of deep and shallow parsers. We focus on the use of two dependency-based syntactic representation formats in parser evaluation, namely, Carroll et al. (1998)'s Grammatical Relations and de Marneffe et al. (2006)'s Stanford Dependency scheme. Our approach is to convert the output of parsers into these two formats, and measure the accuracy of the resulting converted output. Through the evaluation of an HPSG parser and Penn Treebank phrase structure parsers, we found that mapping between different representation schemes is a non-trivial task that results in lossy conversions that may obscure important differences between different parsing approaches. We discuss sources of disagreements in the representation of syntactic structures in the two dependency-based formats, indicating possible directions for improved framework-independent parser evaluation.
%Z 
%U http://www.cs.cmu.edu/~sagae/docs/geaf07miyaoetal.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Sagae, Kenji; Miyao, Yusuke & Tsujii, Jun'ichi
%D 2007
%T HPSG Parsing with Shallow Dependency Constraints
%E 
%B Proc. ACL 2007
%C 
%I 
%V 
%6
%N 
%P 624-631
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Sagae:2007
%K HPSG parsers
%X We present a novel framework that combines strengths from surface syntactic parsing and deep syntactic parsing to increase deep parsing accuracy, specifically by combining dependency and HPSG parsing. We show that by using surface dependencies to constrain the application of wide-coverage HPSG rules, we can benefit from a number of parsing techniques designed for high-accuracy dependency parsing, while actually performing deep syntactic analysis. Our framework results in a 1.4% absolute improvement over a state-of-the-art approach for wide coverage HPSG parsing.
%Z 
%U http://www-tsujii.is.s.u-tokyo.ac.jp/enju/
%+
%^

%0 
%0 Conference Proceedings
%A de Marneffe, Marie-Catherine; MacCartney, Bill & Manning, Christopher D.
%D 2006
%T Generating Typed Dependency Parses from Phrase Structure Trees
%E 
%B LREC
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 literature-log.bib 1/21/2009
%3 inproceedings
%4 
%# 
%$ 
%F Marneffe:2006
%K dependencies constituency parsers
%X 
%Z 
%U http://nlp.stanford.edu/pubs/LREC06_dependencies.pdf
%+
%^

%0 
%0 Journal Article
%A Pyysalo, Sampo; Ginter, Filip; Pahikkala, Tapio; Boberg, Jorma; Jarvinen, Jouni & Salakoski, Tapio
%D 2006
%T Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions
%E 
%B International Journal of Medical Informatics
%C 
%I 
%V 75
%6
%N 6
%P 430--442
%& 
%Y 
%S 
%7
%8 June
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F Pyysalo:2006
%K parsers biomedicine evaluation
%X We present an evaluation of Link Grammar and Connexor Machinese Syntax, two major broad-coverage dependency parsers, on a custom hand-annotated corpus consisting of sentences regarding protein-protein interactions. In the evaluation, we apply the notion of an interaction subgraph, which is the subgraph of a dependency graph expressing a protein-protein interaction. We measure the performance of the parsers for recovery of individual dependencies, fully correct parses, and interaction subgraphs. For Link Grammar, an open system that can be inspected in detail, we further perform a comprehensive failure analysis, report specific causes of error, and suggest potential modifications to the grammar. We find that both parsers perform worse on biomedical English than previously reported on general English. While Connexor Machinese Syntax significantly outperforms Link Grammar, the failure analysis suggests specific ways in which the latter could be modified for better performance in the domain.
%Z 
%U http://dx.doi.org/10.1016/j.ijmedinf.2005.06.009
%+
%^

%0 
%0 Conference Proceedings
%A Miyao, Yusuke; Ninomiya, Takashi & Tsujii, Jun'ichi
%D 2004
%T Corpus-oriented Grammar Development for Acquiring a Head-driven Phrase Structure Grammar from the Penn Treebank
%E 
%B Proceedings of IJCNLP-04
%C 8 pages
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Miyao:2004
%K HPSG parsers
%X This paper describes a method of semi-automatically acquiring an English HPSG grammar from the Penn Treebank. First, heuristic rules are employed to annotate the treebank with partially-specified derivation trees. Lexical entries are automatically extracted from the annotated corpus by inversely applying schemata to partially-specified derivation trees.
%Z 
%U http://www-tsujii.is.s.u-tokyo.ac.jp/~yusuke/paper/ijcnlp04.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Moll\'a,, Diego & Hutchinson, Ben
%D 2003
%T Intrinsic versus Extrinsic Evaluations of Parsing Systems
%E 
%B Proc. European Association for Computational Linguistics (EACL), workshop on Evaluation Initiatives in Natural Language Processing
%C Budapest
%I ACL
%V 
%6
%N 
%P 43-50
%& 
%Y Association for Computational Linguistics
%S 
%7
%8 April
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Moll'a:2003b
%K parsers evaluation AnswerFinder gram_rels molla_publication
%X A wide range of parser and/or grammar evaluation methods have been reported in the literature. However, in most cases these evaluations take the parsers independently (intrinsic evaluations), and only in a few cases has the effect of different parsers in real applications been measured (extrinsic evaluations). This paper compares two evaluations of the Link Grammar parser and the Conexor Functional Dependency Grammar parser. The parsing systems, despite both being dependency-based, return different types of dependencies, making a direct comparison impossible. In the intrinsic evaluation, the accuracy of the parsers is compared independently by converting the dependencies into grammatical relations and using the methodology of \newcite{Carroll:1998} for parser comparison. In the extrinsic evaluation, the parsers' impact in a practical application is compared within the context of answer extraction. The differences in the results are significant.
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Schneider, Gerold
%D 2003
%T Extracting and Using Trace-Free Functional Dependencies from the Penn Treebank to Reduce Parsing Complexity
%E 
%B Proc. Workshop on Treebanks and Linguistic Theories (TLT 2003)
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Schneider:2003
%K dependencies parsers
%X Many extensions to text-based, data-intensive knowledge management approaches, such as Information Retrieval or Data Mining, focus on integrating the impressive recent advances in language technology. For this, they need fast, robust parsers that deliver linguistic data which is meaningful for the subsequent processing stages. This paper introduces such a parsing system. Its output is a hierarchical structure of syntactic relations, functional dependency structures ...
%Z 
%U http://w3.msi.vxu.se/\~{}rics/TLT2003/
%+
%^

%0 
%0 Manuscript
%A Moll\'a,, Diego & Hutchinson, Ben
%D 2002
%T In Vitro and In Vivo Evaluations of Parsing Systems Within the Context of Answer Extraction
%E
%B 
%C
%I
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 unpublished
%4 
%# 
%$ 
%F Molla:anlp02:preparation
%K AnswerFinder parsers evaluation gram_rels molla_publication
%X A wide variety of parser and/or grammar evaluation methods have been reported in the literature. However, in most cases these evaluations take the parsers independently (\emph{in vitro} evaluations), and only in a few cases has the effect of different parsers in real applications been measured (\emph{in vivo} evaluations). This paper compares two evaluations of the Link Grammar parser and the Conexor Functional Dependency Grammar parser. The parsing systems, despite both being dependency-based, return different types of dependencies, making a direct comparison impossible. In the first evaluation, the accuracy of the parsers is compared \emph{in vitro} by converting the dependencies into grammatical relations and using the methodology of \newcite{Carroll:1998} for parser comparison. In the second evaluation, the parsers' impact in a practical application is compared \emph{in vivo} within the context of answer extraction. The differences in the results are significant and raise questions on the usefulness of purely \emph{in vitro} evaluations.
%Z In preparation
%U 
%+
%^

%0 
%0 Report
%A Oy, Conexor
%D 2002
%T Conexor Functional Dependency Grammar 3.7 --- User's Manual
%E 
%B 
%C 
%I Conexor Oy
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9 
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 techreport
%4 
%# 
%$ 
%F Conexor:2002
%K parsers DG
%X 
%Z 
%U 
%+
%^

%0 
%0 Thesis
%A Scarlett, Elizabeth
%D 2000
%T An Evaluation of a Rule-Based Parser of English Sentences
%E 
%B 
%C 
%I University of Ottawa
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9 
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 mastersthesis
%4 
%# 
%$ 
%F Scarlett:2000:2
%K parsers evaluation
%X ... The thesis argues that a test suite for a broad coverage natural language parser must necessarily be systematic, broad in its coverage of phenomena tested, and corpus-like in its coverage of phenomenon interaction. A test suite of example sentences extracted from Quirk et al.'s comprehensive English grammar is proposed, and the results of evaluating DIPETT on that suite are compared with the evaluation results on a publicly available test suite, TSNLP (Test Suites for Natural Language Processing).
%Z 
%U http://www.site.uottawa.ca/\~{}scarlett/
%+
%^

%0 
%0 Conference Proceedings
%A Scarlett, Elizabeth & Szpkowicz, Stan
%D 2000
%T The Power of the TSNLP: Lessons from a Diagnostic Evaluation of a Broad-Coverage Parser
%E 
%B Proc. Thirteenth Canadian Conference on Artificial Intelligence
%C Montreal
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Scarlett:2000
%K parsers evaluation
%X We show a diagnostic evaluation of DIPETT, a broad-coverage parser of English sentences. We consider the TSNLP suite as a diagnostic tool, and propose an alternative broader-coverage test suite of test sentences extracted from Quirk et al. We compare the diagnostic effectiveness of the two suites, and draw a few general conclusions. The evaluation results were used to make significant improvements to DIPETT.
%Z 
%U http://www.site.uottawa.ca/\~{}scarlett/
%+
%^

%0 
%0 Conference Proceedings
%A Henderson, John C. & Brill, Eric
%D 1999
%T Exploiting Diversity in Natural Language Processing: Combining Parsers
%E 
%B Proc. EMNLP-99
%C College Park, Maryland
%I 
%V 
%6
%N 
%P 187-194
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Henderson:1999
%K parsers
%X Three state-of-the-art statistical parsers are combined to produce more accurate parses, as well as new bounds on achievable Treebank parsing accuracy. Two general approaches are presented and two combination techniques are described for each approach. Both parametric and non-parametric models are explored. The resulting parsers surpass the best previously published performance results for the Penn Treebank.
%Z Also in arXiv:cs.CL/0006003
%U http://xxx.lanl.gov/abs/cs.CL/0006003
%+
%^

%0 
%0 Conference Proceedings
%A Roark, Brian & Johnson, Mark
%D 1999
%T Efficient Probabilistic Top-down and Left-corner Parsing
%E 
%B Proc. ACL'99
%C 
%I 
%V 
%6
%N 
%P 421-428
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Roark:1999
%K parsers statistic_nlp
%X This paper examines efficient predictive broad-coverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic interpretation can in principle be read. We contrast two predictive parsing approaches, top-down and left-corner parsing, and find both to be viable. In addition, we find that enhancement with non-local information not only improves parser accuracy, but also substantially improves the search efficiency.
%Z \myurl{http://arXiv.org/abs/cs/0008017}
%U http://arXiv.org/abs/cs/0008017
%+
%^

%0 
%0 Conference Proceedings
%A J\"a,rvinen, Timo & Tapanainen, Pasi
%D 1998
%T Towards an Implementable Dependency Grammar
%E 
%B Proc. of COLING-ACL. Workshop: Processing of Dependency Grammars
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Jaervinen:1998
%K DG parsers
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Lin, Dekang
%D 1998
%T Dependency-based Evaluation of MINIPAR
%E 
%B Proc. Workshop on the Evaluation of Parsing Systems
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S Granada
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Lin:1998
%K parsers DG
%X 
%Z 
%U 
%+
%^

%0 
%0 Generic
%A Schneider, Gerold
%D 1998
%T Functional Non-Projective Parsing with Dependency Grammar (DG)
%E
%B 
%C
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 Nov
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 misc
%4 
%# 
%$ 
%F Schneider:Nov:1998
%K DG parsers
%X 
%Z 
%U 
%+
%^

%0 
%0 Report
%A J\"a,rvinen, Timo & Tapanainen, Pasi
%D 1997
%T A Dependency Parser for English
%E 
%B 
%C Helsinki
%I Department of Linguistics, University of Helsinki
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9 
%? 
%! 
%Z 
%@ TR-1
%(
%)
%*
%L
%M
%1 
%2 
%3 techreport
%4 
%# 
%$ 
%F Jaervinen:1997
%K DG parsers
%X 
%Z 
%U http://www.ling.helsinki.fi/\~{}tapanain/dg/doc/TR-1/
%+
%^

%0 
%0 Conference Proceedings
%A Tapanainen, Pasi & J\"a,rvinen, Timo
%D 1997
%T A Non-Projective Dependency Parser
%E 
%B Proc. ANLP-97
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y ACL
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Tapanainen:1997
%K DG parsers
%X 
%Z 
%U http://www.conexor.fi/anlp97/anlp97.html
%+
%^

%0 
%0 Conference Proceedings
%A Kay, Martin
%D 1996
%T Chart Generation
%E 
%B Proc. 34th Annual Meeting of the {ACL}
%C Santa Cruz, CA
%I 
%V 
%6
%N 
%P 200-204
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Kay:1996
%K parsers flat_semantics generation
%X Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures are taken to curtail generation paths containing semantically incomplete phrases.
%Z 
%U 
%+
%^

%0 
%0 Journal Article
%A Tomita, Masaru
%D 1987
%T An Efficient Augmented-Context-Free Parsing Algorithm
%E 
%B Computational Linguistics
%C 
%I 
%V 12
%6
%N 1-2
%P 31-46
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F Tomita:1987
%K parsers
%X 
%Z 
%U 
%+
%^