Abstract
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time.- Anthology ID:
- 1997.iwpt-1.11
- 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:
- 66–76
- Language:
- URL:
- https://aclanthology.org/1997.iwpt-1.11
- DOI:
- Bibkey:
- Cite (ACL):
- Roger Evans and David Weir. 1997. Automaton-based Parsing for Lexicalised Grammars. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 66–76, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.
- Cite (Informal):
- Automaton-based Parsing for Lexicalised Grammars (Evans & Weir, IWPT 1997)
- Copy Citation:
- PDF:
- https://aclanthology.org/1997.iwpt-1.11.pdf
Export citation
@inproceedings{evans-weir-1997-automaton,
title = "Automaton-based Parsing for Lexicalised Grammars",
author = "Evans, Roger and
Weir, David",
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.11",
pages = "66--76",
abstract = "In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="evans-weir-1997-automaton">
<titleInfo>
<title>Automaton-based Parsing for Lexicalised Grammars</title>
</titleInfo>
<name type="personal">
<namePart type="given">Roger</namePart>
<namePart type="family">Evans</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">David</namePart>
<namePart type="family">Weir</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>In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time.</abstract>
<identifier type="citekey">evans-weir-1997-automaton</identifier>
<location>
<url>https://aclanthology.org/1997.iwpt-1.11</url>
</location>
<part>
<date>1997-sep 17-20</date>
<extent unit="page">
<start>66</start>
<end>76</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings %T Automaton-based Parsing for Lexicalised Grammars %A Evans, Roger %A Weir, David %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 evans-weir-1997-automaton %X In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time. %U https://aclanthology.org/1997.iwpt-1.11 %P 66-76
Markdown (Informal)
[Automaton-based Parsing for Lexicalised Grammars](https://aclanthology.org/1997.iwpt-1.11) (Evans & Weir, IWPT 1997)
- Automaton-based Parsing for Lexicalised Grammars (Evans & Weir, IWPT 1997)
ACL
- Roger Evans and David Weir. 1997. Automaton-based Parsing for Lexicalised Grammars. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 66–76, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.