An efficient augmented-context-free parsing algorithm
Computational Linguistics
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Graph-structured Stack and natural language parsing
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
Parsers and printers as stream destructors and constructors embedded in functional languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear-time suffix parsing for deterministic languages
Journal of the ACM (JACM)
Approximately common patterns in shared-forests
Proceedings of the tenth international conference on Information and knowledge management
Approximate VLDC Pattern Matching in Shared-Forest
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Directly-Executable Earley Parsing
CC '01 Proceedings of the 10th International Conference on Compiler Construction
Preprocessing for Unification Parsing of Spoken Language
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
An efficient implementation of the head-corner parser
Computational Linguistics
Computational Linguistics
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Generalized left-corner parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Efficient construction of underspecified semantics under massive ambiguity
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Polynomial time parsing of Combinatory Categorial Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
PRINCIPAR: an efficient, broad-coverage, principle-based parser
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Context-Free grammar rewriting and the transfer of packed linguistic representations
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Chart-parsing techniques and the prediction of valid editing moves in structured document authoring
Proceedings of the 2004 ACM symposium on Document engineering
Interleaved semantic interpretation in environment-based parsing
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
A generative probability model for unification-based grammars
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Parse forest computation of expected governors
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Computational properties of environment-based disambiguation
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Optimal ambiguity packing in context-free parsers with interleaved unification
New developments in parsing technology
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic parsing strategies
Journal of the ACM (JACM)
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An alternative method of training probabilistic LR parsers
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An Experimental Ambiguity Detection Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
A compiler for parsing schemata
Software—Practice & Experience
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
The information-processing difficulty of incremental parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Forest-based translation rule extraction
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Efficiency in unification-based N-best parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Charts, interaction-free grammars, and the compact representation of ambiguity
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Journal of Artificial Intelligence Research
A linguistic investigation into unsupervised DOP
CACLA '07 Proceedings of the Workshop on Cognitive Aspects of Computational Language Acquisition
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
An experimental ambiguity detection tool
Science of Computer Programming
Incremental speech translation
Incremental speech translation
Convolution kernel over packed parse forest
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Dynamic programming for linear-time incremental parsing
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Constituency to dependency translation with forests
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Getting serious about parsing plans: a grammatical analysis of plan recognition
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
A grammar correction algorithm: deep parsing and minimal corrections for a grammar checker
FG'09 Proceedings of the 14th international conference on Formal grammar
Dynamic programming algorithms for transition-based dependency parsers
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Machine translation system combination by confusion forest
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Reestimation of reified rules in semiring parsing and biparsing
SSST-5 Proceedings of the Fifth Workshop on Syntax, Semantics and Structure in Statistical Translation
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
Type-driven automatic quotation of concrete object code in meta programs
RISE'05 Proceedings of the Second international conference on Rapid Integration of Software Engineering Techniques
Improved GLR parsing algorithm
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Exact inference for generative probabilistic non-projective dependency parsing
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
How to build argumental graphs using TAG shared forest: a view from control verbs problematic
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Modular natural language processing using declarative attribute grammars
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
A practical algorithm for intersecting weighted context-free grammars with finite-state automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Training factored PCFGs with expectation propagation
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Compiling declarative specifications of parsing algorithms
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Lfg generation by grammar specialization
Computational Linguistics
Word segmentation, unknown-word resolution, and morphological agreement in a hebrew parsing system
Computational Linguistics
| Hi-index | 0.00 |
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambiguation process that may be based on the finer features of the language. We study the structure of these forests with respect to optimality of sharing, and in relation with the parsing schema used to produce them. In addition to a theoretical and experimental framework for studying these issues, the main results presented are:- sophistication in chart parsing schemata (e.g. use of look-ahed) may reduce time and space efficiency instead of improving it,- there is a shared forest structure with at most cubic size for any CF grammar,- when O(n3) complexity is required, the shape of a shared forest is dependent on the parsing schema used.Though analyzed on CF grammars for simplicity, these results extend to more complex formalisms such as unification based grammars.