Parsing Schemata For Practical Text AnalysisWorld Scientific, 2010/06/17 - 292 ページ The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that contains the basic notions needed to understand the rest of the parts. Thus, this compendium can be used as an introduction to natural language parsing, allowing postgraduate students not only to get a solid grasp of the fundamental concepts underlying parsing algorithms, but also an understanding of the latest developments and challenges in the field.Researchers in computational linguistics will find novel results where parsing schemata are applied to current problems that are being actively researched in the computational linguistics community (like dependency parsing, robust parsing, or the treatment of non-projective linguistics phenomena). This book not only explains these results in a more detailed, comprehensive and self-contained way, and highlights the relations between them, but also includes new contributions that have not been presented. |
他の版 - すべて表示
多く使われている語句
ˆo(T,a h applying approximate tree Association for Computational binarisation Chapter Combiner steps compiler complete Computational Linguistics consequent item constituency constraints context-free context-free grammars context-free languages correct final items corresponding D-rules deduction steps deduction system defined definition dependency graph dependency structures described distance Earley Earley parser Eisner element elementary trees error-repair parsers error-repair parsing schema example feature structures formalism function gap degree Gómez-Rodr´ıguez grammar G hypothesis implementation indexes Initter input sentence input string instantiated parsing system item set Left-Corner Lemma Link Grammar marked parse tree marked terminals mildly ill-nested Morristown natural language Nivre node labelled non-projective dependency nonterminal notation obtained parse tree parsing algorithms parsing schemata partial dependency tree prove pseudocode R-Link schema Sikkel step set subtrees symbol T'Lyon TAG parsers terminal symbols transformation tree-adjoining grammars treebanks Trees(G valid items valid tree variant well-nested word yield union step