Results 1  10
of
651,681
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 794 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Statistical Parsing with a Contextfree Grammar and Word Statistics
, 1997
"... We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence. This model is used in a parsing system by finding the parse for the sentence with the highest probability. This system outperforms previou ..."
Abstract

Cited by 410 (18 self)
 Add to MetaCart
We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence. This model is used in a parsing system by finding the parse for the sentence with the highest probability. This system outperforms
DivideandConquer Parsing for Parallelism and Laziness
"... Today is the era of web applications. Google alone has brought us Gmail, Google Maps, Google Docs, and Google Calendar, all wildly popular. Similar offerings exist from Yahoo, Microsoft, Apple, Zoho, and a host of other software vendors. And of course we ..."
Abstract
 Add to MetaCart
Today is the era of web applications. Google alone has brought us Gmail, Google Maps, Google Docs, and Google Calendar, all wildly popular. Similar offerings exist from Yahoo, Microsoft, Apple, Zoho, and a host of other software vendors. And of course we
Accurate Unlexicalized Parsing
 IN PROCEEDINGS OF THE 41ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 2003
"... We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar. Indeed, its ..."
Abstract

Cited by 1026 (70 self)
 Add to MetaCart
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar. Indeed, its
A DivideandConquer Strategy for Shallow Parsing of German Free Texts
 In Proceedings of ANLP2000
, 2000
"... We present a divideandconquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sentence (i.e., verb groups, subclauses) are determined. In a second phase the phrased grammars are applied to the contents of ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We present a divideandconquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sentence (i.e., verb groups, subclauses) are determined. In a second phase the phrased grammars are applied to the contents
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 contextfree gram mar. We then extend the model to in clude a probabilistic treatment of both subcategorisation and wh~movement. Results on Wall Street Journal text show that the parse ..."
Abstract

Cited by 567 (8 self)
 Add to MetaCart
In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised contextfree gram mar. We then extend the model to in clude a probabilistic treatment of both subcategorisation and wh~movement. Results on Wall Street Journal text show
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
Parsing of ContextFree Languages
 In: Rozenberg G., Salomaa A. (Eds), Handbook of Formal Languages
, 1997
"... Parsing is the process of assigning structure to sentences. The structure is obtained from the grammatical description of the language. Both in Computer Science and in Computational Linguistics, contextfree grammars and associated parsing algorithms are among the most useful tools. Numerous parsing ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
Parsing is the process of assigning structure to sentences. The structure is obtained from the grammatical description of the language. Both in Computer Science and in Computational Linguistics, contextfree grammars and associated parsing algorithms are among the most useful tools. Numerous
Results 1  10
of
651,681