NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS
Espen J. Vestre
|
Paper Details:
Month: April
Year: 1991
Location: Berlin, Germany
Venue:
EACL |
Citations
URL
FOCUS ON “ONLY” AND “NOT”
Allan Ramsay
|
An Improved Redundancy Elimination Algorithm for Underspecified Representations
Alexander Koller
|
Stefan Thater
|
Regular Tree Grammars as a Formalism for Scope Underspecification
Alexander Koller
|
Michaela Regneri
|
Stefan Thater
|
Computing Weakest Readings
Alexander Koller
|
Stefan Thater
|
Quantifier Scope and Constituency
Jong C. Park
|
Towards a redundancy elimination algorithm for underspecified descriptions
Alexander Koller
|
Stefan Thater
|
No URLs Found
Field Of Study
Linguistic Trends
Syntax
Language
English
Similar Papers
DATR: A Language for Lexical Knowledge Representation
Roger Evans
|
Gerald Gazdar
|
Generating and Interpreting Referring Expressions as Belief State Planning and Plan Recognition
Dustin Smith
|
Henry Lieberman
|
RECSA: Resource for Evaluating Cross-lingual Semantic Annotation
Achim Rettinger
|
Lei Zhang
|
Daša Berović
|
Danijela Merkler
|
Matea Srebačić
|
Marko Tadić
|
Exploiting Lexical Regularities in Designing Natural Language Systems
Boris Katz
|
Beth Levin
|
Book Reviews: Speaking: From Intention to Articulation
M. Martin Taylor
|
Insup Taylor
|