Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ACL
1989

favoriteEmaildiscussreport

77views Computational Linguistics» more ACL 1989»

A Computational Mechanism for Pronominal Reference

13 years 5 months ago

A Computational Mechanism for Pronominal Reference

Download acl.ldc.upenn.edu

the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents.

Robert Ingria, David Stallard

Real-time Traffic

ACL 1989 | ACL 2007 | Disjoint Reference | Impossible Antecedents | Semantic Interpretation Procedure |

claim paper

Related Content

» A Computational Model for Generating Referring Expressions in a Multilingual Application D...

» Resolving Anaphora in a Portable Natural Language Front End to Databases

» Reference Path Ad Hoc Routing Mechanism

» Annotated Memory References A Mechanism for Informed Cache Management

» Device Driver Safety Through a Reference Validation Mechanism

» Building a stateful reference monitor with coloured petri nets

» Cooking Up Referring Expressions

» Mobility Mechanisms in Service Oriented Computing

» A Synchronous CoAllocation Mechanism for Grid Computing Systems

Post Info
More Details (n/a)

Added	06 Nov 2010
Updated	06 Nov 2010
Type	Conference
Year	1989
Where	ACL
Authors	Robert Ingria, David Stallard

Comments (0)