Sciweavers

10 search results - page 1 / 2
» Leveraging Lexical Semantics to Infer Context-Free Grammars
Sort
View
ECML
2003
Springer
13 years 10 months ago
Leveraging Lexical Semantics to Infer Context-Free Grammars
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...
ICML
2005
IEEE
14 years 6 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
ACL
1990
13 years 6 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é
CORR
1998
Springer
145views Education» more  CORR 1998»
13 years 5 months ago
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
We here explore a "fully" lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger ...
Bonnie L. Webber, Aravind K. Joshi
COLING
2010
13 years 8 days ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan