A Simple Pattern-matching Algorithm for Recovering Empty Nodes and their Antecedents

Mark Johnson


Anthology ID:
P02-1018
Volume:
Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics
Month:
July
Year:
2002
Address:
Philadelphia, Pennsylvania, USA
Editors:
Pierre Isabelle, Eugene Charniak, Dekang Lin
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
136–143
Language:
URL:
https://aclanthology.org/P02-1018
DOI:
10.3115/1073083.1073107
Bibkey:
Cite (ACL):
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, pages 136–143, Philadelphia, Pennsylvania, USA. Association for Computational Linguistics.
Cite (Informal):
A Simple Pattern-matching Algorithm for Recovering Empty Nodes and their Antecedents (Johnson, ACL 2002)
Copy Citation:
PDF:
https://aclanthology.org/P02-1018.pdf