Vaughan R. Pratt  Home/Search
Context Related
| stanford.edu/pub/lingol75.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/pub/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: LINGOL is a linguistics oriented programming language. We describe briefly work in progress on a large-scale LINGOL program designed to demonstrate the value of LINGOL as a research tool in the writing of natural language programs. Attention is then focused on the parsing algorithm used in LINGOL. It is shown that for the class of interpretive context-free parsers that do no backing up or lookahead, the algorithm is optimal with respect to discovery of phrases in that no phrase is discovered... (Update)
Context of citations to this paper: More
...such that the right hand sides of rules have a length at most equal to 2. This generalizes simplifies the use of Chomsky Normal Form [Pra 75] or 2 form [She 76] Such a transformation amounts effectively to allowing two forest nodes to share a common sublist of their...
.... description of LC parsing can be found in [8] A number of sophisticated algorithms has been derived from LC parsing, see amongst others [2, 9, 4]. Since LC parsing uses a pushdown stack, we want to find a recursive formulation. The result is shown in Figure 3. The pushdown...
Cited by: More
Generalized Left-Corner Parsing - Nederhof (1993) (Correct)
Parsing With Logical Variables - Timothy Finin And (Correct)
Parsing Incomplete Sentences - Bernard Lang Inria (1988) (Correct)
Similar documents based on text: More All
0.4: Efficient Implementation of Bit-vector Operations in Common Lisp - Baker (1990) (Correct)
0.1: An optimized parsing algorithm well suited to RNA folding - Lefebvre (1995) (Correct)
0.1: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
Related documents from co-citation: More All
4: The Theory of Parsing (context) - Aho, Ullman - 1972
4: Algorithm schemata and data structures in syntactic processing (context) - Kay - 1986
4: Efficient Parsing Algorithms for General Context-Free Grammars (context) - Bouckaert, Pirotte et al. - 1975
BibTeX entry: (Update)
Pratt, V.R. (1975) LINGOL --- A Progress Report. Proc. 4th Int. Joint Conf. on Artificial Intelligence (IJCAI'75 ), 422--428. http://citeseer.ist.psu.edu/pratt75lingol.html More
@misc{ pratt75lingol,
author = "V. Pratt",
title = "LINGOL --- A Progress Report",
text = "Pratt, V.R. (1975) LINGOL --- A Progress Report. Proc. 4th Int. Joint Conf.
on Artificial Intelligence (IJCAI'75 ), 422--428.",
year = "1975",
url = "citeseer.ist.psu.edu/pratt75lingol.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://boole.stanford.edu/pub/): More
Well-behaved Flow Event Structures for Parallel Composition .. - van Glabbeek, Goltz (Correct)
Token-controlled place refinement in hierarchical Petri.. - Stork, van Glabbeek (Correct)
Satisfiability of Inequalities in a Poset - Pratt, Tiuryn (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC