COLING 2008 | Sciweavers

Proof-Nets (Roorda 1990) are a good device for processing with categorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readab...

Alain Lecomte

claim paper

Read More »

15

click to vote

COLING
1990

66views Computational Linguistics» more COLING 1990»

A Constraint-Based Approach to Linguistic Performance

14 years 20 days ago

Download acl.ldc.upenn.edu

Kôiti Hasida

claim paper

Read More »

33

click to vote

COLING
1992

97views Computational Linguistics» more COLING 1992»

Using Linguistic, World, And Contextual Knowledge In A Plan Recognition Model Of Dialogue

14 years 20 days ago

Download acl.ldc.upenn.edu

This paper presents a plan-based model of dialogue that combines world, linguistic, and contextual knowledge in order to recognize complex communicative actions such as expressing...

Lynn Lambert, Sandra Carberry

claim paper

Read More »

23

click to vote

COLING
1990

83views Computational Linguistics» more COLING 1990»

Constraining Tree Adjoining Grammars by Unification

14 years 20 days ago

Download acl.ldc.upenn.edu

Karin Harbusch

claim paper

Read More »

21

click to vote

COLING
1990

82views Computational Linguistics» more COLING 1990»

Hierarchy of Salience and Discourse Analysis and Production

14 years 20 days ago

Download acl.ldc.upenn.edu

Eva Hajicová, Petr Kubon, Vladislav Kubon

claim paper

Read More »

33

click to vote

COLING
1992

96views Computational Linguistics» more COLING 1992»

Dynamic Programming Method for Analyzing Conjunctive Structures in Japanese

14 years 20 days ago

Download acl.ldc.upenn.edu

Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...

Sadao Kurohashi, Makoto Nagao

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers