Results 1  10
of
134
SLR(1) and LALR(1) Parsing for Unrestricted Grammars
"... Simple LR(1) and lookahead LR(1) phrase structure grammars are defined and corresponding deterministic twopushdown automata which parse all sentences are given. These grammars include a wide variety of grammars for non contextfree languages. A given phrase structure grammar is one of these types i ..."
Abstract
 Add to MetaCart
grammar. This paper extends the wellknown SLR(1) and LALR(1) methods of deterministic bottomup parsing to unrestricted grammars for use in compilers of higher level programming languages. Previous work developing deterministic parsing techniques for various classes of unrestricted grammars has been done
Dynamic Learning Machine Using Unrestricted Grammar
"... Abstract — This paper shows a Dynamic Network Learning for performing unrestricted grammar trained Recurrent Neural Network and proves the relationship between Recurrent Neural Network and Turing machine. Dynamic Network Learning employs bidirectional neural network which has feedback path from the ..."
Abstract
 Add to MetaCart
Abstract — This paper shows a Dynamic Network Learning for performing unrestricted grammar trained Recurrent Neural Network and proves the relationship between Recurrent Neural Network and Turing machine. Dynamic Network Learning employs bidirectional neural network which has feedback path from
Realtime american sign language recognition using desk and wearable computer based video
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998
"... We present two realtime hidden Markov modelbased systems for recognizing sentencelevel continuous American Sign Language (ASL) using a single camera to track the user’s unadorned hands. The first system observes the user from a desk mounted camera and achieves 92 percent word accuracy. The secon ..."
Abstract

Cited by 627 (26 self)
 Add to MetaCart
. The second system mounts the camera in a cap worn by the user and achieves 98 percent accuracy (97 percent with an unrestricted grammar). Both experiments use a 40word lexicon.
A NonProjective Dependency Parser
 In Proceedings of the 5th Conference on Applied Natural Language Processing
, 1997
"... We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of o ..."
Abstract

Cited by 227 (7 self)
 Add to MetaCart
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas
Three studies of grammarbased surface parsing of unrestricted English text
, 1994
"... The dissertation addresses the design of parsing grammars for automatic surfacesyntactic analysis of unconstrained English text. It consists of a summary and three articles. Morphological disambiguation documents a grammar for morphological (or partofspeech) disambiguation of English, done with ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The dissertation addresses the design of parsing grammars for automatic surfacesyntactic analysis of unconstrained English text. It consists of a summary and three articles. Morphological disambiguation documents a grammar for morphological (or partofspeech) disambiguation of English, done
Deriving a probabilistic grammar of semantic markers from unrestricted English text
 In Lucas S (ed) Grammatical Inference: theory, applications, and alternatives, IEE Colloquium Proceedings 1993/092. London, Institute of Electrical Engineers
, 1993
"... This poster describes the derivation of a probabilistic grammar for main subject field codes from the machine readable version of the Longman Dictionary of Contemporary English (LDOCE [ 11). These codes are used in the dictionary to mark the subject area to which a certain sense of a word belongs. T ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
. The grammar consists of the dictionary itself and d matrix that describes how closely two main subject fields are related to each other in a large training corpus of unrestricted English text. This poster summarises work reported in more detail in [2]. Introduction Suppose one is translating the sentence
An Algorithm for Estimating the Parameters of Unrestricted Hidden Stochastic ContextFree Grammars
"... A new algorithm is presented for estimating the pa rameters of a stochastic contextfree grannnar (SCFG) from ordinary unparsed text. Unlike the Inside/Outside I/O) algorithm which requires a gramtnar to be specfled in Chomsky normal form, the new algorithm can estimate an arbitrary SCFG without au ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
auy need for transformation. The algorithm has worstcase cubic complexity in the length of a seutenee and the number of nonterminals in the grammar. Instead of the binary branching tree structure used by the i/O algorithm, the new algorithm makes use of a trellis structure for com putation
An FPGAbased syntactic parser for reallife unrestricted contextfree grammars
, 2001
"... This paper presents an FPGAbased implementation of a syntactic parser that can process languages generated by reallife unrestricted contextfree grammars (CFGs). More precisely, we study the advantages offered by a hardware implementation of a parallel version of a chart parsing algorithm adapted ..."
Abstract
 Add to MetaCart
This paper presents an FPGAbased implementation of a syntactic parser that can process languages generated by reallife unrestricted contextfree grammars (CFGs). More precisely, we study the advantages offered by a hardware implementation of a parallel version of a chart parsing algorithm adapted
Robust Parser for Unrestricted Greek Text
 Proceedings of the 2nd Language Resources and Evaluation Conference
, 2000
"... In this paper we describe a method for the efficient parsing of reallife Greek texts at the surface syntactic level. A grammar consisting of nonrecursive regular expressions describing Greek phrase structure has been compiled into a cascade of finite state transducers used to recognize syntactic c ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper we describe a method for the efficient parsing of reallife Greek texts at the surface syntactic level. A grammar consisting of nonrecursive regular expressions describing Greek phrase structure has been compiled into a cascade of finite state transducers used to recognize syntactic
Underdiagonal Lattice Paths With Unrestricted Steps
 Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science 91
, 1999
"... We use some combinatorial methods to study underdiagonal paths (on the Z 2 lattice) made up of unrestricted steps, i.e., ordered pairs of nonnegative integers. We introduce an algorithm which automatically produces some counting generating functions for a large class of these paths. We also give ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
an example of how we use these functions to obtain some specific information on the number d n;k of paths from the origin to a generic point (n; n \Gamma k): Keywords: underdiagonal lattice paths, paths with unrestricted steps, contextfree grammars, generating functions, Schutzenberger methodology. 1
Results 1  10
of
134