39 search results - page 3 / 8 » Tree Compression Using String Grammars |
ACL
1989
13 years 6 months ago
1989
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to ...
ACL
1998
13 years 6 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
FSMNLP
2009
Springer
13 years 3 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...