Bernard Lang  Home/Search
Context Related
| coling.unifreiburg....incomplete.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: coling.unifreiburg.de/~n...pnbib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top-down, bottom-up, etc...). 1 Introduction It is often necessary in practical situations to attempt... (Update)
Context of citations to this paper: More
.... [6, 7, 8, 9, 11, 37, 43, 47, 48, 51, 52, 53, 57, 58, 112, 65, 69, 70, 71, 72, 73, 74, 75, 76, 88, 100, 101, 102, 103, 104, 107, 110, 113, 114, 120, 121, 127, 132, 133, 134, 140, 142, 145, 147, 149, 152, 163, 164, 165, 166, 169, 178, 182, 186, 190, 191, 192, 194, 195, 196, 197]...
Cited by: More
Robust Processing for Constraint-Based Grammar Formalisms - Fouvry (2003) (Correct)
Parsing Incomplete Sentences Revisited - Vilares Darriba And (2004) (Correct)
A Formal Frame for Robust Parsing - Vilares Darriba Vilares (2004) (Correct)
Similar documents (at the sentence level):
32.4%: Parsing Incomplete Sentences - Bernard Lang Inria (1988) (Correct)
11.0%: The Structure of Shared Forests in Ambiguous Parsing - Billot, Lang (1989) (Correct)
Active bibliography (related documents): More All
0.6: Towards a Uniform Formal Framework for Parsing - Lang (1991) (Correct)
0.5: Practical Unification-based Parsing of Natural Language - Carroll (1993) (Correct)
0.5: Une Approche Formelle pour la Génération.. - Ferro, Vidal, Gil, Pardo (1995) (Correct)
Similar documents based on text: More All
0.2: A Context-Free Grammar Of French* - Morris Salkoff Unlversit (Correct)
0.1: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
0.1: A Mixed Top-Down and Bottom-Up Deduction Method and its.. - Beckstein, Kim (1989) (Correct)
Related documents from co-citation: More All
6: Parsing Noisy Sentences (context) - Saito, Tomita - 1988
5: An Efficient Context-free Parsing Algorithm (context) - Earley - 1970
5: Deterministic techniques for efficient non-deterministic parsers (context) - Lang - 1974
BibTeX entry: (Update)
B. Lang. Parsing Incomplete Sentences. In Proceedings of 12th International Conference on Computational Linguistics (COLING'88), Budapest, Hungary, 1988. http://citeseer.ist.psu.edu/lang88parsing.html More
@article{ lang88parsing,
author = "Bernard Lang",
title = "Parsing incomplete sentences",
journal = "COLING-88",
pages = "365--371",
year = "1988",
url = "citeseer.ist.psu.edu/lang88parsing.html" }
Citations (may not include all citations):1399 Compilers --- Principles (context) - Aho, Sethi et al. - 1986
192 An Efficient Context-Free Parsing Algorithm (context) - Earley - 1970
78 The Theory of Parsing (context) - Aho, Ullman - 1972
66 Algorithm Schemata and Data Structures in Syntactic Processi.. (context) - Kay - 1980
58 the Translation of Languages from Left to Right (context) - Knuth - 1965
53 Using Restriction to Extend Parsing Algorithms for Complex-F.. - Shieber - 1985
47 The structure of Shared Forests in Ambiguous Parsing - Billot, Lang - 1988
44 Deterministic Techniques for Efficient Non-deterministic Par.. (context) - Lang - 1974
44 An Efficient AugmentedContext -Free Parsing Algorithm - Tomita - 1987
27 An Improved Context-Free Recognizer (context) - Graham, Harrison et al. - 1980
26 General Context-Free Recognition in Less than Cubic Time (context) - Valiant - 1975
17 Programming Languages and Their Compilers (context) - Cocke, Schwartz - 1970
15 An Efficient Word Lattice Parsing Algorithm for Continuous S.. (context) - Tomita - 1986
13 the Asymptotic Complexity of Matrix Multiplication (context) - Coppersmith, Winograd - 1982
10 Datalog Automata (context) - Lang - 1988
8 Efficient Parsing Algorithms for General Context-Free Gramma.. (context) - Bouckaert, Pirotte et al. - 1975
8 Spoken Sentence Recognition by Time-Synchronous Parsing Algo.. (context) - Nakagawa - 1987
8 LINGOL --- A Progress Report - Pratt - 1975
5 Automatic Language-Data Processing (context) - Hays - 1962
5 Simple LR (context) - DeRemer - 1971
5 the Relative Efficiencies of Context-Free Grammar Recognizer.. (context) - Griffiths, Petrick - 1965
3 Complete Evaluation of Horn Clauses (context) - Lang - 1988
3 A Technique for Generating Almost Optimal FloydEvans Product.. (context) - Ichbiah, Morse - 1970
3 Development of a Programming Environment for SETL (context) - Donzeau-Gouge, Dubois et al. - 1987
3 A Simple Efficient Parser for Phrase-Structure Grammars (context) - Phillips - 1986
2 Recognition and Parsing (context) - Younger - 1967
2 A Massively Parallel Network-Based Natural Language Parsing .. (context) - Li, Chun - 1987
1 Analyse Syntaxique Non-D'eterministe (context) - Billot - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.coling.uni-freiburg.de/~neuhaus/papers/pnbib.html): More
Discontinuous Dependency Parsing of Free and Fixed Word Order.. - Covington (1994) (Correct)
Predictive Head-Corner Chart Parsing - Sikkel, den Akker (1993) (Correct)
PARSEC: A Constraint-based Framework for Spoken.. - Zoltowski.. (1992) (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