Sciweavers

372 search results - page 47 / 75
» On the Structural Complexity of Natural Language Sentences
Sort
View
ACL
1990
13 years 9 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 12 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
KBSE
2008
IEEE
14 years 2 months ago
QuARS Express - A Tool Demonstration
Requirements analysis is an important phase in a software project. Automatic evaluation of Natural Language (NL) requirements documents has been proposed as a means to improve the...
Antonio Bucchiarone, Stefania Gnesi, Giuseppe Lami...
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
14 years 8 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
WWW
2008
ACM
14 years 9 months ago
Structured objects in owl: representation and reasoning
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
Boris Motik, Bernardo Cuenca Grau, Ulrike Sattler