Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs

Advaith Siddharthan

Research output: Contribution to conferencePaper

Abstract

There are two important disambiguation problems to solve when dis-embedding
relative clauses for simplifying text finding the noun phrase the clause refers
to and identifying the clause boundary. We argue that we can make these disambiguation decisions more reliably by using local context than by using general
purpose tools like wide-coverage statistical parsers.
Original languageEnglish
Publication statusPublished - 2002
Event40th Meeting of the Association for Computational Linguistics (ACL'02) - Philadelphia, PA, United States
Duration: 6 Jul 200212 Jul 2002

Conference

Conference40th Meeting of the Association for Computational Linguistics (ACL'02)
CountryUnited States
CityPhiladelphia, PA
Period6/07/0212/07/02

Cite this

Siddharthan, A. (2002). Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs. Paper presented at 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia, PA, United States.

Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs. / Siddharthan, Advaith.

2002. Paper presented at 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia, PA, United States.

Research output: Contribution to conferencePaper

Siddharthan, A 2002, 'Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs' Paper presented at 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia, PA, United States, 6/07/02 - 12/07/02, .
Siddharthan A. Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs. 2002. Paper presented at 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia, PA, United States.
Siddharthan, Advaith. / Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs. Paper presented at 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia, PA, United States.
@conference{b37f32eb29d24b2b93b7f8de873cc021,
title = "Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs",
abstract = "There are two important disambiguation problems to solve when dis-embedding relative clauses for simplifying text finding the noun phrase the clause refers to and identifying the clause boundary. We argue that we can make these disambiguation decisions more reliably by using local context than by using general purpose tools like wide-coverage statistical parsers.",
author = "Advaith Siddharthan",
note = "Proceedings of the Student Workshop, 40th Meeting of the Association for Computational Linguistics (ACL'02), July 6-12, 2002, Philadelphia, PA, USA; 40th Meeting of the Association for Computational Linguistics (ACL'02) ; Conference date: 06-07-2002 Through 12-07-2002",
year = "2002",
language = "English",

}

TY - CONF

T1 - Resolving Attachment and Clause Boundary Ambiguities for Simplifying Relative Clause Constructs

AU - Siddharthan, Advaith

N1 - Proceedings of the Student Workshop, 40th Meeting of the Association for Computational Linguistics (ACL'02), July 6-12, 2002, Philadelphia, PA, USA

PY - 2002

Y1 - 2002

N2 - There are two important disambiguation problems to solve when dis-embedding relative clauses for simplifying text finding the noun phrase the clause refers to and identifying the clause boundary. We argue that we can make these disambiguation decisions more reliably by using local context than by using general purpose tools like wide-coverage statistical parsers.

AB - There are two important disambiguation problems to solve when dis-embedding relative clauses for simplifying text finding the noun phrase the clause refers to and identifying the clause boundary. We argue that we can make these disambiguation decisions more reliably by using local context than by using general purpose tools like wide-coverage statistical parsers.

M3 - Paper

ER -