Results 51 to 60 of about 84,961 (134)

Uniform Representations for Syntax-Semantics Arbitration [PDF]

, 1994
Psychological investigations have led to considerable insight into the working of the human language comprehension system. In this article, we look at a set of principles derived from psychological findings to argue for a particular organization of ...
Eiselt, Kurt P., Mahesh, Kavi
core   +2 more sources

Robust Incremental Neural Semantic Graph Parsing

, 2017
Parsing sentences to linguistically-expressive semantic representations is a key goal of Natural Language Processing. Yet statistical parsing has focused almost exclusively on bilexical dependencies or domain-specific logical forms.
Blunsom, Phil, Buys, Jan
core   +1 more source

Three Generative, Lexicalised Models for Statistical Parsing

, 1997
In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised context-free grammar. We then extend the model to include a probabilistic treatment of both subcategorisation and wh-movement.
Collins, Michael
core   +5 more sources

Three New Probabilistic Models for Dependency Parsing: An Exploration

, 1997
After presenting a novel O(n^3) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model where words ...
Eisner, Jason
core   +5 more sources

A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

International Journal of Mathematical Models and Methods in Applied Sciences, 2022
The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches: the decision-theoretic approach and the syntactic(structural) approach. In this paper, at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in
openaire   +1 more source

A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

International Journal of Computer Applications, 2013
The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches:the decision-theoretic approach and the syntactic (structural) approach. In this paper,at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in ...
Ali Broumandnia, Mehrnoosh Bazrafkan
openaire   +1 more source

CHR Grammars

, 2004
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility
Christiansen, Henning
core  

A new top-down parsing algorithm for left-recursive DCGs [PDF]

, 1993
In this paper we introduce a new parsing algorithm, called cancellation parsing. Deterministic cancellation parsing with lookahead k can handle the C(k) grammars, which include the LL(k) grammars and are contained in the LC(k) grammars.
openaire   +1 more source

Top-down parsing syntax error recovery.

, 1985
Compiler writers continue to search for a reliable method of syntactic error recovery. Spurious error reports and confusing diagnostics are common problems confronting the programmer. Innumerable error possibilities have made recovery design a frustrating task.
openaire   +1 more source

End-to-end human parsing and detection optimized for resource-constrained devices. [PDF]

Sci Rep
Hosen MI, Aydin T, Islam MB.
europepmc   +1 more source