Abstract
We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.- Anthology ID:
- 1997.iwpt-1.23
- Volume:
- Proceedings of the Fifth International Workshop on Parsing Technologies
- Month:
- September 17-20
- Year:
- 1997
- Address:
- Boston/Cambridge, Massachusetts, USA
- Editors:
- Anton Nijholt, Robert C. Berwick, Harry C. Bunt, Bob Carpenter, Eva Hajicova, Mark Johnson, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Alon Lavie, Makoto Nagao, Mark Steedman, Masaru Tomita, K. Vijay-Shanker, David Weir, Kent Wittenburg, Mats Wiren
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 199–209
- Language:
- URL:
- https://aclanthology.org/1997.iwpt-1.23
- DOI:
- Bibkey:
- Cite (ACL):
- Frederic Tendeau. 1997. An Earley Algorithm for Generic Attribute Augmented Grammars and Applications. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 199–209, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.
- Cite (Informal):
- An Earley Algorithm for Generic Attribute Augmented Grammars and Applications (Tendeau, IWPT 1997)
- Copy Citation:
- PDF:
- https://aclanthology.org/1997.iwpt-1.23.pdf
Export citation
@inproceedings{tendeau-1997-earley, title = "An {E}arley Algorithm for Generic Attribute Augmented Grammars and Applications", author = "Tendeau, Frederic", editor = "Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats", booktitle = "Proceedings of the Fifth International Workshop on Parsing Technologies", month = sep # " 17-20", year = "1997", address = "Boston/Cambridge, Massachusetts, USA", publisher = "Association for Computational Linguistics", url = "https://aclanthology.org/1997.iwpt-1.23", pages = "199--209", abstract = "We describe an extension of Earley{'}s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.", }
<?xml version="1.0" encoding="UTF-8"?> <modsCollection xmlns="http://www.loc.gov/mods/v3"> <mods ID="tendeau-1997-earley"> <titleInfo> <title>An Earley Algorithm for Generic Attribute Augmented Grammars and Applications</title> </titleInfo> <name type="personal"> <namePart type="given">Frederic</namePart> <namePart type="family">Tendeau</namePart> <role> <roleTerm authority="marcrelator" type="text">author</roleTerm> </role> </name> <originInfo> <dateIssued>1997-sep 17-20</dateIssued> </originInfo> <typeOfResource>text</typeOfResource> <relatedItem type="host"> <titleInfo> <title>Proceedings of the Fifth International Workshop on Parsing Technologies</title> </titleInfo> <name type="personal"> <namePart type="given">Anton</namePart> <namePart type="family">Nijholt</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Robert</namePart> <namePart type="given">C</namePart> <namePart type="family">Berwick</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Harry</namePart> <namePart type="given">C</namePart> <namePart type="family">Bunt</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Bob</namePart> <namePart type="family">Carpenter</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Eva</namePart> <namePart type="family">Hajicova</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Mark</namePart> <namePart type="family">Johnson</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Aravind</namePart> <namePart type="family">Joshi</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Ronald</namePart> <namePart type="family">Kaplan</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Martin</namePart> <namePart type="family">Kay</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Bernard</namePart> <namePart type="family">Lang</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Alon</namePart> <namePart type="family">Lavie</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Makoto</namePart> <namePart type="family">Nagao</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Mark</namePart> <namePart type="family">Steedman</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Masaru</namePart> <namePart type="family">Tomita</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">K</namePart> <namePart type="family">Vijay-Shanker</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">David</namePart> <namePart type="family">Weir</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Kent</namePart> <namePart type="family">Wittenburg</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <name type="personal"> <namePart type="given">Mats</namePart> <namePart type="family">Wiren</namePart> <role> <roleTerm authority="marcrelator" type="text">editor</roleTerm> </role> </name> <originInfo> <publisher>Association for Computational Linguistics</publisher> <place> <placeTerm type="text">Boston/Cambridge, Massachusetts, USA</placeTerm> </place> </originInfo> <genre authority="marcgt">conference publication</genre> </relatedItem> <abstract>We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.</abstract> <identifier type="citekey">tendeau-1997-earley</identifier> <location> <url>https://aclanthology.org/1997.iwpt-1.23</url> </location> <part> <date>1997-sep 17-20</date> <extent unit="page"> <start>199</start> <end>209</end> </extent> </part> </mods> </modsCollection>
%0 Conference Proceedings %T An Earley Algorithm for Generic Attribute Augmented Grammars and Applications %A Tendeau, Frederic %Y Nijholt, Anton %Y Berwick, Robert C. %Y Bunt, Harry C. %Y Carpenter, Bob %Y Hajicova, Eva %Y Johnson, Mark %Y Joshi, Aravind %Y Kaplan, Ronald %Y Kay, Martin %Y Lang, Bernard %Y Lavie, Alon %Y Nagao, Makoto %Y Steedman, Mark %Y Tomita, Masaru %Y Vijay-Shanker, K. %Y Weir, David %Y Wittenburg, Kent %Y Wiren, Mats %S Proceedings of the Fifth International Workshop on Parsing Technologies %D 1997 %8 sep 17 20 %I Association for Computational Linguistics %C Boston/Cambridge, Massachusetts, USA %F tendeau-1997-earley %X We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes. %U https://aclanthology.org/1997.iwpt-1.23 %P 199-209
Markdown (Informal)
[An Earley Algorithm for Generic Attribute Augmented Grammars and Applications](https://aclanthology.org/1997.iwpt-1.23) (Tendeau, IWPT 1997)
- An Earley Algorithm for Generic Attribute Augmented Grammars and Applications (Tendeau, IWPT 1997)
ACL
- Frederic Tendeau. 1997. An Earley Algorithm for Generic Attribute Augmented Grammars and Applications. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 199–209, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.