Parsing Schemata
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)


     0     
5
4
3
2
1



Available


X
About the Book

Parsing, the syntactic analysis of language, has been studied extensively 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 novel perspective. It provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text.

Table of Contents:
Foreword.- Acknowledgements.- I. Exposition.- 1. Introduction.- 1.1 The structure of language.- 1.2 Parsing.- 1.3 Parsing schemata.- 1.4 Overview.- 2. The primordial soup framework.- 2.1 Primordial soup.- 2.2 Restricted versions of the primordial soup.- 2.3 Extensions and related formalisms.- 2.4 From primordial soup to parsing schemata.- II. Foundation.- 3. Tree-based parsing schemata.- 3.1 Context-free grammars.- 3.2 Some small extensions to context-free grammars.- 3.3 Deduction systems.- 3.4 Enhanced deduction systems.- 3.5 Tree-based parsing schemata.- 3.6 Conclusion.- 4. Item-based parsing schemata.- 4.1 Quotient deduction systems.- 4.2 Quotients of enhanced deduction systems.- 4.3 Quotient parsing schemata.- 4.4 Item-based parsing schemata.- 4.5 The relation between Sections 4.3 and 4.4.- 4.6 Examples of parsing schemata.- 4.7 Conclusion.- 5. Refinement and generalization.- 5.1 Mappings between deduction systems.- 5.2 Refinement: a formal approach.- 5.3 Some examples of refinement.- 5.4 Generalization.- 5.5 Conclusion.- 6. Filtering.- 6.1 Redundancy elimination.- 6.2 Static filtering.- 6.3 Dynamic filtering.- 6.4 Step contraction.- 6.5 The family of Earley-like parsing schemata.- 6.6 A summary of relations between parsing schemata.- 6.7 Conclusion.- III. Application.- 7. An introduction to unification grammars.- 7.1 Unification-based parsing schemata: a preview.- 7.2 The example grammar UG1.- 8. Parsing schemata for unification grammars.- 8.1 Feature structures.- 8.2 Feature lattices.- 8.3 Composite feature structures.- 8.4 Composite feature lattices.- 8.5 Unification grammars.- 8.6 Composition of decorated trees.- 8.7 Parsing schemata for unification grammars.- 8.8 The example revisited.- 8.9 Other grammar formalisms.- 8.10 Related approaches.- 8.11 Conclusion.- 9. Topics in unification grammar parsing.- 9.1 Feature graph unification.- 9.2 Nondestructive graph unification.- 9.3 Further improvements.- 9.4 Disjunctive feature structures.- 9.5 Restriction.- 9.6 Default restrictors.- 9.7 Two-pass parsing.- 9.8 Conclusion.- 10. Left-Corner chart parsing.- 10.1 Chart parsers.- 10.2 Left-Corner chart parsing.- 10.3 Correctness of the LC chart parser.- 10.4 An LC chart parser with simplified items.- 10.5 The relation between pLC, sLC, and LC.- 10.6 Conclusion.- 11. Head-Corner chart parsing.- 11.1 Context-free Head Grammars.- 11.2 A predictive Head-Corner chart parser.- 11.3 Correctness of the HC chart parser.- 11.4 HC chart parsing in cubic time.- 11.5 Correctness of sHC.- 11.6 Complexity analysis of sHC.- 11.7 The relation between pHC, sHC, and dVH.- 11.8 HC parsing of unification grammars.- 11.9 Related approaches.- 11.10 Conclusion.- 12. Generalized LR parsing.- 12.1 Preliminaries.- 12.2 LR parsing.- 12.3 Generalized vs. deterministic LR parsing.- 12.4 Tomita's algorithm.- 12.5 A formal definition of Tomita's algorithm.- 12.6 Pros and cons of Tomita's algorithm.- 12.7 An annotated version of Tomita's algorithm.- 12.8 Parsing Schemata for LR(0) and SLR(l).- 12.9 Conclusion.- 13. Parallel Bottom-up Tomita parsing.- 13.1 The PBT parsing schema.- 13.2 A PBT parser.- 13.3 A more efficient PBT parser.- 13.4 The construction of a distributed parse list.- 13.5 A formal definition of the PBT algorithm.- 13.6 Empirical results.- 13.7 Related approaches.- 13.8 Conclusion.- 14. Boolean circuit parsing.- 14.1 Preliminary concepts.- 14.2 Recognizing networks.- 14.3 Parsing networks.- 14.4 Some further issues.- 14.5 Rytter's algorithm.- 14.6 Correctness of Rytter's algorithm.- 14.7 A parsing network for Rytter's algorithm.- 14.8 Conditional parsing systems.- 14.9 Related approaches.- 14.10 Conclusion.- 15. Conclusions.- 15.1 Some general remarks.- 15.2 Research contributions of this book.- 15.6 Ideas for future research.


Best Sellers


Product Details
  • ISBN-13: 9783540616504
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: Annotated edition
  • Language: English
  • Series Title: Texts in Theoretical Computer Science: An EATCS Series
  • Weight: 685 gr
  • ISBN-10: 3540616500
  • Publisher Date: 13 Dec 1996
  • Binding: Hardback
  • Height: 235 mm
  • Returnable: N
  • Sub Title: A Framework for Specification and Analysis of Parsing Algorithms
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms(Texts in Theoretical Computer Science: An EATCS Series)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!