Sciweavers

81 search results - page 3 / 17
» Genetic Programming for Natural Language Parsing
Sort
View
CNL
2009
13 years 7 months ago
The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
Marcos Cramer, Bernhard Fisseni, Peter Koepke, Dan...
ACL
1989
13 years 7 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
FCCM
2000
IEEE
83views VLSI» more  FCCM 2000»
13 years 10 months ago
An FPGA-Based Coprocessor for the Parsing of Context-Free Grammars
This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes. The application elds of such a parser range from p...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
AAAI
2011
12 years 6 months ago
Tree Sequence Kernel for Natural Language
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
Jun Sun, Min Zhang, Chew Lim Tan
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
13 years 9 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo