Sciweavers

129 search results - page 13 / 26
» Towards Discontinuous Grammar
Sort
View
CASCON
2006
117views Education» more  CASCON 2006»
13 years 9 months ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
ICCS
2005
Springer
14 years 1 months ago
On the Need to Bootstrap Ontology Learning with Extraction Grammar Learning
The main claim of this paper is that machine learning can help integrate the construction of ontologies and extraction grammars and lead us closer to the Semantic Web vision. The p...
Georgios Paliouras
VLDB
2007
ACM
136views Database» more  VLDB 2007»
14 years 7 months ago
A STEP Towards Realizing Codd's Vision of Rendezvous with the Casual User
This demonstration showcases the STEP system for natural language access to relational databases. In STEP an administrator authors a highly structured semantic grammar through cou...
Michael Minock
ALT
2010
Springer
13 years 9 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark
EACL
1993
ACL Anthology
13 years 8 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte