New Developments in Parsing Technology

Name: New Developments in Parsing Technology
Price: 163.3 USD
Availability: InStock
ISBN: 9781402022944

ISBN-10: 1402022948

ISBN-13: 9781402022944

Edition: 2004

Authors: Harry Bunt, John Carroll, Giorgio Satta, Satta Giorgio

List price: $169.99

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Buy new: $163.30

Marketplace

2 new & used from $169.17

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

Parsing can be defined as the decomposition of complex structures into their constituent parts, and parsing technology as the methods, the tools, and the software to parse automatically. Parsing is a central area of research in the automatic processing of human language. Parsers are being used in many application areas, for example question answering, extraction of information from text, speech recognition and understanding, and machine translation. New developments in parsing technology are thus widely applicable. This book contains contributions from many of today's leading researchers in the area of natural language parsing technology. The contributors describe their most recent work…

Book details

List price: $169.99
Copyright year: 2004
Publisher: Springer Netherlands
Publication date: 2/15/2005
Binding: Paperback
Pages: 403
Size: 6.10" wide x 9.25" long x 1.00" tall
Weight: 2.838
Language: English

John Olson is an American poet and novelist. Born August 23, 1947 in Minneapolis, Minnesota, Olson has lived for many years in Seattle, Washington. He has published eight collections of poetry and one novel, Souls of Wind, nominated for The Believer Magazine book of the year award. In 2004, Seattle's weekly newspaper, The Stranger, for whom he has written occasional essays, gave Olson one of its annual "genius awards."His writing notebooks have been exhibited at the University of Washington. Olson's prose poetry has been reviewed in print and online poetry magazines he poet Philip Lamantia said that Olson was "extraordinary...the greatest prose poetry [i've] ever read." and Clayton Eshleman…



Preface



Developments in Parsing Technology: From Theory to Application




Introduction



About this book



Parameter Estimation for Statistical Parsing Models: Theory and Practice of Distribution-Free Methods




Introduction



Linear Models



Probabilistic Context-Free Grammars



Statistical Learning Theory



Convergence Bounds for Finite Sets of Hypotheses



Convergence Bounds for Hyperplane Classifiers



Application of Margin Analysis to Parsing



Algorithms



Discussion



Conclusions



High Precision Extraction of Grammatical Relations




Introduction



The Analysis System



Empirical Results



Conclusions and Further Work



Automated Extraction of TAGs from the Penn Treebank




Introduction



Tree Extraction Procedure



Evaluation



Extended Extracted Grammars



Related Work



Conclusions



Computing the Most Probable Parse for a Discontinuous Phrase-Structure Grammar




Introduction



Discontinuous Phrase-Structure Grammar



The Parsing Algorithm



Computing the Most Probable Parse



Experiments



Conclusion and Future Work



A Neural Network Parser that Handles Sparse Data




Introduction



Simple Synchrony Networks



A Probabilistic Parser for SSNs



Estimating the Probabilities with a Simple Synchrony Network



Generalizing from Sparse Data



Conclusion



An Efficient LR Parser Generator for Tree-Adjoining Grammars




TAGS



On Some Degenerate LR Models for TAGS



Proposed Algorithm



Implementation



Example



Some Properties Of the Algorithms



Evaluation



Conclusions



Relating Tabular Parsing Algorithms for LIG and TAG




Introduction



Tree-Adjoining Grammars



Linear Indexed Grammars



Bottom-up Parsing Algorithms



Barley-like Parsing Algorithms



Barley-like Parsing Algorithms Preserving the Correct Prefix Property



Bidirectional Parsing



Specialized TAG parsers



Conclusion



Improved Left-Corner Chart Parsing for Large Context-Free Grammars




Evaluating Parsing Algorithms



Terminology and Notation



Test Grammars



Left-Corner Parsing Algorithms and Refinements



Grammar Transformations



Extracting Parses from the Chart



Comparison to Other Algorithms



Conclusions



On Two Classes of Feature Paths in Large-Scale Unification Grammars




Introduction



Compiling the Quick Check Filter



Generalised Rule Reduction



Conclusion



A Context-Free Superset Approximation of Unification-Based Grammars




Introduction



Basic Inventory



Approximation as Fixpoint Construction



The Basic Algorithm



Implementation Issues and Optimizations



Revisiting the Fixpoint Construction



Three Grammars



Disambiguation of UBGs via Probabilistic Approximations



A Recognizer for Minimalist Languages




Introduction



Minimalist Grammars



Specification of the Recognizer



Correctness



Complexity Results



Conclusions and Future Work



Range Concatenation Grammars




Introduction



Positive Range Concatenation Grammars



Negative Range Concatenation Grammars



A Parsing Algorithm for RCGs



Closure Properties and Modularity



Conclusion



Grammar Induction by MDL-Based Distributional Classification




Introduction



Grammar Induction with the MDL Principle



Induction Strategies



MDL Induction by Dynamic Distributional Classification (DCC)



Comparison and Conclusion


Appendix



Optimal Ambiguity Packing in Context-Free Parsers with Interleaved Unification




Introduction



Ambiguity Packing in Context Free Parsing



The Rule Prioritization Heuristic



Empirical Evaluati