Mixed Parsing of Tree Insertion and Tree Adjoining Grammars
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Left Corner Parser for Tree Insertion Grammars
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
A prototype of a grammar checker for Czech
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Chart parsing and constraint programming
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Relating tabular parsing algorithms for LIG and TAG
New developments in parsing technology
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Dynamic Programming Algorithms as Products of Weighted Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A compiler for parsing schemata
Software—Practice & Experience
A General Method for Transforming Standard Parsers into Error-Repair Parsers
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Automatic Generation of Natural Language Parsers from Declarative Specifications
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Bidirectional push down automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Generation of indexes for compiling efficient parsers from formal specifications
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Effective parsing using competing CFG rules
TSD'11 Proceedings of the 14th international conference on Text, speech and dialogue
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
How many dots are really needed for head-driven chart parsing?
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Conservative ambiguity detection in context-free grammars
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Compiling declarative specifications of parsing algorithms
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.01 |
From the Publisher:Parsing, the syntactic analysis of language, has been extensively studied in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introduction reviews the theory of parsing from a new perspective. Combining mathematical rigor with high readability, the book emphasizes context-free phrase structure grammar ami how these parsers can be extended to unification formalisms.