84 search results - page 11 / 17 » Evolutionary Parsing for a Probabilistic Context Free Gramma... |
IJCAI
2003
13 years 9 months ago
2003
This paper describes an agent-based evolutionary computing technique called GRAEL (Grammar Evolution), that is able to perform different natural language grammar optimization and ...
NIPS
2001
13 years 9 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
ACL
1993
13 years 9 months ago
1993
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...
PAMI
2006
13 years 7 months ago
2006
This paper proposes a sequential coupling of a Hidden Markov Model (HMM) recognizer for offline handwritten English sentences with a probabilistic bottom-up chart parser using Sto...
CALCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...