Parsing Algorithm
Related Papers
Dynamic Strategy Selection in Flexible Parsing
Robust natural language interpretation requires strong semantic domain models, "fall-soff" recovery heuristics, and very flexible control structures. Although single-strategy parsers have met with a measure of success, a multi.strategy approach …...
Sentence Disambiguation by a Shift-Reduce Parsing Technique
Artificial Intelligence Center SRI International 333 Ravenswood Avenue Menlo Park, CA 94025 Native speakers of English show definite and consistent preferences for certain readings of syntactically ambiguous sen- tences. A …...
Temporal Inferences in Medical Texts
The objectives of this paper are twofold, whereby the computer program is meant to be a particular implementation of a general natural Language [NL] proeessin~ system [NI,PSI which could be …...
Linguistic Processing Using a Dependency Structure Grammar for Speech Recognition and Understanding
This paper proposes an efficient linguistic processing strategy for speech recognition and understanding using a dependency structure grammar. The strategy includes parsing and phrase prediction algorithms. After speech processing and …...
Parsing the Voyager Domain Using Pearl
This paper* describes a .al, ural language p~rsi.g algorithm &)r un- resu'icl,ed I,ext which uses a probabilhq-hased scoring funct,iow I,o se- le(:l, I,he "besC: parse of ~/ sent,enos acc:ording t,c~ …...
An Alternative Conception of Tree-Adjoining Derivation
The precise formulation of derivation for tree- adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language …...
Another Facet of LIG Parsing
In this paper 1 we present a new pars- ing algorithm for linear indexed grammars (LIGs) in the same spirit as the one de- scribed in (Vijay-Shanker and Weir, 1993) …...
Three New Probabilistic Models for Dependency Parsing: An Exploration
Alter presenting a novel O(n a) parsing al- gorithm for dependency grammar, we de- velop three contrasting ways to stochasticize it. We propose (a) a lexical atfinity mode] where words …...
Parsing the WSJ Using CCG and Log-Linear Models
This paper describes and evaluates log-linear parsing models for Combinatory Categorial Grammar (CCG). A parallel implementation of the L-BFGS optimisation algorithm is described, which runs on a Beowulf cluster allowing …...
Efficiently Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polyno- mial time for a more general fragment of the Lambek calculus than any previously known algorithm. The …...
Incremental Parsing with Parallel Multiple Context-Free Grammars
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has …...
Ukwabelana - An open-source morphological Zulu corpus
Zulu is an indigenous language of South Africa, and one of the eleven official languages of that country. It is spoken by about 11 million speakers. Although it is similar …...