Natural language parsing as statistical pattern recognition
Natural language parsing as statistical pattern recognition
A Maximum-Entropy-Inspired Parser
A Maximum-Entropy-Inspired Parser
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
PCFG models of linguistic tree representations
Computational Linguistics
Stochastic attribute-value grammars
Computational Linguistics
Direct and underspecified interpretations of LFG f-structures
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
A simple pattern-matching algorithm for recovering empty nodes and their antecedents
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Parsing with generative models of predicate-argument structure
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
The Comlex Syntax project: the first year
HLT '94 Proceedings of the workshop on Human Language Technology
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
Large-scale induction and evaluation of lexical resources from the Penn-II treebank
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Large-Scale Induction and Evaluation of Lexical Resources from the Penn-II and Penn-III Treebanks
Computational Linguistics
Large-scale induction and evaluation of lexical resources from the Penn-II treebank
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Pseudo-projective dependency parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
QuestionBank: creating a corpus of parse-annotated questions
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Robust PCFG-based generation using automatically acquired LFG approximations
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Partial training for a lexicalized-grammar parser
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Using machine-learning to assign function labels to parser output for Spanish
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Evaluating machine translation with LFG dependencies
Machine Translation
Applying computational models of spatial prepositions to visually situated dialog
Computational Linguistics
Dependency-based n-gram models for general purpose sentence realisation
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Large scale production of syntactic annotations to move forward
CrossParser '08 Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
NAACL-Short '07 Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers
Improving the efficiency of a wide-coverage CCG parser
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Symbolic preference using simple scoring
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
A robust and hybrid deep-linguistic theory applied to large-scale parsing
ROMAND '04 Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data
Automatic treebank-based acquisition of Arabic LFG dependency structures
Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
Dependency-based automatic evaluation for machine translation
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Labelled dependencies in machine translation evaluation
StatMT '07 Proceedings of the Second Workshop on Statistical Machine Translation
Computing translation units and quantifying parallelism in parallel dependency treebanks
LAW '07 Proceedings of the Linguistic Annotation Workshop
DEPEVAL(summ): dependency-based evaluation for automatic summaries
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Construction of a German HPSG grammar from a detailed treebank
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
Cross parser evaluation and tagset variation: a French treebank study
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Unbounded dependency recovery for parser evaluation
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
Parser-based retraining for domain adaptation of probabilistic generators
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
Hard constraints for grammatical function labelling
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
The DCU dependency-based metric in WMT-MetricsMATR 2010
WMT '10 Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR
Evaluation of dependency parsers on unbounded dependencies
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Chasing the ghost: recovering empty categories in the Chinese treebank
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Dependency-based n-gram models for general purpose sentence realisation
Natural Language Engineering
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Large-scale corpus-driven PCFG approximation of an HPSG
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
A clause-level hybrid approach to Chinese empty element recovery
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional Grammar (LFG) resources acquired from treebanks. We extract LFG subcategorisation frames and paths linking LDD reentrancies from f-structures generated automatically for the Penn-II treebank trees and use them in an LDD resolution algorithm to parse new text. Unlike (Collins, 1999; Johnson, 2000), in our approach resolution of LDDs is done at f-structure (attribute-value structure representations of basic predicate-argument or dependency structure) without empty productions, traces and coindexation in CFG parse trees. Currently our best automatically induced grammars achieve 80.97% f-score for f-structures parsing section 23 of the WSJ part of the Penn-II treebank and evaluating against the DCU 1051 and 80.24% against the PARC 700 Dependency Bank (King et al., 2003), performing at the same or a slightly better level than state-of-the-art hand-crafted grammars (Kaplan et al., 2004).