A ROBUST PARSING ALGORITHM FOR LINK GRAMMARS

IWPT 1995 - 4th International Workshop on Parsing Technologies, Proceedings

Volumn , Issue , 1995, Pages 111-125

  Grinberg, Dennis ^a   Lafferty, John ^a   Sleator, Daniel ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; SYNTACTICS;

DICTIONARY DEFINITIONS; GRAMMAR FORMALISMS; LINK GRAMMAR; MODIFIED ALGORITHMS; NATURAL EXTENSION; NATURAL LANGUAGES; PARSING ALGORITHM; RECOGNITION ALGORITHM; ROBUST PARSING; SUB-STRINGS;

DYNAMIC PROGRAMMING;

EID: 85123319196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. J. Godfrey, E. Holliman, and J. McDaniel. Switchboard: Telephone speech corpus for research development. In Proc. ICASSP-92, pages 1-517-520, 1992.
2. A. LavieandM.Tomita. Parsing unrestricted sentences using ageneralizedLRparser. In Proceedings of the Third International Workshop on Parsing Technologies, pages 123-134, 1993.
3. K. J. Lee, C. J. Kweon, J. Seo, and G. C. Kim. A robust parser based on syntactic information. In Proceedings of the 7th Conference of the European Chapter of the Associationfor Computational Linguistics, 1995.
4. G. Lyon. Syntax-directed least-errors analysis for context-free languages: A practical approach. Communications ofthe ACM, 17(1):3-14, Jan 1974.
5. D. D. K. Sleator and D. Temperley. Parsing English with a link grammar. Technical Report CMU-CS-91-196, School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, 1991.