Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[Књига][B] Connectionist-symbolic integration: From unified to hybrid approaches
R Sun, F Alexandre - 2013 - api.taylorfrancis.com
A variety of ideas, approaches, and techniques exist--in terms of both architecture and
learning--and this abundance seems to lead to many exciting possibilities in terms of …
learning--and this abundance seems to lead to many exciting possibilities in terms of …
Encoding labeled graphs by labeling RAAM
A Sperduti - Advances in Neural Information Processing …, 1993 - proceedings.neurips.cc
In this paper we propose an extension to the RAAM by Pollack. This extension, the Labeling
RAAM (LRAAM), can encode la (cid: 173) beled graphs with cycles by representing pointers …
RAAM (LRAAM), can encode la (cid: 173) beled graphs with cycles by representing pointers …
Connectionist natural language parsing
D Palmer-Brown, JA Tepper, HM Powell - Trends in Cognitive Sciences, 2002 - cell.com
The key developments of two decades of connectionist parsing are reviewed. Connectionist
parsers are assessed according to their ability to learn to represent syntactic structures from …
parsers are assessed according to their ability to learn to represent syntactic structures from …
Applying a structured language model to information extraction
C Chelba, M Mahajan - US Patent 8,706,491, 2014 - Google Patents
GIOL I5/04(2013.01) GOL 5/05(2013.01)(57) ABSTRACT G06F 7/20(2006.01) One feature
of the present invention uses the parsing capa G06F 7/28(2006.01) bilities of a structured …
of the present invention uses the parsing capa G06F 7/28(2006.01) bilities of a structured …
[Књига][B] A competitive attachment model for resolving syntactic ambiguities in natural language parsing
SA Stevenson - 1994 - search.proquest.com
Linguistic ambiguity is the greatest obstacle to achieving practical computational systems for
natural language understanding. By contrast, people experience surprisingly little difficulty in …
natural language understanding. By contrast, people experience surprisingly little difficulty in …
Connectionist finite state natural language processing
H Moisl - Connection Science, 1992 - Taylor & Francis
Unless one is prepared to argue that existing,'classical'formal language and automata
theory, together with the natural language linguistics built on them, are fundamentally …
theory, together with the natural language linguistics built on them, are fundamentally …
(S) RAAM: An analytical technique for fast and reliable derivation of connectionist symbol structure representations
RE Callan, D Palmer-Brown - Connection Science, 1997 - Taylor & Francis
Recursive auto-associative memory (RAAM) has become established in the connectionist
literature as a key contribution in the strive to develop connectionist representations of …
literature as a key contribution in the strive to develop connectionist representations of …
How to design a connectionist holistic parser
EKS Ho, LW Chan - Neural Computation, 1999 - direct.mit.edu
Connectionist holistic parsing offers a viable and attractive alternative to traditional
algorithmic parsers. With exposure to a limited subset of grammatical sentences and their …
algorithmic parsers. With exposure to a limited subset of grammatical sentences and their …
A review of statistical language processing techniques
J McMahon, FJ Smith - Artificial Intelligence Review, 1998 - Springer
We present a review of some recently developed techniques in the field of natural language
processing. This area has witnessed a confluence of approaches which are inspired by …
processing. This area has witnessed a confluence of approaches which are inspired by …
A corpus-based connectionist architecture for large-scale natural language parsing
JA Tepper, HM Powell, D Palmer-Brown - Connection Science, 2002 - Taylor & Francis
We describe a deterministic shift-reduce parsing model that combines the advantages of
connectionism with those of traditional symbolic models for parsing realistic sub-domains of …
connectionism with those of traditional symbolic models for parsing realistic sub-domains of …