Анализ диаграмм
Related Papers
Parsing as Deduction
By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is …...
A Comparison of Rule-Invocation Strategies in Context-Free Chart Parsing
Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a back- bone, e.g. LFG and PATR-II. Typically the pro- cessing of these formalisms is …...
Graph-structured Stack and Natural Language Parsing
A general device for handling nondeterminism in stack operations is described. The device, called a Graph-structured Stack, can eliminate duplication of operations throughout the nondeterministic processes. This paper then applies …...
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language ana- lyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by …...
Generalized Left-Corner Parsing
We show how techniques known from gen- erMized LR parsing can be applied to left- corner parsing. The ~esulting parsing algo- rithm for context-free grammars has some advantages over generalized …...
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graph- theoretic properties. Connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension …...
Emergent Parsing and Generation with Generalized Chart
A new, flexible inference method for Horn logic pro- gram is proposed. It is also a drastic gencndization of chart I)aming, partial instaatiation of clauses in a pro- gram ronghly …...
Yet Another Chart-Based Technique for Parsing Ill-Formed Input
A new chart-based technique for parsing ill-formed input is proposed. This can process sentences with unknown/misspelled words, omitted words or extraneous words. This generalized parsing strategy is, similar to Mellish's, …...
A Compilation-Chart Method for Linear Categorial Deduction
Recent, work in ca.t;eg(Mj gr;mmt;~r has seen proposals for a wide. r;Lltg(~ O[ sys-. t;(;i[IS, differing in their 'resomx:e sensi- tivil;y' and hence, implicitly, {;heir under.. lying nol;ion of qinguisl;ie …...
Efficient Tabular LR Parsing
We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is con- ceptually more attractive …...
A Chart-Parsing Algorithm for Efficient Semantic Analysis
In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequences of uninflected semantic units like …...
CTEMP: A Chinese Temporal Parser for Extracting and Normalizing Temporal Information
. Temporal information is useful in many NLP applications, such as information extraction, question answering and summarization. In this paper, we present a temporal parser for extracting and normalizing temporal …...
Joshua: An Open Source Toolkit for Parsing-Based Machine Translation
We describe Joshua, an open source toolkit for statistical machine transla- tion. Joshua implements all of the algo- rithms required for synchronous context free grammars (SCFGs): chart-parsing, n- gram language …...
Learning Linear Ordering Problems for Better Translation
We apply machine learning to the Lin- ear Ordering Problem in order to learn sentence-specific reordering models for machine translation. We demonstrate that even when these models are used as …...
Treebank Grammar Techniques for Non-Projective Dependency Parsing
An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly context- sensitive grammar …...