1064 search results - page 55 / 213 » Single Tree Grammars |
105
Voted
ACL
1998
15 years 4 months ago
1998
This paper presents a technique to deal with multiword nominal terminology in a computational Lexical Functional Grammar. This method treats multiword terms as single tokens by mo...
103
click to vote
ECML
2003
Springer
15 years 8 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
124
Voted
DAGM
2008
Springer
15 years 5 months ago
2008
Springer
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
145
Voted
ACL
2010
15 years 1 months ago
2010
This paper establishes a connection between two apparently very different kinds of probabilistic models. Latent Dirichlet Allocation (LDA) models are used as "topic models&qu...
133
click to vote
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...