2002 ASimpleApproachToEmptyNodeFilling
(Johnson, 2002) ⇒ Mark Johnson. (2002). “A Simple Pattern-Matching Algorithm for Recovering Empty Nodes and Their Antecedents.” In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL 2002).
Subject Headings: Natural Language Parsing
Notes
Cited By
- 2004_LongDistanceDepResolutionInLFGApprox.
- Unlike (Collins, 1999; Johnson, 2002), in our approach resolution of LDDs is done at f-structure (attribute-value structure representations of basic predicate-argument or dependency structure) without empty productions, traces and coindexation in CFG parse trees
Quotes
Abstract
One of the main motivations for research on parsing is that syntactic structure provides important information for semantic interpretation; hence syntactic parsing is an important rst step in a variety of useful tasks. Broad coverage syntactic parsers with good performance have recently become available (Charniak, 2000; Collins, 2000), but these typically produce as output a parse tree that only encodes local syntactic information, i.e., a tree that does not include any empty nodes. (Collins (1997) discusses the recovery of one kind of empty node, viz., WH-traces). This paper describes a simple patternmatching algorithm for post-processing the output of such parsers to add a wide variety of empty nodes to its parse trees."
References
- Ann Bies, Mark Ferguson, Karen Katz, and Robert MacIntyre, (1995). Bracketting Guideliness for Treebank II style Penn Treebank Project. Linguistic Data Consortium.
- Eugene Charniak. (2000). A maximum-entropy-inspired parser. In The Proceedings of the North American Chapter of the Association for Computational Linguistics.
- Michael Collins. (1997). Three generative, lexicalised models for statistical parsing. In The Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, San Francisco. Morgan Kaufmann.
Michael Collins. (2000). Discriminative reranking for natural language parsing. In Machine Learning: Proceedings of the Seventeenth International Conference (ICML 2000), pages 175ñ182, Stanford, California. Ferenc G¥ecseg and Magnus Steinby. (1984). Tree Automata. Akad¥emiai Kiad¥o, Budapest. Mark Johnson. (1998). PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613ñ632. Michell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. (1993). Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313ñ330.
- (Witten & Frank, 2000) ⇒ Ian H. Witten, and Eibe Frank. (2000). “Data Mining: Practical Machine Learning Tools and Techniques with Java implementations.” Morgan Kaufmann.
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 2002 ASimpleApproachToEmptyNodeFilling | Mark Johnson | A Simple Pattern-Matching Algorithm for Recovering Empty Nodes and Their Antecedents | Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics | http://cog.brown.edu:16080/~mj/papers/acl02-emptynodes.pdf | 2002 |