Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /

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.

Saved in:
Bibliographic Details
Main Authors: Sikkel, Klaas. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1997
Subjects:Computer science., Programming languages (Electronic computers)., Algorithms., Artificial intelligence., Computer Science., Algorithm Analysis and Problem Complexity., Programming Languages, Compilers, Interpreters., Artificial Intelligence (incl. Robotics).,
Online Access:http://dx.doi.org/10.1007/978-3-642-60541-3
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:180042
record_format koha
spelling KOHA-OAI-TEST:1800422018-07-30T22:59:51ZParsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms / Sikkel, Klaas. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1997.engParsing, 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.Foreword -- Acknowledgements -- I. Exposition -- 1. Introduction -- 2. The primordial soup framework -- II. Foundation -- 3. Tree-based parsing schemata -- 4. Item-based parsing schemata -- 5. Refinement and generalization -- 6. Filtering -- III. Application -- 7. An introduction to unification grammars -- 8. Parsing schemata for unification grammars -- 9. Topics in unification grammar parsing -- 10. Left-Corner chart parsing -- 11. Head-Corner chart parsing -- 12. Generalized LR parsing -- 13. Parallel Bottom-up Tomita parsing -- 14. Boolean circuit parsing -- 15. Conclusions.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.Computer science.Programming languages (Electronic computers).Algorithms.Artificial intelligence.Computer Science.Algorithm Analysis and Problem Complexity.Programming Languages, Compilers, Interpreters.Artificial Intelligence (incl. Robotics).Springer eBookshttp://dx.doi.org/10.1007/978-3-642-60541-3URN:ISBN:9783642605413
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Programming languages (Electronic computers).
Algorithms.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
Computer science.
Programming languages (Electronic computers).
Algorithms.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
spellingShingle Computer science.
Programming languages (Electronic computers).
Algorithms.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
Computer science.
Programming languages (Electronic computers).
Algorithms.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
Sikkel, Klaas. author.
SpringerLink (Online service)
Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
description 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.
format Texto
topic_facet Computer science.
Programming languages (Electronic computers).
Algorithms.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
author Sikkel, Klaas. author.
SpringerLink (Online service)
author_facet Sikkel, Klaas. author.
SpringerLink (Online service)
author_sort Sikkel, Klaas. author.
title Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
title_short Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
title_full Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
title_fullStr Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
title_full_unstemmed Parsing Schemata [electronic resource] : A Framework for Specification and Analysis of Parsing Algorithms /
title_sort parsing schemata [electronic resource] : a framework for specification and analysis of parsing algorithms /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 1997
url http://dx.doi.org/10.1007/978-3-642-60541-3
work_keys_str_mv AT sikkelklaasauthor parsingschemataelectronicresourceaframeworkforspecificationandanalysisofparsingalgorithms
AT springerlinkonlineservice parsingschemataelectronicresourceaframeworkforspecificationandanalysisofparsingalgorithms
_version_ 1756264631738826752