Sciweavers

186 search results - page 25 / 38
» Grammar constraints
Sort
View
ACL
1993
13 years 8 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
JUCS
2006
141views more  JUCS 2006»
13 years 7 months ago
Constraint Based Methods for Biological Sequence Analysis
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
Maryam Bavarian, Verónica Dahl
IJCNLP
2005
Springer
14 years 26 days ago
CTEMP: A Chinese Temporal Parser for Extracting and Normalizing Temporal Information
Temporal information is useful in many NLP applications, such as information extraction, question answering and summarization. In this paper, we present a temporal parser for extra...
Mingli Wu, Wenjie Li, Qin Lu, Baoli Li
COGSCI
2010
111views more  COGSCI 2010»
13 years 7 months ago
Mechanisms of Cognitive Development: Domain-General Learning or Domain-Specific Constraints?
many abstract categories (e.g., ``equivalence'') is innate. Although Plato argued with his contemporaries who advocated the empirical basis of knowledge, it was the Briti...
Vladimir Sloutsky
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
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 safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...