Sciweavers

341 search results - page 40 / 69
» Formal Grammars of Early Language
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 28 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
EACL
2003
ACL Anthology
13 years 10 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
LISA
2003
13 years 10 months ago
Using Service Grammar to Diagnose BGP Configuration Errors
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
Xiaohu Qie, Sanjai Narain
FQAS
2009
Springer
181views Database» more  FQAS 2009»
14 years 3 months ago
Interlingual Information Extraction as a Solution for Multilingual QA Systems
Information extraction systems have been dealt with at length from the viewpoint of users posing definite questions whose expected answer is to be found in a document collection. T...
Jesús Cardeñosa, Carolina Gallardo, ...
BIRTHDAY
2003
Springer
14 years 1 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg