Title
Count-based State Merging for Probabilistic Regular Tree Grammars.
Abstract
We present an approach to obtain language models from a tree corpus using probabilistic regular tree grammars (prtg). Starting with a prtg only generating trees from the corpus, the prtg is generalized step by step by merging nonterminals. We focus on bottom-up deterministic prtg to simplify the calculations.
Year
Venue
Field
2015
FSMNLP
Computer science,Tree grammars,Theoretical computer science,Artificial intelligence,Natural language processing,Probabilistic logic,Merge (version control),Language model
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Toni Dietze100.34
Mark-jan Nederhof238753.30