ACL-OCL / Base_JSON /prefixE /json /E95 /E95-1000.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "E95-1000",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T10:31:36.872656Z"
},
"title": "",
"authors": [],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "E95-1000",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "and Alan Smeaton for giving tutorials; John Nerbonne for organising the tutorials; all ACL and EACL officials, for replying promptly to our frequent appeals for advice; Paul Jacobs and Steven Krauwer for providing reusable resources from previous ACL-affiliated meetings; Thorsten Brants for organising the student sessions. The student session is described in more detail in a separate preface (p. iv).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Special thanks are due to Allan Ramsay and his assistants in Dublin for the preparation of these proceedings and for handling the local organisation of the meeting.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Local help in Tfibingen with preparing the papers for the committee and with mailings came from Iris Haberbosch, Katerina Magdou and Stephanie Schwarz.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The meeting in Dublin is the first (E)ACL conference which offers support for students from the Don and Betty Walker International Student Fund to help defray costs for attending the meeting. We would like to take this opportunity to thank all contributors to the fund for their generous help. Your contributions are a tribute to the inspiration that the field of computational linguistics has received from the many years of dedication by Betty Walker and the late Don Walker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We dedicate these Proceedings to Betty and Don Walker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Steven P. Abney and Erhard W. Hinrichs",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For the second time the European Conference of the ACL includes a student session. This part of the conference differs fl'om the main conference in its emphasis on promising work in progress and provides an opportunity for student researchers to receive valuable feedback on their work from other members of the computational linguistics community.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "We received 37 submissions for this student session, eight of which were accepted; one submission was accepted as a reserve paper. We allowed electronic submissions for the student session, and most of the authors (35 of 37) submitted electronically. Except for some minor formatting problems the committee had very good experiences with electronic reviewing and electronic-discussion. We would like to thank the authors for their submissions. An equally important contribution was made by the student programme committee. Every paper was read by at least three of the 20 committee members. Thanks to their efforts, we were able to make a well-informed decision about which papers to select.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "Also we would like to thank the organizers of the main conference, who supported us with their advice throughout the preparations of the session. We welcome their decision to enlarge the student part from six to eight papers, which still left a strong competition between the authors. This two-part tutorial presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's twolevel formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single interpreter. The tutorial is aimed at an NLP audience v~ho want to find about a possible application area for NLP resources and techniques ... information retrieval.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "What is information retrieval ... functionality, including document retrieval, filtering, and routing ... application areas, present and perceived. Conventional approaches to IR ... it is essential to see what other techniques have been used in IR to appreciate where NLP can/cannot be of use .... indexing techniques, boolean retrieval, vector space model, probabilistic modelling, term weighting and relevance feedback, query expansion, ranking.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "Storage structures ... this will be very short, just touching on the engineering problems of managing gigabytes of text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "Three sections cover the guts of the NLP-IR intersection and will be peppered with illustrative examples.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "\u2022 Lexical resources/morphology in indexing by word senses, base forms, grammatical categories, stemming.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "\u2022 Syntax in indexing and matching, phrase identification and extraction, phrase normalisation and matching la is an instance of VP ellipsis, lb is a case of \"bare argument ellipsis\"; and lc contains an exception phrase fragment. I will consider two possible approaches to developing a unified procedure for interpreting these distinct kinds of incomplete constituents. The first involves generating the semantic representation of an appropriate property or relation for the elided constituent fragment. The second attempts to reconstruct a syntactic representation of a VP or sentence containing the fragment. I will consider each approach in some detail, and argue that neither the semantic nor the syntactic view can handle all three types of incomplete constituent. I will provide motivation for the claim that VP ellipsis requires syntactic reconstruction, and that it is, in fact, a species of pseudo-gapping illustrated in 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "2. John gave flowers to Lucy before he did chocolates to Rosa.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "On this view, reconstruction is a relation between an elided VP and an equivalence class of lexically anchored syntactic structures which correspond to an antecedent VP. All elements of the equivalence class exhibit the same syntactic structure, but variation among corresponding lexical anchors with respect to a restricted set of specified features is possible. The syntactic structure of a (perhaps partially) elided VP is reconstructed by identifying its elided head with the head of an antecedent VP, and then specifying a correspondence among the arguments and adjuncts of the antecedent head on one hand and those of the elided head on the other. I discuss the algorithm for VP ellipsis resolution presented in Lappin and McCord (1990) I argue that, contrary to VP ellipsis, bare argument ellipsis must be resolved by means of a semantic procedure for predicate generation. I consider the higher-order unification analysis proposed in Dalrymple et al. (1991) as a possible account of this procedure.",
"cite_spans": [
{
"start": 718,
"end": 742,
"text": "Lappin and McCord (1990)",
"ref_id": null
},
{
"start": 942,
"end": 965,
"text": "Dalrymple et al. (1991)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "Finally, I present arguments for treating an exception phrase fragment not as an instance of ellipsis, but as a displaced NP modifier. NP storage (Cooper (1993) , Pereira (1990) , and Pereira and Pollock (1991)) provides a suitable device for expressing the connection between a displaced exceptior~ phrase and the NP which it modifies.",
"cite_spans": [
{
"start": 146,
"end": 160,
"text": "(Cooper (1993)",
"ref_id": null
},
{
"start": 163,
"end": 177,
"text": "Pereira (1990)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "The study of these three types of incomplete constituents indicates that the interpretation of ellipsis and constituent fragments is not a unified process. Each fragment type requires a different reconstruction procedure which operates at a distinct level of representation. McCORD (1990) , \"Anaphora Resolution in Slot Grammar\", Computational Linguistics 16, pp. 197-212. PEREIRA, F. (1990) , \"Categorial Semantics and Scoping\", Computational Linguistics 16, pp. 1-10. REINHART, T. (1991) , \"Elliptic Conjunctions-Non-Quantificational QR\" in A. Kasher (ed.), The Chomskyan Turn, Blackwell, Oxford, 360-384. SAG, I. (1976) , Deletion and Logical Form, unpublished Ph.D. dissertation, MIT, Cambridge, MA. WEBBER, B. (1979) , A Formal Approach to Discourse Anaphora, Garland Publishing Co., New York. WILLIAMS, E. (1977) , \"Discourse and Logical Form\", Linguistic Inquiry 8, pp. 101-139.",
"cite_spans": [
{
"start": 275,
"end": 288,
"text": "McCORD (1990)",
"ref_id": null
},
{
"start": 356,
"end": 391,
"text": "16, pp. 197-212. PEREIRA, F. (1990)",
"ref_id": null
},
{
"start": 470,
"end": 489,
"text": "REINHART, T. (1991)",
"ref_id": null
},
{
"start": 580,
"end": 622,
"text": "Blackwell, Oxford, 360-384. SAG, I. (1976)",
"ref_id": null
},
{
"start": 625,
"end": 721,
"text": "Deletion and Logical Form, unpublished Ph.D. dissertation, MIT, Cambridge, MA. WEBBER, B. (1979)",
"ref_id": null
},
{
"start": 799,
"end": 818,
"text": "WILLIAMS, E. (1977)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
},
{
"text": "Wednesday, March 29 9:00-9:30 9:45-10:00 10:00-11:00 11:00-11:30 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Student Session Preface",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Nissim Francez Splitting the reference time: temporal anaphora and quantification in DR 141",
"authors": [
{
"first": "Rani",
"middle": [],
"last": "Nelken",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rani Nelken, Nissim Francez Splitting the reference time: temporal anaphora and quantification in DR 141",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Aggregation in the NL-generator of the Visual and Natural Language Specification Tool Patrick Sturt Incorporating \"Unconscious Reanalysis",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aggregation in the NL-generator of the Visual and Natural Language Specification Tool Patrick Sturt Incorporating \"Unconscious Reanalysis\" into an Incremental, Monotonic Parser",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"uris": null,
"text": "and extended in McCord et at. as an implementation of this analysis.",
"num": null
},
"FIGREF1": {
"type_str": "figure",
"uris": null,
"text": "Background Reading:DALRYMPLE, M., S. SHIEBER, AND F. PEREIRA (1991), \"Ellipsis and Higher-Order Unification\", Linguistics and Philosophy 14, pp. 399-452. FIENGO, R. AND R. MAY(1994), Indices and Identity, MIT Press, Cambridge, MA. HAIK, I. (1987), \"Bound Variables that Need to Be\", Linguistics and Philosophy 11, pp. 503-530. HARDT, D. (1993), Verb Phrase Ellipsis: Form, Meaning, and Processing, unpublished Ph.D. dissertation, University of Pennsylvania, Philadelphia, PA. LAPPIN, S. (1993A), \"The Syntactic Basis of Ellipsis Resolution\" in S. Berman and A. Hestvik (eds.), Proceedings of the Stuttgart Ellipsis Workshop, Arbeitspapiere des Sonderforschungsbereichs 340, Bericht Nr. 29-1992, University of Stuttgart, Stuttgart. LAPPIN, S. (1993B), \"Ellipsis Resolution at S-Structure\" in Amy Schafer (ed.), Proceedings of NELS 23, University of Massachusetts, Amherst, MA., pp. 255-269. LAPPIN, S. AND M.",
"num": null
},
"TABREF0": {
"type_str": "table",
"html": null,
"text": "",
"content": "<table><tr><td/><td>Tutorials</td></tr><tr><td colspan=\"2\">Tuesday, March 28</td></tr><tr><td>9:00</td><td>Tutorial Registration</td></tr><tr><td>9:30-12:30,</td><td>Martin Kay, Xerox PARC and Stanford</td></tr><tr><td>2:00-5:00</td><td colspan=\"2\">Theory and Implementation of Finite-State Phonology</td></tr><tr><td/><td colspan=\"2\">Student Programme Committee</td></tr><tr><td/><td>Antdnio H. Branco (Lisbon)</td><td>Anne-Marie Mineur (Saarbriicken)</td></tr><tr><td/><td>Thorsten Brants (Saarbriicken, Chair)</td><td>Lineke Oppentocht (Leiden)</td></tr><tr><td/><td>Luca Dini (Pisa)</td><td>Susanne Riehemann (Stanford, CA)</td></tr><tr><td/><td>Gregor Erbach (Saarbriicken)</td><td>Alexander Rosen (Praha)</td></tr><tr><td/><td>Francesc Ribas i Pramis (Barcelona)</td><td>Elina Savino (Bari)</td></tr><tr><td/><td>Anette Prank (Stuttgart)</td><td>Hana Skoumalova (Praha)</td></tr><tr><td/><td>Zelal Giing6rdii (Edinburgh)</td><td>Lena StrSmb/ick (LinkSping)</td></tr><tr><td/><td>Jussi Karlgren (Stockholm, Co-Chair)</td><td>David Tugwell (Edinburgh)</td></tr><tr><td/><td>Krister Linden (Helsinki)</td><td>Kees Vermeulen (Utrecht)</td></tr><tr><td/><td>Gemma Lyons (Dublin)</td><td>Barbara Wesenick (Mfinchen)</td></tr></table>",
"num": null
},
"TABREF1": {
"type_str": "table",
"html": null,
"text": "Recommended Reading: RONALD M. KAPLAN AND MARTIN KAY, \"Regular Models of Phonological Rule Systems,\" Computational Linguistics 20(3), 1994, 331-378.",
"content": "<table/>",
"num": null
},
"TABREF2": {
"type_str": "table",
"html": null,
"text": "Semantics in indexing and matching ... KR formalisms, examples of systems/prototypes which use higher-order NLP Issues of scale ... examples and illustrations of NLP-based IR (IR using NLP tools, techniques or resources) working on large scale collections, examples from TREC.Research issues and trends ... this section will be a discussion, led by me, on what I perceive as the directions in which the IR-NLP intersection will head.The sentences in 1 illustrate three types of incomplete structures. la. John read the paper before Bill did. b. Max gave flowers to Lucy, and chocolates too.",
"content": "<table><tr><td>2:00-5:00</td><td>Shalom Lappin, School for Oriental and African Languages, University of London</td></tr><tr><td/><td>Computational Approaches to Ellipsis</td></tr></table>",
"num": null
}
}
}
}